A note on the Diophantine equation 2ⁿ-1(2ⁿ-1)=x^3+y^3+z^3
It is no known if there is an odd perfect numbers but since Euclid we know that each even perfect number is of the form \(2^{p-1}(2^p-1)\) where \(p\) and \(2^p-1\) are primes. \par The author proves that if \(n\equiv 1\pmod 3\) or \(n\equiv 2\pmod 6\) then the equation \[ 2^{n-1}(2^n-1)=x^3+y^3+z^3 \] has at least one integer solution. If \(n\equiv \pm 1\pmod 6\) then this equation has at least two integer solutions. The result implies that any even perfect number can be written as a sum of three cubes. The author gives elegant elementary proofs. The paper is completed with numerical results, questions and conjectures.
- A note on the Diophantine equation \(lx^3-kx^2+kx-1=y^2\): the cases \(k=3l\pm 1\)
- On the representation of an even perfect number as the sum of five cubes
- A note on the Diophantine equation (x+1)^3 + (x+2)^3 + + (2x)^3 = y^n
- scientific article; zbMATH DE number 896487 (Why is no real title available?)
- On a remark of Makowski about perfect numbers
This page was built for publication: A note on the Diophantine equation \(2^{n-1}(2^{n}-1)=x^3+y^3+z^3\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631753)
