On a criterion for Catalan's conjecture (Q1597195): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 2010.05651 / rank | |||
Normal rank |
Revision as of 20:41, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a criterion for Catalan's conjecture |
scientific article |
Statements
On a criterion for Catalan's conjecture (English)
0 references
12 May 2002
0 references
This paper gives a new proof of a criterion of Pedra Mihăilescu (not yet published): if \(p\) and \(q\) are odd prime numbers such that the Diophantine equation \(x^p-y^q=1\) has a non-trivial solution then \(p^{q-1}\equiv 1 \pmod {q^2}\) and \(q^{p-1}\equiv 1 \pmod {p^2}\). Mihăilescu's proof uses Stickelberger's theorem and is purely algebraic. The present proof uses a result of Eichler (1965) and needs some computer verification, but it is also quite short.
0 references
Catalan's conjecture
0 references
higher order Diophantine equations
0 references
congruences
0 references