Some Counting Problems Involving the Multinomial Expansion (Q3981397)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 21788
Language Label Description Also known as
default for all languages
No label defined
    English
    Some Counting Problems Involving the Multinomial Expansion
    scientific article; zbMATH DE number 21788

      Statements

      0 references
      0 references
      26 June 1992
      0 references
      p-ary numbers system
      0 references
      carries
      0 references
      multinomial coefficient
      0 references
      computer program
      0 references
      Some Counting Problems Involving the Multinomial Expansion (English)
      0 references
      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.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references