A matrix generalization of a theorem of Fine
Abstract
In 1947 Nathan Fine gave a beautiful product for the number of binomial coefficients nm, for m in the range 0 ≤ m ≤ n, that are not divisible by p. We give a matrix product that generalizes Fine's formula, simultaneously counting binomial coefficients with p-adic valuation α for each α ≥ 0. For each n this information is naturally encoded in a polynomial generating function, and the sequence of these polynomials is p-regular in the sense of Allouche and Shallit. We also give a further generalization to multinomial coefficients.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.