Number Theory Algorithms
Welcome to the Number Theory Algorithms section of our Algorithm programming tutorial. In this section, you'll learn about:
- Prime Numbers
- Sieve of Eratosthenes
- Prime Factorization
- Greatest Common Divisor (GCD)
- Least Common Multiple (LCM)
- Modular Arithmetic
- Fast Exponentiation
- Extended Euclidean Algorithm
- Chinese Remainder Theorem
- Euler Totient Function
- Fermat's Little Theorem
Have fun coding!
If you spot any mistakes on this website, please let me know at [email protected]. I’d greatly appreciate your feedback! :)