This library provides the basics of modular arithmetic operations:

- Great Common Divisor (GCD)
- Least Common Multiple (LCM)
- Bezout solver
- Decomposition number algorithm
- Euler’s totient function
- Primality Test
- Find next Prime
- Inverse function
- Solver for 1 equation
- Solver for multiple equations

###### -GitHub repository:

Modular Arithmetic Source Code