Cluster Primes

From MaRDI portal





The authors prove some results about cluster primes. An odd prime \(p\) is called cluster is every even integer less than \(p-2\) can be written as a difference of two primes \(q-q'\), where \(q\) and \(q'\) are both less than or equal to \(p\). It is not known if there are infinitely many cluster primes, but if it where so, this would imply that \(p_{n+1}-p_n\leq 6\) holds for infinitely many \(n\). For any positive real number \(x\) let \(\pi_c(x)\) be the number of cluster primes \(p<x\). The authors' Theorem 1 shows that for any \(s>0\) the inequality \(\pi_c (x)< {x\over(\log x)^s}\) holds for all \(x>x_0(s)\). The proof of this result uses Brun's sieve and explicit estimates from the prime number theorem. Their theorem implies that the sum of the reciprocals of the cluster primes is convergent. The authors also present an algorithm which, given a particular cluster prime \(p_n\), determines the next cluster prime greater than \(p_n\), and use this algorithm to determine the distribution of all the cluster primes up to \(10^{13}\). Some connections with the twin primes are pointed out.











This page was built for publication: Cluster Primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757333)