proof of Lucas’s theorem
Let . Let be the least non-negative residues of , respectively. (Additionally, we set , and is the least non-negative residue of modulo .) Then the statement follows from
We define the ’carry indicators’ for all as
and additionally .
The special case of Anton’s congruence![]()
is:
| (1) |
where as defined above, and is the product of numbers not divisible by . So we have
When dividing by the left-hand terms of the congruences for and , we see that the power of is
So we get the congruence
or equivalently
| (2) |
Now we consider . Since
. So both congruences–the one in the statement and (2)– produce the same results.
| Title | proof of Lucas’s theorem |
|---|---|
| Canonical name | ProofOfLucassTheorem |
| Date of creation | 2013-03-22 13:22:56 |
| Last modified on | 2013-03-22 13:22:56 |
| Owner | mathcam (2727) |
| Last modified by | mathcam (2727) |
| Numerical id | 7 |
| Author | mathcam (2727) |
| Entry type | Proof |
| Classification | msc 11A07 |
| Related topic | BinomialCoefficient |