Some Counting Problems Involving the Multinomial Expansion
For the multinomial coefficient \(m={(e_ 1+e_ 2+\ldots+e_ t)!\over e_ 1!e_ 2!\ldots e_ t!}\), where the \(e_ i\) are nonnegative integers, the authors investigate the highest power of a prime \(p\) which is a factor of \(m\) (called \(\hbox{ord}_ p(m)\)) using arithmetic to the base \(p\). Their main tool is a theorem of Kummer, which they prove, and the chief results are about: (i) the quantity of \(m\), which, with a given numerator, are not divisible by \(p\); (ii) the quantity of \(m\), which, with a given numerator, are divisible by 2 but not by 4; (iii) the number of binonial coefficient, with given numerator, for which \(\hbox{ord}_ p(m)\) is maximal. The pedagogical significance of their work is hidden in the last paragraph where they reveal that their investigations were sustained by a computer program.
- Higher order differentiation over finite fields with applications to generalising the cube attack
- scientific article; zbMATH DE number 562305 (Why is no real title available?)
- scientific article; zbMATH DE number 975421 (Why is no real title available?)
- Prime power divisors of multinomial and q-multinomial coefficients
- The combinatorics of Kummer's theorem on binomial coefficients
- Buchstaber, Ochanine, Krichever, and Witten genera
- Fast computation of multinomial coefficients
This page was built for publication: Some Counting Problems Involving the Multinomial Expansion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3981397)