Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-26T07:42:51.844Z Has data issue: false hasContentIssue false

On primes not dividing binomial coefficients

Published online by Cambridge University Press:  24 October 2008

J. W. Sander
Affiliation:
Institut für Mathematik, Universität Hannover, Welfengarten 1, D-W-3000 Hannover 1, Germany

Abstract

We prove that

thus dealing with open problems concerning divisors of binomial coefficients.

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Baker, R. C.. Diophantine Inequalities (Clarendon Press, 1986).Google Scholar
[2]Erdös, P. and Graham, R. L.. Old and New Problems and Results in Combinatorial Number Theory (Enseignement Math., 1980).Google Scholar
[3]Erdös, P., Graham, R. L., Ruzsa, I. Z. and Straus, E. G.. On the prime factors of . Math. Comp. 29 (1975), 8392.Google Scholar
[4]Jutila, M.. On the numbers with a large prime factor, II. J. Indian Math. Soc. 38 (1974), 125130.Google Scholar
[5]Sander, J. W.. On a sum over primes, to appear.Google Scholar
[6]Sander, J. W.. Prime power divisors of binomial coefficients. J. Reine Angew. Math., 430 (1992), 120.Google Scholar
[7]Vinogradov, I. M.. The Method of Trigonometrical Sums in the Theory of Numbers (Interscience Publishers).Google Scholar