On the diophantine equation xp - x = yq - y

Google Scholar: citas

Fecha:	1999
Resumen:	We consider the diophantine equation xp - x = yq - y, in integers (x, p, y, q). We prove that for given p and q with 2 [less than or equal] p &lt; 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.
Derechos:	Tots els drets reservats.
Lengua:	Anglès
Documento:	Article ; recerca ; Versió publicada
Publicado en:	Publicacions matemàtiques, V. 43 N. 1 (1999) , p. 207-216, ISSN 2014-4350

10 p, 118.3 KB

Registro creado el 2006-03-13, última modificación el 2022-02-20