Let's test your Knowledge
Question 2
Which of the following is not a valid use of Euler's theorem?
To compute large powers modulo a number
When base and modulus are not coprime
To reduce exponent using φ(n)
To speed up modular exponentiation
Question 4
If a and m are coprime, then [Tex]a^{-1} ≡ a^{ϕ(m) −1} \mod m[/Tex] is derived from:
Fermat’s Little Theorem
Euler’s Theorem
Wilson’s Theorem
CRT
Question 5
Project Euler problem solving often uses which trick to compute big mod powers efficiently?
Simple multiplication
Brute force
Modular exponentiation
Binary search
Question 6
Which of the following is NOT required to apply Fermat's Little Theorem?
Modulus must be prime
Base must be coprime with modulus
Base must be even
Exponent can be reduced mod (p−1)
Question 7
Fermat's theorem is used to compute which of the following efficiently?
Primality testing
Modular inverses
Fast exponentiation
All of the above
Question 9
Why is FLT insufficient for deterministic primality testing?
Fails for Carmichael numbers
Only works for even numbers
Only works for natural numbers
None of the above
There are 10 questions to complete.