Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "Lucas' Theorem"

m (→‎See also)
(→‎Proof)
 
(5 intermediate revisions by 3 users not shown)
Line 1: Line 1:
−
'''Lucas' Theorem''' states that for any [[prime]] <math>p</math> , if <math>(\overline{n_mn_{m-1}\cdots n_0})_p</math> is the [[base]] <math>p</math> representation of <math>n</math> and <math>(\overline{i_mi_{m-1}\cdots i_0})_p</math> is the base <math>p</math> representation of <math>i</math>, where <math>n\geq i</math>, then <math>\binom{n}{i}\equiv \prod_{j=0}^{m}\binom{n_j}{i_j}\pmod{p}</math>.
+
'''Lucas' Theorem''' states that for any [[prime]] <math>p</math> and any [[positive integer]]s <math>n\geq i</math>, if <math>(\overline{n_mn_{m-1}\cdots n_0})_p</math> is the representation of <math>n</math> in [[base]] <math>p</math> and <math>(\overline{i_mi_{m-1}\cdots i_0})_p</math> is the representation of <math>i</math> in base <math>p</math> (possibly with some leading <math>0</math>s) then <math>\binom{n}{i}\equiv \prod_{j=0}^{m}\binom{n_j}{i_j}\pmod{p}</math>.
  
 
== Lemma ==
 
== Lemma ==
 
For <math>p</math> prime and <math>x,r\in\mathbb{Z}</math>,  
 
For <math>p</math> prime and <math>x,r\in\mathbb{Z}</math>,  
−
<cmath>(1+x)^{p^r}\equiv 1+x^{p^r}\pmod{p}</cmath>
+
<center><math>(1+x)^{p^r}\equiv 1+x^{p^r}\pmod{p}</math></center>
 
=== Proof ===
 
=== Proof ===
 
For all <math>1\leq k \leq p-1</math>, <math>\binom{p}{k}\equiv 0 \pmod{p}</math>. Then we have
 
For all <math>1\leq k \leq p-1</math>, <math>\binom{p}{k}\equiv 0 \pmod{p}</math>. Then we have
−
<center><math>\begin{eqnarray*}(1+x)^p&\equiv &\binom{p}{0}+\binom{p}{1}x+\binom{p}{2}x^2+\cdots+\binom{p}{p-1}x^{p-1}+\binom{p}{p}x^p\\
+
<cmath>\begin{eqnarray*}(1+x)^p&\equiv &\binom{p}{0}+\binom{p}{1}x+\binom{p}{2}x^2+\cdots+\binom{p}{p-1}x^{p-1}+\binom{p}{p}x^p\\
−
&\equiv& 1+x^p\pmod{p}\end{eqnarray*}</math></center>
+
&\equiv& 1+x^p\pmod{p}\end{eqnarray*}</cmath>
 
Assume we have <math>(1+x)^{p^k}\equiv 1+x^{p^k}\pmod{p}</math>. Then
 
Assume we have <math>(1+x)^{p^k}\equiv 1+x^{p^k}\pmod{p}</math>. Then
−
<center><math>\begin{eqnarray*}(1+x)^{p^{k+1}}
+
<cmath>\begin{eqnarray*}(1+x)^{p^{k+1}}
 
&\equiv&\left((1+x)^{p^k}\right)^p\\
 
&\equiv&\left((1+x)^{p^k}\right)^p\\
 
&\equiv&\left(1+x^{p^k}\right)^p\\
 
&\equiv&\left(1+x^{p^k}\right)^p\\
 
&\equiv&\binom{p}{0}+\binom{p}{1}x^{p^k}+\binom{p}{2}x^{2p^k}+\cdots+\binom{p}{p-1}x^{(p-1)p^k}+\binom{p}{p}x^{p^{k+1}}\\
 
&\equiv&\binom{p}{0}+\binom{p}{1}x^{p^k}+\binom{p}{2}x^{2p^k}+\cdots+\binom{p}{p-1}x^{(p-1)p^k}+\binom{p}{p}x^{p^{k+1}}\\
−
&\equiv&1+x^{p^{k+1}}\pmod{p}\end{eqnarray*}</math></center>
+
&\equiv&1+x^{p^{k+1}}\pmod{p}\end{eqnarray*}</cmath>
−
 
 
−
== Proof ==
 
−
Consider <math>(1+x)^n</math>. If <math>(\overline{n_mn_{m-1}\cdots n_0})_p</math> is the base <math>p</math> representation of <math>n</math>, then <math>0\leq n_k \leq p-1</math> for all <math>0\leq k \leq m</math> and <math>n=n_mp^m+n_{m-1}p^{m-1}+\cdots+n_1p+n_0</math>. We then have
 
−
<center><math>\begin{eqnarray*}(1+x)^n&=&(1+x)^{n_mp^m+n_{m-1}p^{m-1}+\cdots+n_1p+n_0}\\
 
−
&=&[(1+x)^{p^m}]^{n_m}[(1+x)^{p^{m-1}}]^{n_{m-1}}\cdots[(1+x)^p]^{n_1}(1+x)^{n_0}\\
 
−
&\equiv&(1+x^{p^m})^{n_m}(1+x^{p^{m-1}})^{n_{m-1}}\cdots(1+x^p)^{n_1}(1+x)^{n_0}\pmod{p}
 
−
\end{eqnarray*}</math></center>
 
−
We want the coefficient of <math>x^i</math> in <math>(1+x)^n</math>. Since <math>i=i_mp^m+i_{m-1}p^{m-1}+\cdots+i_1p+i_0</math>, we want the coefficient of <math>(x^{p^{m}})^{i_{m}}(x^{p^{m-1}})^{i_{m-1}}\cdots (x^p)^{i_1}x^{i_0}</math>.
 
−
 
 
−
The coefficient of each <math>(x^{p^{k}})^{i_{k}}</math> comes from the binomial expansion of <math>(1+x^{p^k})^{n_k}</math>, which is <math>\binom{n_k}{i_k}</math>. Therefore we take the product of all such <math>\binom{n_k}{i_k}</math>, and thus we have
 
−
<center><math>\binom{n}{i}\equiv\prod_{k=1}^{n}\binom{n_k}{i_k}\pmod{p}</math></center>
 
−
Note that <math>n_k<i_k\Longrightarrow\binom{n_k}{i_k}=0\Longrightarrow\binom{n}{i}\equiv 0 \pmod{p}</math>.
 
−
 
 
−
This is equivalent to saying that there is no <math>x^i</math> term in the expansion of <math>(1+x)^n=(1+x^{p^m})^{n_m}(1+x^{p^{m-1}})^{n_{m-1}}\cdots(1+x^p)^{n_1}(1+x)^{n_0}</math>.
 
  
 
== See also ==
 
== See also ==

Latest revision as of 14:13, 11 August 2020

Lucas' Theorem states that for any prime $p$ and any positive integers $n\geq i$, if $(\overline{n_mn_{m-1}\cdots n_0})_p$ is the representation of $n$ in base $p$ and $(\overline{i_mi_{m-1}\cdots i_0})_p$ is the representation of $i$ in base $p$ (possibly with some leading $0$s) then $\binom{n}{i}\equiv \prod_{j=0}^{m}\binom{n_j}{i_j}\pmod{p}$.

Lemma

For $p$ prime and $x,r\in\mathbb{Z}$,

$(1+x)^{p^r}\equiv 1+x^{p^r}\pmod{p}$

Proof

For all $1\leq k \leq p-1$, $\binom{p}{k}\equiv 0 \pmod{p}$. Then we have \begin{eqnarray*}(1+x)^p&\equiv &\binom{p}{0}+\binom{p}{1}x+\binom{p}{2}x^2+\cdots+\binom{p}{p-1}x^{p-1}+\binom{p}{p}x^p\\ &\equiv& 1+x^p\pmod{p}\end{eqnarray*} Assume we have $(1+x)^{p^k}\equiv 1+x^{p^k}\pmod{p}$. Then \begin{eqnarray*}(1+x)^{p^{k+1}} &\equiv&\left((1+x)^{p^k}\right)^p\\ &\equiv&\left(1+x^{p^k}\right)^p\\ &\equiv&\binom{p}{0}+\binom{p}{1}x^{p^k}+\binom{p}{2}x^{2p^k}+\cdots+\binom{p}{p-1}x^{(p-1)p^k}+\binom{p}{p}x^{p^{k+1}}\\ &\equiv&1+x^{p^{k+1}}\pmod{p}\end{eqnarray*}

See also

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=Lucas%27_Theorem&oldid=131527"