On the generalized Wieferich criteria (Q1344801): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56226406, #quickstatements; #temporary_batch_1711565664090 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Fermat's Last Theorem (Case 1) and the Wieferich Criterion / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The First Case of Fermat's Last Theorem is True for all Prime Exponents up to 714,591,416,091,389 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Fermat's Quotient, Base Two / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the generalized Wieferich criteria / rank | |||
Normal rank |
Latest revision as of 11:01, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the generalized Wieferich criteria |
scientific article |
Statements
On the generalized Wieferich criteria (English)
0 references
31 March 1996
0 references
Using similar methods the author extends the result of \textit{A. Granville} and \textit{M. B. Monagan} [Trans. Am. Math. Soc. 306, 329-359 (1988; Zbl 0645.10018)]\ as follows: If \(p\) is an odd prime and \(x\), \(y\), \(z\) are integers with \(p\nmid xyz\) and \(x^p+ y^p+ z^p =0\), then \(a^{p- 1} \equiv 1\pmod {p^2}\) for all positive integers \(a\leq 113\). This implies that \(p> 8.858 \times 10^{20}\). In the cited article it was proved that \(a^{p-1} \equiv 1\pmod {p^2}\) for all integers \(2\leq a\leq 89\) and then \(p> 714, 591, 416, 091, 389\). Note that the investigation of the results of this kind was started by \textit{A. Wieferich} [J. Reine Angew. Math. 136, 293-302 (1909; JFM 40.0256.03)]\ who proved in this case \(2^{p-1} \equiv 1\pmod {p^2}\).
0 references
generalized Wieferich criteria
0 references
first case of Fermat's last theorem
0 references
congruence conditions
0 references