Free Printable Fermat's Little Theorem

Worksheets

Name

Class

Date

Fermat's little theorem states that if a

a and p are coprime positive integers, with

p prime, then a^p-1 (mod p) = 1

Which of the following congruences satisfies the conditions of this theorem?

12⁶mod 7=1

14⁷mod 8=1

16⁸ mod 9 = 1

18⁹mod 10=1

What is the remainder when 3⁴⁵⁶ is divided by 7?

True or false?

42⁶mod 7=1.

True

False

32²³(mod 23)=?

1⁴mod 5 = 1

2⁴mod 5 = 1

3⁴mod 5 = 1

4⁴mod 5 = 1

We are given that the 4 congruences above are true. Is the following congruence true as well?

5⁴mod 5=1

Yes, it is true

No , it is not true

Reset

Similar Resources on Wayground