Search the courses, subjects, tracks, games and features, or jump straight to a page.
4 cards from this section. Quick, good the night before a test.
State Fermat's Little Theorem.
Recall the conditions regarding p and a.
What does it mean for two numbers to be co-prime?
Think about the factors of the numbers.
What does Fermat's Little Theorem state?
Think about the prime’s relation with its multiples.
Carmichael numbers behave like primes under which condition?
Recall the definition of Carmichael numbers.
Given a prime p = 17, find an integer a that satisfies Fermat's Little Theorem, and prove it.
Reduce 10^(16) step by step modulo 17.
For the Carmichael number 561, show all bases up to 10 satisfy Fermat's Little Theorem.
Recall the properties of modular arithmetic.
5 more questions in this section. Enroll free to practise them all.
Enroll free