Mean divisibility of multinomial coefficients (Q2637201)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    Mean divisibility of multinomial coefficients
    scientific article

      Statements

      Mean divisibility of multinomial coefficients (English)
      0 references
      0 references
      7 February 2014
      0 references
      The author generalizes already existing in number theory notions like {\mathsf divisibility} and {\mathsf strong divisibility}, for sequences of nonzero integers. For a positive integer \(k\geq 2\), such a sequence \((a_{n})\) is called {\mathsf almost mean }\(k\){-divisible} if there is a positive integer \(C=C(k)\) such that \((\prod\limits_{n=1}^{t}a_{kn})/(\prod \limits_{i=1}^{t}a_{n})\in \frac{1}{C}\mathbb{Z}\) for any positive integer \(t \), and {\mathsf mean divisible} if \(\prod\limits_{i=1}^{t}a_{n}|\prod \limits_{n=1}^{t}a_{kn}\) for every positive integers \(k\) and \(t\). Let \(m_{1},...,m_{s}\) be positive integers. A {\mathsf multinomial sequence} is defined by \[ a_{n}=\frac{((m_{1}+...+m_{s})n)!}{(m_{1}n)!...(m_{s}n)!} \] In this paper nontrivial examples for these new notions are given using multinomial sequences. More precisely, the following results are stated and proved: {Theorem 1. } If \(\mathrm{GCD}(m_{1},...,m_{s})=1\),then the multinomial sequence is almost mean \(k\)-divisible for all \(k\), {Theorem 3. } If \(\mathrm{GCD}(m_{1},...,m_{s})>1\),then the multinomial sequence is not almost mean \(k\)-divisible for all \(k\), and {Theorem 6. } If \(m_{1},...,m_{s}\) are pairwise coprime and each \(m_{i}\) divides \(\sum\limits_{i=1}^{s}m_{i}\), then the multinomial sequence is mean divisible.
      0 references
      multinomial coefficient
      0 references
      k-mean divisible
      0 references
      mean divisible
      0 references
      Riemann sum
      0 references

      Identifiers

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