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

Academics

AI-Powered learning for Grades 8–12, aligned with major Indian and international curricula.

Professionals

Professional Courses

Industry-relevant training in Business, Technology, and Design to help professionals and graduates upskill for real-world careers.

Games

Interactive Games

Fun, engaging games to boost memory, math fluency, typing speed, and English skills—perfect for learners of all ages.

Practice Questions

Test your understanding with targeted questions related to the topic.

Question 1

Easy

What is Fermat's Little Theorem?

💡 Hint: Think about the relationship between primes and powers.

Question 2

Easy

State the corollary of Fermat's Little Theorem.

💡 Hint: Consider how division by p affects powers.

Practice 4 more questions and get performance evaluation

Interactive Quizzes

Engage in quick quizzes to reinforce what you've learned and check your comprehension.

Question 1

What does Fermat's Little Theorem state?

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

💡 Hint: Think about congruence relations with primes.

Question 2

True or False: Carmichael numbers pass Fermat's theorem condition for every base.

  • True
  • False

💡 Hint: Consider definitions of pseudo primes.

Solve 1 more question and get performance evaluation

Challenge Problems

Push your limits with challenges.

Question 1

Demonstrate that 623 is not prime using Fermat’s theorem and explain the reasoning.

💡 Hint: Use several bases to test the true nature of 623.

Question 2

Using Fermat’s theorem, test whether 341 can be declared prime given various bases and show examples.

💡 Hint: Check bases coprime with 341; recall 341 = 11 * 31.

Challenge and get performance evaluation