Fermat's theorem

DOI10.1016/0315-0860(89)90036-0MaRDI QIDQ1119552zbMATH OpenOpenAlexFDO

Authors Colin R. Fletcher

Publication date 1989

Published in Historia Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0315-0860(89)90036-0

zbMATH Keywords

Fermat's little theoremFrénicle de BessyMersenne primeperfect numbers

Mathematics Subject Classification ID

History of mathematics in the 17th century (01A45) History of number theory (11-03) Congruences; primitive roots; residue systems (11A07) Arithmetic functions; related numbers; inversion formulas (11A25)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 1001235
• scientific article; zbMATH DE number 4019141
• scientific article; zbMATH DE number 2078124
• Fermat Numbers and Mersenne Numbers
• scientific article; zbMATH DE number 3763880

Cited in

(8)

• A reconstruction of the Frenicle-Fermat correspondence
• Multidimensional scaling and visualization of patterns in prime numbers
• scientific article; zbMATH DE number 4134125 (Why is no real title available?)
• scientific article; zbMATH DE number 2078121 (Why is no real title available?)
• scientific article; zbMATH DE number 822763 (Why is no real title available?)
• Special case of Fermat's Theorem
• Fermat's maximum and minimum method
• Scalable polyhedral verification of recurrent neural networks

This page was built for publication: Fermat's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1119552)