2000 character limit reached
On a criterion for Catalan's Conjecture
Published 12 Oct 2020 in math.NT | (2010.05651v1)
Abstract: We give a new proof of a theorem by P. Mihailescu which states that the equation $xp-yq=1$ is unsolvable with $x, y$ integral and $p, q$ odd primes, unless the congruences $pq \equiv p\pmod{q2}$ and $qp\equiv q \pmod{p2}$ hold.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.