REVIEW 1 cited by
The number of nonzero binomial coefficients modulo p^alpha
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In 1947 Fine obtained an expression for the number of binomial coefficients on row n of Pascal's triangle that are nonzero modulo p. In this paper we use Kummer's theorem to generalize Fine's theorem to prime powers, expressing the number of nonzero binomial coefficients modulo p^alpha as a sum over certain integer partitions. For fixed alpha, this expression can be rewritten to show explicit dependence on the number of occurrences of each subword in the base-p representation of n.
Forward citations
Cited by 1 Pith paper
-
Nim on Integer Partitions and Hyperrectangles
Exact Sprague-Grundy formulas are proven for two new impartial games, PNim on Young diagrams and RNim on hyperrectangles, with a full description of partitions of value one.
Discussion (0). Continue with ORCID to comment.