The Diophantine Equation 𝑥⁴+2𝑦⁴=𝑧⁴+4𝑤⁴
Open Access
- 19 December 2005
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 75 (254) , 935-940
Abstract
We show that, within the hypercube | x | , | y | , | z | , | w | ≤ 2.5 ⋅ 10 6 |x|,|y|,|z|,|w| \leq 2.5 \cdot 10^6 , the Diophantine equation x 4 + 2 y 4 = z 4 + 4 w 4 x^4 + 2 y^4 = z^4 + 4 w^4 admits essentially one and only one nontrivial solution, namely ( ± 1 484 801 , ± 1 203 120 , ± 1 169 407 , ± 1 157 520 ) (\pm 1\,484\,801, \pm 1\,203\,120, \pm 1\,169\,407, \pm 1\,157\,520) . The investigation is based on a systematic search by computer.Keywords
This publication has 8 references indexed in Scilit:
- Arithmetic of Higher-Dimensional Algebraic Varieties2004
- Enumerating solutions to 𝑝(𝑎)+𝑞(𝑏)=𝑟(𝑐)+𝑠(𝑑)Mathematics of Computation, 2000
- The Algorithmic Resolution of Diophantine Equations1998
- Complex Algebraic Surfaces1996
- Algorithmische Zahlentheorie1996
- Introduction to AlgorithmsJournal of the Operational Research Society, 1991
- Sur les courbes algébriques et les variétés qui s’en déduisent (Introduction)1979
- La conjecture de Weil : IPublications mathématiques de l'IHÉS, 1974