Fermat's theorem (Q1119552)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4099217
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fermat's theorem |
scientific article; zbMATH DE number 4099217 |
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
0.7000919580459595
0 references
