Lucas' theorem modulo p²

DOI10.1080/00029890.2022.2038004MaRDI QIDQ6343363arXivWikidataFDO

Authors Eric Rowland

Publication date 20 June 2020

Published in arXiv

Full work available at URL https://doi.org/10.1080/00029890.2022.2038004

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Binomial coefficients; factorials; (q)-identities (11B65)

arXiv classification

math.NT

Abstract: Lucas' theorem describes how to reduce a binomial coefficient $$ 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.

This page was built for publication: Lucas' theorem modulo $p^2$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6343363)