2000 character limit reached
Differences between perfect powers : the Lebesgue-Nagell Equation
Published 19 Sep 2021 in math.NT | (2109.09128v2)
Abstract: We develop a variety of new techniques to treat Diophantine equations of the shape , based upon bounds for linear forms in -adic and complex logarithms, the modularity of Galois representations attached to Frey-Hellegouarch elliptic curves, and machinery from Diophantine approximation. We use these to explicitly determine the set of all coprime integers and , and , with the property that $y<sup>n</sup> > x<sup>2$ and has no prime divisor exceeding $11$.
Paper Prompts
Sign up for free to create and run prompts on this paper.