Modular Arithmetic
- Euler’s Totient Function
- Euler’s Totient function for all numbers smaller than or equal to n
- Modular Exponentiation (Power in Modular Arithmetic)
- Find the remainder without using the modulo operator
- Modular multiplicative inverse
- Multiplicative order
- Compute nCr % p using Dynamic Programming Solution
- Lucas Theorem
- Compute nCr % p using Lucas Theorem
- Compute nCr % p using Fermat Little Theorem
- Fermat Little Theorem.
- Chinese Remainder Theorem
- Chinese Remainder Theorem using Inverse Modulo-based Implementation
- Find Square Root under Modulo p | Set 1 (When p is in form of 4*i + 3)
- Find Square Root under Modulo p | Set 2 (Shanks Tonelli algorithm)
- Modular Division
- Cyclic Redundancy Check and Modulo-2 Division
- Find primitive root of a prime number n modulo n
- Euler’s criterion (Check if square root under modulo p exists)
- Combine Modular equations using the Chinese Remainder Theorem
- Multiply large integers under large modulo
- Compute n! under modulo p
- Wilson’s Theorem