12.1.3 - Corollary of Fermat's Little Theorem
Enroll to start learning
You’ve not yet enrolled in this course. Please enroll for free to listen to audio lessons, classroom podcasts and take practice test.
Practice Questions
Test your understanding with targeted questions
What does Fermat's Little Theorem state?
💡 Hint: Think about the relationship between primes and coprime integers.
Define Carmichael numbers.
💡 Hint: They trick primality tests!
4 more questions available
Interactive Quizzes
Quick quizzes to reinforce your learning
What does Fermat's Little Theorem establish?
💡 Hint: Recall the theorem's specifics.
Are Carmichael numbers prime numbers?
💡 Hint: Think about their characteristics.
1 more question available
Challenge Problems
Push your limits with advanced challenges
Determine if 561 is prime using Fermat's theorem with b = 2.
💡 Hint: Use the properties of modular arithmetic.
Prove that for any prime p, it holds that (p-1)! ≡ -1 (mod p).
💡 Hint: Consider the properties of factorials and how they relate to primes.
Get performance evaluation
Reference links
Supplementary resources to enhance your learning experience.