# On the number of rational squares at fixed distance from a fifth power

@article{Stoll2006OnTN,
title={On the number of rational squares at fixed distance from a fifth power},
author={Michael Stoll},
journal={Acta Arithmetica},
year={2006},
volume={125},
pages={79-88}
}
• M. Stoll
• Published 2006
• Mathematics
• Acta Arithmetica
The main result of this note is that there are at most seven rational points (including the one at infinity) on the curve C_A with the affine equation y^2 = x^5 + A (where A is a tenth power free integer) when the Mordell-Weil rank of the Jacobian of C_A is one. This bound is attained for A = 18^2.
7 Citations
Chabauty for symmetric powers of curves
Let C be a smooth projective absolutely irreducible curve of genus g >= 2 over a number field K, and denote its Jacobian by J. Let d >= 1 be an integer and denote the d-th symmetric power of C byExpand
Explicit Chabauty over number fields
Let C be a smooth projective absolutely irreducible curve of genus g ≥ 2 over a number field K of degree d, and denote its Jacobian by J . Denote the Mordell–Weil rank of J(K) by r. We give anExpand
Independence of rational points on twists of a given curve
• M. Stoll
• Mathematics
• Compositio Mathematica
• 2006
In this paper, we study bounds for the number of rational points on twists $C'$ of a fixed curve $C$ over a number field ${\mathcal K}$, under the condition that the group of ${\mathcal K}$-rationalExpand
On the Equation Y 2 = X 5 + k
• A. Bremner
• Mathematics, Computer Science
• Exp. Math.
• 2008
We show that there are infinitely many nonisomorphic curves Y 2 = X 5 + k, k ∈ ℤ, possessing at least twelve finite points for k > 0, and at least six finite points for k < 0. We also determine allExpand
On the Lebesgue-Nagell equation and related subjects
The work of Cohn [Coh93] and Bugeaud, Mignotte and Siksek [BMS06] solves the Lebesgue-Naguel equation x2 + D = yn, x, y integers, n ≥ 3 for D a integer in the range 1 ≤ D ≤ 100. We propose to doExpand

#### References

SHOWING 1-5 OF 5 REFERENCES
Implementing 2-descent for Jacobians of hyperelliptic curves
This paper gives a fairly detailed description of an algorithm that computes (the size of) the 2-Selmer group of the Jacobian of a hyperellitptic curve over Q. The curve is assumed to have even genusExpand
Computing Torsion Points on Curves
• B. Poonen
• Computer Science, Mathematics
• Exp. Math.
• 2001
Using a p-adic approach, an algorithm is developed to compute T, and bounds on #T are proved: if in addition X has good reduction at a prime p ≥ 5, then #T ≤ 2p3 + 2p2+2p+8. Expand
Twists of X(7) and primitive solutions to x^2+y^3=z^7
• Mathematics
• 2005
We find the primitive integer solutions to x^2+y^3=z^7. A nonabelian descent argument involving the simple group of order 168 reduces the problem to the determination of the set of rational points onExpand
Independence of rational points on twists of a given curve
• M. Stoll
• Mathematics
• Compositio Mathematica
• 2006
In this paper, we study bounds for the number of rational points on twists $C'$ of a fixed curve $C$ over a number field ${\mathcal K}$, under the condition that the group of ${\mathcal K}$-rationalExpand