Lucas' theorem (binomial coefficients)

Layer 0 — Mathematicsin the combinatorics subtree

For prime p and non-negative m, n, the binomial coefficient C(m, n) mod p equals the product of 'digit-wise' binomial coefficients C(m_i, n_i) where m_i, n_i are the base-p digits. Corollary (Kummer): the p-adic valuation of C(m, n) equals…

Related concepts

Explore Lucas' theorem (binomial coefficients) on the interactive knowledge graph →