Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Definition (p. 43). "A prime is called a cluster prime if every even positive integer less than can be written as a difference of two primes , where and are both less than or equal to ."
Equivalently, every even with is with primes at most . The paper writes for the number of cluster primes not exceeding (p. 43), and does not count as either a cluster or a non-cluster prime (p. 47).
Facts recorded with the definition (p. 43).
- The first odd primes are cluster primes, and is the smallest non-cluster prime: the previous prime is , and is not a difference of two primes below .
- If is a cluster prime, then the even numbers , , , , and so on must all be differences of primes below , so has enough primes in a short interval to its left.
- The first twin pair with not a cluster prime is : is not a difference of primes below .
The question (p. 43), as posed: "Are there infinitely many cluster primes?" The paper notes that an affirmative answer would imply for infinitely many primes , which it calls a well-known hopeless problem.
Source. R. Blecksmith, P. Erdős and J. L. Selfridge, Cluster primes, Amer. Math. Monthly 106 (1999), no. 1, 43--48; the definition, the small cases and the question on p. 43, the convention on on p. 47, read on the page images of the copy identified on the source card.
Read depth. Claims checked: the definition and the question were read clause by clause on the page image. The small-case facts were read as printed and not recomputed. Nothing here is independently reviewed.
Proof pointer
None needed for the definition. The small cases are checks on the primes up to stated on p. 43.
Dependencies
None.
Bears on
- Problem 17: the problem's primes are the cluster primes defined here, and its question is the question of p. 43. The problem's range for even is the definition's range of even positive integers less than . The paper poses the question and does not answer it.