Fermat's theorem (Q1119552): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q256469 |
||
| Property / reviewed by | |||
| Property / reviewed by: Edward J. Barbeau / rank | |||
Revision as of 23:28, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fermat's theorem |
scientific article |
Statements
Fermat's theorem (English)
0 references
1989
0 references
In 1640, Frénicle de Bessy challenged Fermat to find a 20-digit perfect number or its successor. The author clears up some misconceptions about this challenge and indicates how Fermat showed that \(2^{37}-1\) is composite using his result: if \(a\in N\) and \(p\nmid a\), the least d for which \(p| a^ d-1\) is a divisor of p-1.
0 references
Fermat's little theorem
0 references
Mersenne prime
0 references
perfect numbers
0 references
Frénicle de Bessy
0 references
