Reducing multinomial coefficients modulo a prime power

DOI10.1016/0898-1221(84)90084-1zbMATH Open0538.10002OpenAlexW1991686793MaRDI QIDQ793072FDOQ793072

Authors: Robert J. Martin, Gary L. Mullen 

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

Recommendations

• Publication:3033833
• Multinomial coefficients modulo a prime
• On multinomial coefficients modulo a prime
• scientific article; zbMATH DE number 4104958
• scientific article; zbMATH DE number 1354891

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)

Cites Work

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

Cited In (4)

• On multinomial coefficients modulo a prime
• Prime power divisors of multinomial and \(q\)-multinomial coefficients
• Distribution of polynomial coefficients, congruent modulo \(p^ N\)
• On a function related of multinomial coefficients. I.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793072)