This theorem states that if GCD(a,n) = 1, then the remainder of a^n divided by n can be found by a Euclidean algorithm using a, n, and the remainders of a^(n-1) and a^(n-2) modulo n.
This theorem states that if GCD(a,n) = 1, then the remainder of a^n divided by n can be found by a Euclidean algorithm using a, n, and the remainders of a^(n-1) and a^(n-2) modulo n.