For Fermat's little theorem, first suppose . Multiplication by permutes the nonzero residue classes modulo : if , the prime cannot divide , so cancellation gives . Multiplying the representatives in this permutation,
Every factor of the factorial is nonzero modulo the prime, so the factorial has a modular inverse and can be cancelled. Thus and . If , both sides are zero modulo . Hence for every integer ,
For completeness, the cancellation used above follows from Bézout's identity: a number relatively prime to has an inverse modulo .
The prime-power contraction under pth powers is the key step. If with , the binomial theorem gives
The first term is divisible by . Each later term is also divisible by that power because for . This includes and . Therefore
Start with and apply this implication times, increasing both the exponent and modulus at each step:
The case is precisely the original congruence.
By Fermat's little theorem, . Apply the same result with initial modulus and :
The finite prime-power Teichmuller representative has an explicit description. Let be the unique least nonnegative residue satisfying
Repeated Fermat's little theorem gives . Part (ii) gives
so this residue has both required properties.
For uniqueness, suppose also has them. From , raising congruences to the th power repeatedly gives for every . Meanwhile and the lifting result with imply
Hence . Both lie between zero and , so . Thus existence and uniqueness hold for every residue class, including zero, without needing a general Hensel lemma.

Articles by others on the same topic (0)

There are currently no matching articles.