Fermat's theorem (Q1119552): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0315-0860(89)90036-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2049473268 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4126428 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4789443 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5680066 / rank | |||
Normal rank | |||
Latest revision as of 14:13, 19 June 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
