Reducing multinomial coefficients modulo a prime power

DOI10.1016/0898-1221(84)90084-1zbMath0538.10002OpenAlexW1991686793MaRDI QIDQ793072

Gary L. Mullen, Robert J. Martin

Publication date: 1984

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(84)90084-1

zbMATH Keywords

multinomial coefficientdivisibility by powers of primes

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (2)

Distribution of polynomial coefficients, congruent modulo \(p^ N\) ⋮ On a function related of multinomial coefficients. I.

Cites Work

• Unnamed Item
• The distribution of binomial coefficients \(\pmod p\)
• Congruence properties of ordinary and q-binomial coefficients
• The number of binomial coefficients divisible by a fixed power of a prime
• Number of Odd Binomial Coefficients
• The Lattice Point Covering Theorem for Rectangles
• Formulas for the Number of Binomial Coefficients Divisible by a Fixed Power of a Prime
• Binomial Coefficients Modulo a Prime

This page was built for publication: Reducing multinomial coefficients modulo a prime power