Fermat’s little theorem

Creator

Creator

Created

Created

2024 Apr 19 5:24

Editor

Editor

Edited

Edited

2024 May 2 13:2

Refs

Refs

Euler’s Theorem

Pierre de Fermat

Below two propositions are in equivalence relation

For any integer

a

, when

p

is prime number

a^p \equiv a\mod{p}

If integer

a

is not divisible by prime number

p

a^{p-1} \equiv 1 \mod p

Fermat's little theorem

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

Fermat's little theorem

https://en.wikipedia.org/wiki/Fermat's_little_theorem

Recommendations

////////