The smallest solutions to the diophantine equation 𝑥⁶+𝑦⁶=𝑎⁶+𝑏⁶+𝑐⁶+𝑑⁶+𝑒⁶

DOI10.1090/S0025-5718-02-01445-XzbMath1026.11037OpenAlexW3001966146MaRDI QIDQ4794660

Jean-Charles Meyrignac, Giovanni Resta

Publication date: 19 February 2003

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-02-01445-x

zbMATH Keywords

computational methodshigher-order Diophantine equations

Mathematics Subject Classification ID

Computer solution of Diophantine equations (11Y50) Diophantine equations in many variables (11D72) Higher degree equations; Fermat's equation (11D41)

Cites Work

• Unnamed Item
• New results in equal sums of like powers
• A Survey of Equal Sums of Like Powers

This page was built for publication: The smallest solutions to the diophantine equation 𝑥⁶+𝑦⁶=𝑎⁶+𝑏⁶+𝑐⁶+𝑑⁶+𝑒⁶