Tags → #number-theory
-
Week 5 Day 2: Euler’s Totient Function - The Heart of Cryptography
Counting coprime numbers. Unlocking the power of a^phi(n) = 1 (mod n) and its role in RSA.
-
Week 5 Day 1: Chinese Remainder Theorem (CRT) - Unlocking the Universe
How to solve a system of simultaneous congruences. Find a number that leaves specific remainders.
-
Week 1 Day 1: The Magic of GCD & LCM
Starting our number theory journey with the absolute fundamentals: Greatest Common Divisor and Least Common Multiple. Learn why they matter in coding and how to implement them efficiently.