Theoremadvanced
Lucas's theorem
Also called Lucas's binomial theorem mod p.
Gives binomial coefficients mod a prime p from the base-p digits of the arguments.
Gives binomial coefficients mod a prime p from the base-p digits of the arguments.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag Q523G2 Edit this page History Report an error