Question

State Fermat's little theorem. Easy answer required
Also give examples to explain it......

Answer 1

if u like mark as BRILLIANT


Fermat’s little theorem

Fermat’s little theorem states that if p is a prime number, then for any integer a, the number a p – a is an integer multiple of p.
Here p is a prime number ap ≡ a (mod p).

Special Case: If a is not divisible by p, Fermat’s little theorem is equivalent to the statement that a p-1-1 is an integer multiple of p.

ap-1 ≡ 1 (mod p)
OR
an-1 % p = 1
Here a is not divisible by p.

Answer 2

Fermat's little theorem states that if p is aprime 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

ap≡a(modp).{\displaystyle a^{p}\equiv a{\pmod {p}}.}

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, Fermat's little theorem is equivalent to the statement thatap − 1 − 1 is an integer multiple of p, or in symbols:

ap−1≡1(modp).{\displaystyle a^{p-1}\equiv 1{\pmod {p}}}

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 theFermat 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.

hope it helps U mark as brainliest✌