On the equation $Y^2 = X^6 + k$
Andrew Bremner, Nikos Tzanakis

TL;DR
This paper explicitly finds all rational solutions to the equation Y^2 = X^6 + k for integers |k| ≤ 50, using various methods from elementary to advanced algebraic techniques, highlighting the complexity and challenges in solving such equations.
Contribution
The paper provides a comprehensive solution for most cases within a range of k, demonstrating the limitations of current methods for certain challenging values.
Findings
Explicit solutions for most k within the range.
Identification of six challenging cases resistant to current methods.
Demonstration that no universal solution method exists for all k.
Abstract
We find explicitly all rational solutions of the title equation for all integers in the range except for . For the solution, a variety of methods is applied, which, depending on , may range from elementary, such as divisibility and congruence considerations, to elliptic Chabauty techniques and highly technical computations in algebraic number fields, or a combination thereof. For certain sets of values of we can propose a more or less uniform method of solution, which might be applied successfully for quite a number of cases of , even beyond the above range. It turns out, however, that in the range considered, six really challenging cases have to be dealt with individually, namely . More than half of the paper is devoted to the solution of the title equation for the first four of these values. For the last two values the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Coding theory and cryptography · Cryptography and Residue Arithmetic
