This statement is typically proven using the binomial expansion in a finite field, and it lies at the heart of RSA encryption.
This statement is typically proven using the binomial expansion in a finite field, and it lies at the heart of RSA encryption. This statement is less restrictive than Wilson's theorem and as a test it fails for (*) Carmichael numbers. This statement is also generalized by Euler's theorem, which replaces the exponent in this theorem with the totient function. For 10 points— what is this theorem which states that for a prime p and natural number a, a to the power p is congruent to a modulo p?
This statement is typically proven using the binomial expansion in a finite field, and it lies at the heart of RSA encryption.
Fermat's little theorem