Differences between perfect powers: prime power gaps

From MaRDI portal



Abstract: We develop machinery to explicitly determine, in many instances, when the difference x2−yn is divisible only by powers of a given fixed prime. This combines a wide variety of techniques from Diophantine approximation (bounds for linear forms in logarithms, both archimedean and non-archimedean, lattice basis reduction, methods for solving Thue-Mahler and S-unit equations, and the Primitive Divisor Theorem of Bilu, Hanrot and Voutier) and classical Algebraic Number Theory, with results derived from the modularity of Galois representations attached to Frey-Hellegoaurch elliptic curves. By way of example, we completely solve the equation [ x^2+q^alpha = y^n, ] where 2leqq<100 is prime, and x,y,alpha and n are integers with ngeq3 and gcd(x,y)=1.




Cites work









This page was built for publication: Differences between perfect powers: prime power gaps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6142631)