On the equation 1!^k+2!^k++n!^k=x^2
Consider the equation given in the title of this paper, where parameters \(n\), \(k\), and \(x\) are positive integers, and ignore the trivial case \(n=1\). One readily verifies that triples \((n,k,x)\) given by \((2,3,3)\), \((3,1,3)\), and \((3,3,15)\) are solutions. The author conjectures that these are the only nontrivial solutions. Indeed, the author shows that no further solutions with \(n=2\) or \(n\geq 4\) are to be found, leaving only the equation \(1+2^k+6^k=x^2\). Moreover, it is shown that the number of solutions to this equation is finite, with \((k,x)=(1,3)\) and \((3,15)\) being two of them, and that if any further solutions exist, they must have \(k\equiv 3\pmod 4\).
- A note on the Diophantine equation \(x!+A=y^2\)
- Variants of the Diophantine equation \(n! + 1 = y^2\)
- On the number of solutions of the equation \(1^k+2^k+\dots+(x-1)^k=y^z\)
- Diophantine equations involving factorials.
- On the Diophantine equations \((2^n-1)(6^n-1)=x^2\) and \((a^n-1)(a^{kn}-1)=x^2\)
- The polynomial-exponential equation \(1 + 2^a + 6^b = y^q\)
- On the equation \(A!B!=C!\)
- On the equation \(1+q+q^2+\cdots +q^{n-1}=p^m\)
- On compositions with 𝑥²/(1-𝑥)
- On the equation \(n! = a_1! a_2! \cdots a_t!\)
- scientific article; zbMATH DE number 1992399 (Why is no real title available?)
- ON THE EQUATION x(x+d)…(x+(k-1)d)=by 2
- A note on the Diophantine equation \(x!+A=y^2\)
This page was built for publication: On the equation \(1!^k+2!^k+\cdots+n!^k=x^2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1397467)
