Revistes Catalanes amb Accés Obert (RACO)

On the diophantine equation $x^p-x=y^q-y$

M. Mignotte, Attila Pethö
DOI: 37959


We consider the diophantine equation
in integers $(x,p,y,q)$. We prove that for given $p$ and $q$ with $2\le p < q$ $(*)$ has only finitely many solutions. Assuming the abc-conjecture we can prove that $p$ and $q$ are bounded. In the special case $p=2$ and $y$ a prime power we are able to solve $(*)$ completely.

Text complet: PDF