
Fermat's Theorem
Authored by Deena Scaria
Mathematics
University - Professional Development
Used 31+ times

AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
5 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
Fermat's little theorem states that if a
a and p are coprime positive integers, with
p prime, then ap-1 (mod p) = 1
Which of the following congruences satisfies the conditions of this theorem?
126 mod 7=1
147 mod 8=1
168 mod 9 = 1
189 mod 10=1
2.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
What is the remainder when 3456 is divided by 7?
1
2
3
4
3.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
True or false?
426 mod 7=1.
True
False
4.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
3223 (mod 23)=?
5
7
9
11
5.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
14 mod 5 = 1
24 mod 5 = 1
34 mod 5 = 1
44 mod 5 = 1
We are given that the 4 congruences above are true. Is the following congruence true as well?
54 mod 5=1
Yes, it is true
No , it is not true
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever
or continue with

Microsoft
%20(1).png)
Apple
Others
Already have an account?