A note on the Diophantine equation 2ⁿ-1(2ⁿ-1)=x^3+y^3+z^3

DOI10.7169/FACM/1700MaRDI QIDQ2631753zbMATH OpenOpenAlexFDO

Authors Maciej Ulas

Publication date 16 May 2019

Published in Functiones et Approximatio. Commentarii Mathematici (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1705.01074, https://projecteuclid.org/euclid.facm/1522202458

zbMATH Keywords

perfect numberssums of three cubes

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Cubic and quartic Diophantine equations (11D25) Exponential Diophantine equations (11D61)

Abstract: Motivated by the recent result of Farhi we show that for each $nequivpm1pmod6$ 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.

Recommendations

• On the representation of an even perfect number as the sum of five cubes
• On a remark of Makowski about perfect numbers
• New sums of three cubes
• On equal sums of cubes
• scientific article; zbMATH DE number 4079520

Cited in

(5)

• On the representation of an even perfect number as the sum of five cubes
• On a remark of Makowski about perfect numbers
• scientific article; zbMATH DE number 896487 (Why is no real title available?)
• A note on the Diophantine equation \(lx^3-kx^2+kx-1=y^2\): the cases \(k=3l\pm 1\)
• A note on the Diophantine equation \((x+1)^3 + (x+2)^3 + \cdots + (2x)^3 = y^n\)

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)