Explicit bounds on exponential sums and the scarcity of squarefree binomial coefficients

Mathematika

Volumn 43, Issue 1, 1996, Pages 73-107

  Granville, Andrew ^a   Ramaré, Olivier ^b  

^a UNIVERSITY OF GEORGIA   (United States)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21344465771     PISSN: 00255793     EISSN: None     Source Type: Journal    
DOI: 10.1112/s0025579300011608     Document Type: Article

References (27)

1. m ± 1. Math. Comp., 29 (1975), 620-647.
2. Bo. E. Bombieri. Le grand crible dans la théorie analytique des nombres. Astérisque, 18 (1987/1974), 103 pp.
3. C. P. Cutter. Finding big prime k-tuplets. To appear.
4. Da. H. Davenport. Multiplicative Number Theory, 2nd ed. (Springer-Verlag, New York, 1980).
5. DIT. F. Dress, H. Iwaniec and G. Tenenbaum. Sur une somme liée à la fonction de Möbius, J. reine angew. Math., 340 (1983), 53-58.
6. EG. P. Erdös and R. L. Graham. Old and new problems and results in combinatorial number theory. Enseign. Math. Geneva (1980).
7. ELS. P. Erdös, C. B. Lacampagne and J. L. Selfridge. Estimates of the least prime factor of a binomial coefficient. Math. Comp., 61 (1993), 215-224.
8. FL. J. B. Friedlander and J. C. Lagarias. On the distribution in short intervals of integers having no large prime factor. J. Number Theory, 25 (1987), 249-273.
9. Ga. P. X. Gallagher. Sieving by prime powers. Acta Arith., 24 (1974), 491-497.
10. Go. P. Goetgheluck. On prime divisors of binomial coefficients. Math. Comp., 51 (1988), 325-329.
11. GK. S. W. Graham and G. Kolesnik. Van der Corput's Method of Exponential Sums (Cambridge University Press, Cambridge, 1991).
12. Gu. R. K. Guy. Unsolved Problems in Number Theory, 2nd ed. (Springer-Verlag, New York, 1994).
13. HR. H. Halberstam and H.-E. Richert. Sieve Methods (Academic Press, London, 1974).
14. J. M. Jutila. On numbers with a large prime factor, II. J. Indian Math. Soc., 38 (1974), 125-130.
15. KP. S. Konyagin and C. Pomerance. Primes recognizable in deterministic polynomial time. To appear.
16. RS. J. B. Rosser and L. Schoenfeld. Approximate formulae for some functions of prime numbers. Ill. J. Math., 6 (1962), 64-94.
17. Sal. J. W. Sander. On prime power divisors of binomial coefficients. Bull. London Math. Soc., 24 (1992), 140-142.
18. Sa2. J. W. Sander. Prime power divisors of binomial coefficients. J. reine angew. Math., 430 (1992), 1-20.
19. Sa3. J. W. Sander. On primes not dividing binomial coefficients. Proc. Comb. Phil. Soc., 113 (1993), 225-232.
20. Sa4. J. W. Sander, e-mail correspondence (25th November 1994).
21. Sar. A. Sárközy. On divisors of binomial coefficients. I. J. Number Theory, 20 (1985), 70-80.
22. Sch. L. Schoenfeld. Sharper bounds for the Chebyshev functions θ(x) and ψ(x), II. Math. Comp., 30 (1976), 337-360.
23. SW. R. Scheidler and H. C. Williams. A method of tabulating the number-theoretic function g(k). Math. Comp., 59 (1992), 251-257.
24. Ti. E. C. Titchmarsh. The Theory of the Riemann Zeta-function, 2nd ed., revised by D. R. Heath-Brown (Oxford University Press, New York, 1988).
25. Va. J. D. Vaaler. Some extremal functions in Fourier analysis. Bull. Amer. Math. Soc., 12 (1985), 183-216.
26. n) squarefree? Hardy-Ramanujan J., 18 (1995), 23-45.
27. W. E. A. Wirsing. Multiple prime divisors of binomial coefficients. To appear.