This lesson is for subscribers
You've completed the free preview. Subscribe to unlock every lesson in every course.
Euler's generalization: if gcd(a,n) = 1, then a^φ(n) ≡ 1 (mod n), extending Fermat's Little Theorem to composite moduli.
You've completed the free preview. Subscribe to unlock every lesson in every course.