Cluster prime

In number theory, a cluster prime is a prime number p such that every even positive integer k ≤ p − 3 can be written as the difference between two prime numbers not exceeding p. For example, the number 23 is a cluster prime because 23 − 3 = 20, and every even integer from 2 to 20, inclusive, is the difference of at least one pair of prime numbers not exceeding 23:

p ≤ 23
5 − 3 = 2
7 − 3 = 4
11 − 5 = 6
11 − 3 = 8
13 − 3 = 10
17 − 5 = 12
17 − 3 = 14
19 − 3 = 16
23 − 5 = 18
23 − 3 = 20

On the other hand, 149 is not a cluster prime because 140 < 146, and there is no way to write 140 as the difference of two primes that are less than or equal to 149.

By convention, 2 is not considered to be a cluster prime. The first 23 odd primes (up to 89) are all cluster primes. The first few odd primes that are not cluster primes are

97, 127, 149, 191, 211, 223, 227, 229, ... (sequence A038133 in the OEIS)
Unsolved problem in mathematics
Are there infinitely many cluster primes?

Paul Erdős asked if there are infinitely many cluster primes. It is not known if there are infinitely many cluster primes.

Properties

References

  1. ↑ Weisstein, Eric W. "Cluster Prime". mathworld.wolfram.com. Wolfram Research, Inc. Retrieved 2026-10-01.
  2. 1 2 3 Sloane, N. J. A. (ed.). "Sequence A038134 (Cluster primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. 1 2 3 Blecksmith, Richard; Erdős, Paul; Selfridge, J. L. (1999). "Cluster Primes". The American Mathematical Monthly. 106 (1). [Taylor & Francis, Ltd., Mathematical Association of America]: 43–48. doi:10.2307/2589585. ISSN 0002-9890.
  4. ↑ Guy, Richard K. (2004). Unsolved Problems in Number Theory. Problem Books in Mathematics. Vol. 1. New York, NY: Springer New York. doi:10.1007/978-0-387-26677-0. ISBN 978-1-4419-1928-1.