← All practice quizzes
Quiz: Number Theory
5 questionsNo time limitPass: 60%+10 XP on first pass
Divisibility and primes, the Euclidean and extended Euclidean algorithms, modular arithmetic rules, fast modular exponentiation, Fermat's little theorem, modular inverses, Euler's totient — and a complete toy RSA encryption built from them in Python.
Log in to take the quiz
Free account · see your score, answers and explanations, earn XP