Lucas’ Theorem Modulo p2
Author:
- 25 May 2022
- journal article
- research article
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 129 (9) , 846-855
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 p2. This characterization is naturally expressed using symmetries of Pascal’s triangle.
Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Divisibility properties of sporadic Apéry-like numbersResearch in Number Theory, 2016
- Automatic congruences for diagonals of rational functionsJournal de Théorie des Nombres de Bordeaux, 2015
- A Simple Proof of Ljunggren’s Binomial CongruenceThe American Mathematical Monthly, 2014
- Bernoulli numbers, Wolstenholme's theorem, and variations of Lucas' theoremJournal of Number Theory, 2007
- A Binomial Coefficient Congruence Modulo Prime PowersJournal of Number Theory, 1993
- Two p3 variations of Lucas' TheoremJournal of Number Theory, 1990
- Lucas' Theorem for Prime PowersEuropean Journal of Combinatorics, 1990
- On congruences for binomial coefficientsJournal of Number Theory, 1989
- Some congruences for Apéry numbersJournal of Number Theory, 1982
- Note on the Congruence 2 4n ≡(-) n (2n)!/(n!) 2 , Where 2n + 1 is a PrimeAnnals of Mathematics, 1894