Abstract
Lucas’ theorem describes how to reduce a binomial coefficient (ab) 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.

This publication has 11 references indexed in Scilit: