Discrete mathematics
Number theory
GCD, LCM, Euler's totient, remainders, powers and divisors.
Discrete mathematics
Greatest common divisor
gcd(a,b)→Discrete mathematicsLeast common multiple
lcm(a,b) = |ab|/gcd(a,b)→Discrete mathematicsEuler totient function
φ(n) = n∏(1−1/p)→Discrete mathematicsPositive modulo
r = ((a mod m)+m) mod m→Discrete mathematicsModular exponentiation
r = aᵇ mod m→Discrete mathematicsNumber of divisors
τ(n) = ∏(αᵢ+1)→