AND WilLiam WebB Department of Mathematics, Washington State Unicersity, Pullman, Washington 99164-3113 Communicated hy Hans Zassenhaus
Prime power divisors of binomial coefficients
✍ Scribed by Paul Erdös; Grigori Kolesnik
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 582 KB
- Volume
- 200
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
It is known that for sufficiently large n and m and any r the binomial coefficient (~) which is close to the middle coefficient is divisible by pr where p is a 'large' prime. We prove the exact divisibility of (,~) by p' for p>c(n). The lower bound is essentially the best possible. We also prove some other results on divisibility of binomial coefficients. (~) 1999 Elsevier Science B.V.
📜 SIMILAR VOLUMES
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 Academ