Practice Using Fermat's Little Theorem For Modular Arithmetic (12.3.1) - Introduction to Fermat’s Little Theorem and Primality Testing

Practise this section

8 questions

Flashcard drill
2 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What does Fermat's Little Theorem state?
Show hintHide hint
Think about the relationship involving prime numbers.
Question 2.
Provide an example of a pseudoprime.
Show hintHide hint
Consider numbers that pass the Fermat test but are not prime.
3Question 3.
What does Fermat's Little Theorem state?
Show hintHide hint
Focus on the relationship between primes and modular arithmetic.
4Question 4.
True or False: Every pseudoprime is a prime number.
- True
- False
Show hintHide hint
Recall the definition of pseudoprimes.
Question 5.
Prove that the number 341 is a pseudoprime to base 2 by demonstrating that 2^340 ≡ 1 (mod 341).
Show hintHide hint
Simplify your calculation using smaller powers and modular arithmetic.
Question 6.
Create a composite number larger than 100 that is also a Carmichael number. Verify that it satisfies the conditions.
Show hintHide hint
Look for composite numbers that are products of distinct primes.

4 more questions in this section. Enroll free to practise them all.