Number_theory

Number Theory

Fundamentals

• Binary Exponentiation
• Euclidean algorithm for computing the greatest common divisor
• Extended Euclidean Algorithm
• Linear Diophantine Equations
• Fibonacci Numbers
• Modular Exponentiation

Prime numbers

• Sieve of Eratosthenes
• Sieve of Eratosthenes With Linear Time Complexity
• Primality tests
• Integer factorization

Number-theoretic functions

• Euler's totient function
• Number of divisors / sum of divisors

Modular arithmetic

• Modular Inverse
• Linear Congruence Equation
• Chinese Remainder Theorem
• Factorial modulo p
• Discrete Log
• Primitive Root
• Discrete Root
• Montgomery Multiplication

---

Questions related to Number Theory

• GCD of two number using Euclidean Algorithm ----> Java