×

Explicit bounds on exponential sums and the scarcity of squarefree binomial coefficients. (English) Zbl 0868.11009

The interest in prime factors of binomial coefficients during the last ten years or so has been motivated to a great extent by a conjecture of Erdös asserting that \({{2n}\choose n}\) is not squarefree for any \(n>4\). This was recently proved by G. Velammal [Hardy-Ramanujan J. 18, 23-45 (1995; Zbl 0817.11011)], and another proof is given in the present paper, among many other interesting results. As a sharpening of the Erdös conjecture, it is shown that the coefficient in question is divisible even by the square of a prime \(\geq \sqrt{n/5}\) for all \(n\geq 2082\). On the other hand, \({{1572}\choose {786}}\) is not divisible by the square of any odd prime (it is divisible by \(2^4\)), and it is the largest coefficient of this kind.
In addition to the middle of the Pascal triangle, the authors consider it as a whole, in particular its edges. Squarefree values (other than 1) do occur near the edges, and only there. For instance, there are infinitely many integers \(n\) such that \({n\choose k}\) is squarefree for all \(k\leq (1/5)\log n\). On the other hand, it is shown that if \({n\choose k}\) is squarefree, then \(n\) or \(n-k\) is \(\ll\exp(c(\log n)^{2/k} (\log\log n)^{1/3})\) for some constant \(c\), and it is conjectured that this bound can be reduced to \(\ll(\log n\log\log n)^2\), which would be close to being best possible. A curious statistical result indicating the scarcity of the squarefree binomial coefficients is that the average number of these in a row of the Pascal triangle is about \(10.66\).
An important tool in previous work related to the Erdös conjecture has been the exponential sums of the type \(\sum_n \Lambda(n)e(x/n)\), where \(n\) thus runs essentially over primes, and the same is the case also in the present paper, where explicit estimates for such sums are given and applied as a key ingredient of the argument.
Reviewer: M.Jutila (Turku)

MSC:

11B65 Binomial coefficients; factorials; \(q\)-identities
11L20 Sums over primes
11L07 Estimates on exponential sums

Citations:

Zbl 0817.11011
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] DOI: 10.2307/2005976 · Zbl 0326.10037
[2] DOI: 10.2307/2152995 · Zbl 0761.11037
[3] Gallagher, Ada Arith. 24 pp 491– (1974)
[4] DOI: 10.1016/0022-314X(87)90031-X · Zbl 0606.10033
[5] DOI: 10.2307/2152948 · Zbl 0781.11008
[6] Dress, J. reine angew. Math. 340 pp 53– (1983)
[7] Davenport, Multiplicative Number Theory (1980)
[8] Bombieri, Astérisque 18 pp 103– (1987)
[9] DOI: 10.2307/2005583 · Zbl 0311.10009
[10] DOI: 10.1017/S0305004100075927 · Zbl 0778.11012
[11] Sander, J. reine angew. Math. 430 pp 1– (1992)
[12] DOI: 10.1112/blms/24.2.140 · Zbl 0769.11009
[13] Rosser, J. Math. 6 pp 64– (1962)
[14] Jutila, J. Indian Math. Soc. 38 pp 125– (1974)
[15] Halberstam, Sieve Methods (1974)
[16] Guy, Unsolved Problems in Number Theory (1994) · Zbl 0805.11001
[17] Graham, Van der Corput’s Method of Exponential Sums (1991) · Zbl 0713.11001
[18] DOI: 10.2307/2008595 · Zbl 0673.10012
[19] Velammal, Hardy-Ramanujan J. 18 pp 23– (1995)
[20] DOI: 10.1090/S0273-0979-1985-15349-2 · Zbl 0575.42003
[21] Titchmarsh., The Theory of the Riemann Zeta-function (1988) · Zbl 0042.07901
[22] DOI: 10.1016/0022-314X(85)90017-4 · Zbl 0551.10002
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.