Modulo Function
- Written as % or
The modulo function is the equivalent of taking the remainder of two numbers.
Modular Equivalence
A common way to express modular equivalence by a number
Greatest Common Divisor
- Written as
The greatest common divisor of two or more integers is the largest positive integer that divides each of the integers.
Least Common Multiple
- Written as
Euler's Totient Function
- A.k.a. Euler's phi function
- Written as
or
Euler's totient function returns the number of positive integers less
than
Carmichael's Totient Function
- A.k.a. the reduced totient function or the least universal exponent function
- Written as
Carmichael's totient function returns the exponent of the
multiplicative group of positive integers modulo
For every