Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

 

The smallest solutions to the diophantine equation $x^6+y^6=a^6+b^6+c^6+d^6+e^6$


Authors: Giovanni Resta and Jean-Charles Meyrignac
Journal: Math. Comp. 72 (2003), 1051-1054
MSC (2000): Primary 11D41, 11Y50
Published electronically: June 6, 2002
MathSciNet review: 1954984
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: In this paper we discuss a method used to find the smallest nontrivial positive integer solutions to $a_1^6+a_2^6=b_1^6+b_2^6+b_3^6+b_4^6+b_5^6$. The method, which is an improvement over a simple brute force approach, can be applied to search the solution to similar equations involving sixth, eighth and tenth powers.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2000): 11D41, 11Y50

Retrieve articles in all journals with MSC (2000): 11D41, 11Y50


Additional Information

Giovanni Resta
Affiliation: Istituto di Matematica Computazionale -CNR, Pisa, Italy.
Email: resta@imc.pi.cnr.it

Jean-Charles Meyrignac
Email: euler@free.fr

DOI: http://dx.doi.org/10.1090/S0025-5718-02-01445-X
PII: S 0025-5718(02)01445-X
Keywords: Diophantine equations, computational number theory
Received by editor(s): May 24, 1999
Received by editor(s) in revised form: April 3, 2001, and July 9, 2001
Published electronically: June 6, 2002
Article copyright: © Copyright 2002 American Mathematical Society