modular arithmetic

1 article · All tags

• Euler's Totient Function
  The function φ(n) counting the integers between 1 and n that are coprime to n, a cornerstone of modular arithmetic and the basis of RSA encryption.