The number of nonzero binomial coefficients modulo p^
From MaRDI portal
Publication:2905231
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.
Recommendations
Cited in
(8)- Divisibility of binomial coefficients by powers of two
- On a conjecture of Cusick concerning the sum of digits of n and n+t
- scientific article; zbMATH DE number 17608 (Why is no real title available?)
- scientific article; zbMATH DE number 166136 (Why is no real title available?)
- scientific article; zbMATH DE number 1222521 (Why is no real title available?)
- Counting binomial coefficients divisible by a prime power
- A matrix generalization of a theorem of Fine
- The combinatorics of Kummer's theorem on binomial coefficients
This page was built for publication: The number of nonzero binomial coefficients modulo \(p^{\alpha}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2905231)