This theorem states that if a and n are relatively prime, then the order of a modulo n divides the value of the Euler's totient function of n, i.e., ordₙ(a) divides φ(n).
This theorem states that if a and n are relatively prime, then the order of a modulo n divides the value of the Euler's totient function of n, i.e., ordₙ(a) divides φ(n).