Practice Understanding Fermat's Little Theorem - 12.2 | 12. Introduction to Fermat’s Little Theorem and Primality Testing | Discrete Mathematics - Vol 3
Students

Academic Programs

AI-powered learning for grades 8-12, aligned with major curricula

Professional

Professional Courses

Industry-relevant training in Business, Technology, and Design

Games

Interactive Games

Fun games to boost memory, math, typing, and English skills

Understanding Fermat's Little Theorem

12.2 - Understanding 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.

Learning

Practice Questions

Test your understanding with targeted questions

Question 1 Easy

State Fermat's Little Theorem.

💡 Hint: Recall the conditions regarding p and a.

Question 2 Easy

What does it mean for two numbers to be co-prime?

💡 Hint: Think about the factors of the numbers.

4 more questions available

Interactive Quizzes

Quick quizzes to reinforce your learning

Question 1

What does Fermat's Little Theorem state?

a^(p-1) ≡ 0 (mod p)
a^(p-1) ≡ 1 (mod p)
a^(p) ≡ 1 (mod p)

💡 Hint: Think about the prime’s relation with its multiples.

Question 2

Carmichael numbers behave like primes under which condition?

True
False

💡 Hint: Recall the definition of Carmichael numbers.

1 more question available

Challenge Problems

Push your limits with advanced challenges

Challenge 1 Hard

Given a prime p = 17, find an integer a that satisfies Fermat's Little Theorem, and prove it.

💡 Hint: Reduce 10^(16) step by step modulo 17.

Challenge 2 Hard

For the Carmichael number 561, show all bases up to 10 satisfy Fermat's Little Theorem.

💡 Hint: Recall the properties of modular arithmetic.

Get performance evaluation

Reference links

Supplementary resources to enhance your learning experience.