Prime Power Divisors of Multinomial and q-Multinomial Coefficients
β Scribed by Grigori Kolesnik
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 151 KB
- Volume
- 89
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
β¦ Synopsis
We prove that for any integer d multinomial coefficients satisfying some conditions are exactly divisible by p d for many large primes p. The obtained results are essentially the best possible. Also, we show that under some hypothesis q-multinomial coefficients are divisible by p d .
2001 Academic Press
Theorem A is a simple corollary of related results on divisibility of binomial coefficients and we improved it in [1]. Here we further improve it in Theorems 1 4.
Since the case k=2 was studied in [1], we assume that k>2.
π SIMILAR VOLUMES
The authors (1968) have previously given tables of the percentage points of the range ( = w ) of r samples from a multinomial distribution of r cells each with probability r-i, r=2(1)10. This paper presents the small sample power of to for r=2(1)6 under alternatives 61 to the null hypothesis Ho of a
## Abstract The existence of a (__q,k__, 1) difference family in __GF__(__q__) has been completely solved for __k__β=β3,4,5,6. For __k__β=β7 only partial results have been given. In this article, we continue the investigation and use Weil's theorem on character sums to show that the necessary condi
For any prime power \(q\), we give explicit constructions for many infinite linear families of \(q+1\) regular Ramanujan graphs. This partially solves a problem that was raised by A. Lubotzky, R. Phillips, and P. Sarnak. They gave the same results as here, but only for \(q\) being prime and not equa