Compositio Mathematica · 2004 · 42 citations · 20 references
Natural SciencesComputer ScienceMathematicsDiscrete MathematicsGeometryNumber TheoryAlgebraic GeometryAlgebraic Number TheoryArithmetic GeometryDiophantine EquationsElliptic CurvesNumber-theoretic AlgorithmsDiophantine GeometryElliptic Curve ArithmeticElliptic Curve Diophantine ProblemsElliptic Curve FamiliesElliptic Curves In GeometryLinear Diophantine EquationsPolynomial Diophantine Equations
In this paper, we develop machinery to solve ternary Diophantine equations of the shape Ax n + By n = C z 3 for various choices of coefficients ( A , B , C ). As a byproduct of this, we show, if p is prime, that the equation x n + y n = pz 3 has no solutions in coprime integers x and y with | xy | > 1 and prime n > p 4 p 2 . The techniques employed enable us to classify all elliptic curves over $\mathbb{Q}$ with a rational 3-torsion point and good reduction outside the set {3, p }, for a fixed prime p .
20
Modular Elliptic Curves and Fermat's Last Theorem
Andrew Wiles · Annals of Mathematics · 1995 · 2.1K citations
Rational isogenies of prime degree
Barry Mazur, Dorian Goldfeld · Inventiones mathematicae · 1978 · 685 citations