## You are here

HomeLucas's theorem

## Primary tabs

# Lucas’s theorem

Let $m,n\in\mathbb{N}-\{0\}$ be two natural numbers . If $p$ is a prime number and :

$m=a_{k}p^{k}+a_{{k-1}}p^{{k-1}}+\cdots+a_{1}p+a_{0},n=b_{k}p^{k}+b_{{k-1}}p^{{% k-1}}+\cdots+b_{1}p+b_{0}$ |

are the base-p expansions of $m$ and $n$ , then the following congruence is true :

${m\choose n}\equiv{a_{0}\choose b_{0}}{a_{1}\choose b_{1}}\cdots{a_{k}\choose b% _{k}}(\verb|modp|)$ |

Note : the binomial coefficient is defined in the usual way , namely :

${x\choose y}=\frac{x!}{y!(x-y)!}$ |

if $x\geq y$ and $0$ otherwise (of course , x and y are natural numbers).

Keywords:

binomial coefficient,congruence

Type of Math Object:

Theorem

Major Section:

Reference

Groups audience:

## Mathematics Subject Classification

11B65*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

Sep 17

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella

## Comments

## On Lucas's Theorem

Hi, Slash,

think you were not quite precise in your statement. Consider this:

Let $m,n$ be natural numbers, $m \ge n$ and $p$ a prime number dividing both

$m$ and $n$. Then you have

\[{m \choose n} =\frac{m^{'}.(m -1)\cdots (m -(n -1))}{p^s.n^{'}(n -1)\cdots

1}\]

where $r,s$ are the maximum powers of $p$ dividing $m$ and $n$. But then the

binomial coefficient would be $0 \bmod p$, but ${0 \choose 0} =1$ so in this

case the theorem is wrong.

I'm sure I found this theorem in a paper about binomial coefficients,

written by Andrew Granville. This paper sure also contains a proof of

this...

Regards,

Thomas

## Re: On Lucas's Theorem

If r>s , then the number of zeros at the end in the p-base expansion of m is greater than the one in the expansion of n , so you would get that the product is zero ! (a term of the form {0 \choose something} appears!) So .. the theorem is true in this case (correct me if I'm wrong)! I have a proof of it but I didn't have time to write it up in LaTeX .

Cheers !

P.S. : I hope I'm not talking nonsense and that it's correct