arXiv · 2006.11701
Lucas' theorem modulo $p^2$
Abstract
Lucas' theorem describes how to reduce a binomial coefficient $\binom{a}{b}$ modulo $p$ by breaking off the least significant digits of $a$ and $b$ in base $p$. We characterize the pairs of these digits for which Lucas' theorem holds modulo $p^2$. This characterization is naturally expressed using symmetries of Pascal's triangle.
Explore related subjects
Keep this discovery
Eric Rowland. 2020-06-21. Lucas' theorem modulo $p^2$. https://doi.org/10.1080/00029890.2022.2038004
Cite the original work for its findings. Save a collection to share your selection of sources.