New Solutions of d=2x³+y³+z³

2011/09/12 by Allan J. MacLeod, MacLeod, Allan J.
Computer Science · Mathematics · #Algebraic Geometry and Number Theory #Coding theory and cryptography #Cryptography and Residue Arithmetic #FOS: Mathematics #Number Theory (math.NT) #math.NT

paper · pdf · doi:10.48550/arxiv.1109.2396

arxiv created 2011/09/12 · openalex publication_date 2011/09/12 · arxiv updated 2011/09/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We discuss finding large integer solutions of d=2x³+y³+z³ by using Elsenhans and Jahnel's adaptation of Elkies' LLL-reduction method. We find 28 first solutions for |d|<10000.

Related

• Newer sums of three cubes
• Existential refinement on the search of integer solutions for the diophantine equation x³+y³+z³=n
• Cracking the problem with 33
• Nontrivial solutions to the Fermat equation x³+y³=kz³ over quadratic number fields
• Primitive Integral Solutions to x² + y³ = z¹⁰