Lesson 19 of 20 · about 15 min
Fermat's little theorem and fast powers
What's the remainder of 7 to the power 1000, divided by 13? The number itself has 846 digits, yet you can answer in your head. Powers on a clock go round in circles, and a trick called repeated squaring computes giant powers in a few dozen steps. Both are the engine of RSA.
🔓 Unlock this lesson
This lesson is part of the DoingCamp Pass. Members get every lesson in every course, with all the interactive visuals, coding exercises and challenges.
In this lesson you'll learn:
- Fermat's little theorem
- Repeated squaring
Free to try in F06 Discrete Math:
The first 3 lessons of every course are free, no account needed.