Hostname: page-component-78c5997874-mlc7c Total loading time: 0 Render date: 2024-11-14T07:28:50.389Z Has data issue: false hasContentIssue false
  • English
  • Français

Large prime quadruplets

Published online by Cambridge University Press:  01 August 2016

Tony Forbes
Tony Forbes*
Affiliation:
22 St Albans Road, Kingston upon Thames, Surrey KT2 5HQ
Get access Rights & Permissions [Opens in a new window]

Extract

With one exception, namely {2, 3, 5, 7}, it is impossible to have four consecutive primes p1, p2, p3, p4 with p4 - p1 < 8. An interval of seven or less cannot contain more than three odd numbers unless one of them is a multiple of three. On the other hand, groups of four primes p, p + 2, p + 6, p + 8, usually called prime quadruplets, are fairly common. The first is {5, 7, 11, 13}, followed by {11, 13, 17, 19}, {101, 103, 107, 109}, {191, 193, 197, 199}, {821, 823, 827, 829} and so on. Just as with prime twins, pairs of primes p, p + 2, it is conjectured that the sequence of prime quadruplets goes on for ever. Indeed, the apparently simpler prime twin conjecture is currently an unsolved problem of mathematics although in 1973, Jing-Run Chen proved a weaker form: There are infinitely many primes p such that p + 2 is either prime or the product of two primes (See Halberstam & Richert [1]). A similar result holds for quadruplets [1, Theorem 10.6]: There exist infinitely many primes p such that (p + 2) (p + 6) (p + 8) has at most 14 prime factors. The prime quadruplet conjecture would then follow if we could reduce ‘14’ to ‘3’ but this seems be a problem of extreme difficulty.

Type
Articles
Information
The Mathematical Gazette , Volume 84 , Issue 501 , November 2000 , pp. 447 - 452
Copyright
Copyright © The Mathematical Association 2000

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. Halberstam, H. and Richert, H.-E Sieve Methods, Academic Press, (1974).Google Scholar
2. Wells, David The Penguin Dictionary of Curious and Interesting Numbers, Penguin Books, (1986).Google Scholar
3. Trigg, C. W. A large prime quadruplet, J. Ree. Math, 14 (1981/1982), p. 167.Google Scholar
4. Roonguthai, Warut Prime quadruplets, M500, 148 (February 1996), p. 9.Google Scholar
5. Roonguthai, Warut Large prime quadruplets, M500, 153 (December 1996), pp. 4–5.Google Scholar
6. Pocklington, H. C. The determination of the prime or composite nature of large numbers by Fermat’s theorem, Proc. Cambridge Philos. Soc., v. 18 (1914–16), pp. 29–30.Google Scholar
7. Brillhart, J. Lehmer, D. H. Selfridge, J. Wagstaff, S. S. Jr, and Tuckerman, B. Factorizations of bn ± 1, b = 2, 3, 5, 6, 7, 10, 11, 12 up to high powers, Contemporary Mathematics vol. 22, 2nd Edition, American Math. Society, (1988).Google Scholar
8. Brillhart, J. Lehmer, D. H. and Selfridge, J. L. New primality criteria and factorizations of 2 m ± 1, Math. Comp. 29 (1975), pp. 620–647.Google Scholar