Moved binomialmodprime to description (kth-competitive-programming#170)

flashmt · Apr 21, 2020 · 91b3145 · 91b3145
1 parent 809c86e
commit 91b3145
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 25 deletions.
diff --git a/content/combinatorial/binomialModPrime.h b/content/combinatorial/binomialModPrime.h
diff --git a/content/combinatorial/chapter.tex b/content/combinatorial/chapter.tex
@@ -34,8 +34,10 @@ \section{Partitions and subsets}
 		\end{tabular}
 		\end{center}
 
+	\subsection{Lucas' Theorem}
+		Let $n,m$ be non-negative integers and $p$ a prime. Write $n=n_kp^k+...+n_1p+n_0$ and $m=m_kp^k+...+m_1p+m_0$. Then $\binom{n}{m} \equiv \prod_{i=0}^k\binom{n_i}{m_i} \pmod{p}$.
+
 	\subsection{Binomials}
-		\kactlimport{binomialModPrime.h}
 		\kactlimport{multinomial.h}
 
 \section{General purpose numbers}