Question

What is Fermat's Theorem​

Answer 1

Step-by-step explanation:

Fermat's little theorem states that if p is a prime number, then for any integer a, the number aᵖ − a 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 2⁷ = 128, and 128 − 2 = 126 = 7 × 18 is an integer multiple of 7.

Answer 2

Fermat's little theorem states that if p is a prime number, then for any integer a, the number aᵖ − a 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 2⁷ = 128, and 128 − 2 = 126 = 7 × 18 is an integer multiple of 7.