Skip to main content

Mathematics (thesaurus)

Search from vocabulary

Concept information

number > number theory > algebraic number theory > Fermat's little theorem

Preferred term

Fermat's little theorem  

Definition

  • Fermat's little theorem states that if p is a prime number, then for any integer a, the number apa is an integer multiple of p. In the notation of modular arithmetic, this is expressed as


    For example, if a = 2 and p = 7, then 27 = 128, and 128 − 2 = 126 = 7 × 18 is an integer multiple of 7.
    If a is not divisible by p; that is, if a is coprime to p, Fermat's little theorem is equivalent to the statement that ap − 1 − 1 is an integer multiple of p, or in symbols:


    For example, if a = 2 and p = 7, then 26 = 64, and 64 − 1 = 63 = 7 × 9 is thus a multiple of 7.
    Fermat's little theorem is the basis for the Fermat primality test and is one of the fundamental results of elementary number theory. The theorem is named after Pierre de Fermat, who stated it in 1640. It is called the "little theorem" to distinguish it from Fermat's Last Theorem.

    (Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Fermat%27s_little_theorem)

Broader concept

In other languages

URI

http://data.loterre.fr/ark:/67375/PSR-XKLXMBVT-H

Download this concept: