2000 character limit reached
On consecutive perfect powers with elementary methods
Published 4 May 2013 in math.NT | (1305.0892v4)
Abstract: Catalan's conjecture claims that the Diophantine equation $xp-yq=1$ admits the unique solution $32-23=1$ in integers $x,y,p,q \ge 2$. The conjecture has been finally proved by P. Mih\u{a}ilescu (2002) using the theory of cyclotomic fields and Galois modules. Here, relying only on elementary techniques, we prove several instances of this classical result. In particular, we prove the conjecture in the following cases: $p$ even (due to V.A. Lebesgue), $q$ is even (due to L. Euler and Chao Ko), $x$ divides $q$, $y$ divides $x-1$, $y$ is a power of a prime, and $y\le p{p/2}$.
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.