arXiv · 1705.01074
A note on the Diophantine equation $2^{n-1}(2^{n}-1)=x^3+y^3+z^3$
Abstract
Motivated by the recent result of Farhi we show that for each $n\equiv \pm 1\pmod{6}$ the title Diophantine equation has at least two solutions in integers. As a consequence, we get that each (even) perfect number is a sum of three cubes of integers. Moreover, we present some computational results concerning the considered equation and state some questions and conjectures.
Explore related subjects
Keep this discovery
Maciej Ulas. 2017-05-02. A note on the Diophantine equation $2^{n-1}(2^{n}-1)=x^3+y^3+z^3$. https://arxiv.org/abs/1705.01074
Cite the original work for its findings. Save a collection to share your selection of sources.