Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-29T02:51:47.077Z Has data issue: false hasContentIssue false
  • English
  • Français

On smooth gaps between consecutive prime numbers

Part of: Multiplicative number theory

Published online by Cambridge University Press:  26 February 2010

A. Balog ,
J. Brüdern  and
T. D. Wooley
A. Balog
Affiliation:
Mathematical Institute, Budapest 1364, Hungary. e-mail: balog@math-inst.hu
J. Brüdern
Affiliation:
Mathematisches Institut A, Universität Stuttgart, Postfach 80 11 40, D-70511 Stuttgart, Germany. e-mail: bruedern@mathematik.uni-stuttgart.de
T. D. Wooley
Affiliation:
Department of Mathematics, University of Michigan, East Hall, 525 East University Avenue, Ann Arbor, MI 48109-1109, U.S.A. e-mail: wooley@math.lsa.umich.edu
Get access

Extract

Investigations concerning the gaps between consecutive prime numbers have long occupied an important position on the interface between additive and multiplicative number theory. Perhaps the most famous problem concerning these gaps, the Twin Prime Conjecture, asserts that the aforementioned gaps are infinitely often as small as 2. Although a proof of this conjecture seems presently far beyond our reach (but see [5] and [10] for related results), weak evidence in its favour comes from studying unusually short gaps between prime numbers. Thus, while it follows from the Prime Number Theorem that the average gap between consecutive primes of size about x is around log x, it is now known that such gaps can be infinitely often smaller than 0–249 log x (this is a celebrated result of Maier [12], building on earlier work of a number of authors; see in particular [7], [13], [3] and [11]). A conjecture weaker than the Twin Prime Conjecture asserts that there are infinitely many gaps between prime numbers which are powers of 2, but unfortunately this conjecture also seems well beyond our grasp. Extending this line of thought, Kent D. Boklan has posed the problem of establishing that the gaps between prime numbers infinitely often have only small prime divisors, and here the latter divisors should be small relative to the size of the small gaps established by Maier [12]. In this paper we show that the gaps between consecutive prime numbers infinitely often have only small prime divisors, thereby solving Boklan's problem. It transpires that the methods which we develop to treat Boklan's problem are capable also of detecting multiplicative properties of more general type in the differences between consecutive primes, and this theme we also explore herein.

MSC classification

Secondary: 11N05: Distribution of primes
Type
Research Article
Information
Mathematika , Volume 46 , Issue 1 , June 1999 , pp. 57 - 75
Copyright
Copyright © University College London 1999

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

1.Balog, A. The prime k-tuplets conjecture on average Analytic Number Theory. (Allerton Park, IL, 1989), Progr. Math., 85 (Birkhäuser Boston, Boston, MA, 47–75.Google Scholar
2.Bateman, P. T. and Horn, R. A.A heuristic asymptotic formula concerning the distribution of prime numbers. Math. Comp., 16(1962), 363–367.CrossRefGoogle Scholar
3.Bombieri, E. and Davenport, H.. Small differences between prime numbers Proc. Roy. Soc. Ser. A, 293(1966), 1–18.Google Scholar
4.Bombieri, E., Bombieri, J. B. and Friedlander, J. B. and Iwaniec, H.Primes in arithmetic progressions to large moduli. Ada Math., 156(1986), 203–251.Google Scholar
5.Chen, J.-R.On the representation of a large even integer as the sum of a prime and the product of at most two primes. Sci. Sinica, 16(1973), 157–176.Google Scholar
6.Davenport, H.. Multiplicative Number Theory, 2nd ed. revised by H. L. Montgomery, Graduate Texts in Mathematics, 74 (Springer-Verlag, Berlin, 1980).Google Scholar
7.Erdős, P.. The difference of consecutive primes, Duke Math. J., 6(1940), 438–441.CrossRefGoogle Scholar
8.Fouvry, E. and Grupp, F.. On the switching principle in sieve theory. J. Reine Angew. Math., 370(1986), 101–126.Google Scholar
9.Halberstam, H. and Richert, H.-E.. Sieve methods. London Mathematical Society Monographs,. No. 4 (Academic Press, London-New York, 1974).Google Scholar
10.Heath-Brown, D. R.. Prime twins and Siegel zeros. Proc. London Math. Soc. (3) 47 (1983), 193–224.CrossRefGoogle Scholar
11.Huxley, M. N.. Small differences between consecutive primes II. Mathematika, 24 (1977), 142–152.CrossRefGoogle Scholar
12.Maier, H.. Small differences between prime numbers. Michigan Math. J., 35 (1988), 323–344.CrossRefGoogle Scholar