On the Diophantine equation \(x^4 - q^4 = py^n\) (Q355495)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the Diophantine equation \(x^4 - q^4 = py^n\) |
scientific article |
Statements
On the Diophantine equation \(x^4 - q^4 = py^n\) (English)
0 references
24 July 2013
0 references
In [Rocky Mt. J. Math. 40, No. 3, 995--1008 (2010; Zbl 1215.11027)], \textit{F. Luca} and \textit{A. Togbé} studied the Diophantine equation \[ x^4-q^4=py^3,\; x, y \in \mathbb{N},\; \gcd(x, y)=1 \] and showed that this equation has no solution. In this paper under review, the author considers the more general Diophantine equation \[ x^4-q^4=py^n,\; x, y \in \mathbb{N},\; \gcd(x, y)=1. \] Using some arithmetical properties of Lucas numbers, particularly the deep result of Bilu-Hanrot-Voutier [\textit{Yu. Bilu} et al., J. Reine Angew. Math. 539, 75--122 (2001; Zbl 0995.11010)], the author proves that the above equation has no solution if \(n>3\) is an odd prime \(p\) is an odd prime such that \(p \equiv 3 \pmod 4\).
0 references
higher Diophantine equation
0 references
Lucas number
0 references
arithmetical property
0 references