scientific article; zbMATH DE number 166136
Hexel and Sachs obtained formulas for the number of occurrences of each residue modulo any prime \(p\) in the \(n\)th row of Pascal's triangle. Davis and Webb considered the same problem modulo 4 by a different approach. This is the only case of composite modulus for which formulas for the number of occurrences have been obtained. In this paper, the above mentioned results are extended to multinomial and \(q\)-binomial coefficients. Explicit formulas are obtained for \(p=3\). For \(p>3\) formulas can be worked out in terms of Hexel and Sachs results. For multinomial coefficients, formulas are obtained for the number of occurrences of each residue modulo 4 and the same problem is considered for \(p=3\) and \(p>3\).
- Distribution of multinomial and \(q\)-binomial coefficients modulo \(p\)
- On the mod \(p^2\) determination of \(\binom{(p-1)/2}{(p-1)/4}\)
- Products and Sums of Powers of Binomial Coefficients mod p and Solutions of Certain Quaternary Diophantine Systems
- An elementary approach to \(\binom{(p-1)/2}{(p-1)/4}\) modulo \(p^2\)
- Some congruences involving fourth powers of central q-binomial coefficients
- On p,q-binomial coefficients
- On sums of binomial coefficients modulo p^2
- On multinomial coefficients modulo a prime
- Congruences for \(q\)-binomial coefficients
- The number of nonzero binomial coefficients modulo \(p^{\alpha}\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033751)
