Fermat's theorem (Q1119552): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 02:17, 5 March 2024

scientific article
Language Label Description Also known as
English
Fermat's theorem
scientific article

    Statements

    Fermat's theorem (English)
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references