# Is there only a finite amount of primes that differ by $2k \in \mathbb N$?

With $2k \in \mathbb N$ greater or equal to the bound in Yitang Zhang's proof about prime number gaps (I put it that way since it's constantly decreasing).

As far as I know the proof states that there are infinitely many primes which differ by an even number lesser than the bound. Does that mean that there are only finitely many that differ by an even number greater or equal to the bound?

Edit:

The proof stated in the beginning: There are infinitely many primes that differ by a number less that 70 million. Now the (collective) proof states that there are infinitely many primes that differ by a number less than 246. Does that mean that the numbers between 246 and 70 million are excluded from being the distance of infinitely many prime pairs? (And also the ones above 70M ofc.)

They are not excluded. There is an old conjecture (Polignac's) that for every $k$ there are infinitely primes that differ by $2k$. That conjecture may very well be correct. It is now known that there is at least one $k$ such that there are infinitely primes that differ by $2k$, and that in fact there is such a $k$ with $k \leq 123$.

• I don't see how that would follow. Infinitely many even integers differ by 2, but it doesn't follow that only finitely many differ by more than 2. Sep 19, 2015 at 23:58
• @coffeemath So the twin prime number theorem is already proven? Sep 19, 2015 at 23:59
• No I didn't say that, only that it can't be decided just from Zhang's result. Sep 19, 2015 at 23:59
• No.There are arbitrarily large gaps. Consider for n>1 that n!+s for 1<s< n+1 is greater than s and divisible by s. We can also deduce the existence of arbitrarily large gaps by knowing that the asymptotic density of the primes is 0: If P(n) is the number of primes less than n then P(n)/n goes to 0 as n goes to infinity. Sep 20, 2015 at 0:00
• @user254665 I know that. My question refers to the amount of primes that differ by a fixed number. Sep 20, 2015 at 0:01

• They are not excluded. There is an old conjecture that for every $k$ there are infinitely primes that differ by $2k$. That conjecture may very well be correct. It is now known that there is at least one $k$ such that there are infinitely primes that differ by $2k$, and that in fact there is such a $k$ with $k\le 123$. Sep 20, 2015 at 0:11
• You are welcome. The recent results are a major achievement, but for almost all $k$, the problem remains open. And we do not even know precisely the $k$ for which the problem has been settled! Sep 20, 2015 at 0:17
• @AndréNicolas Is there anywhere to read up on the results? Does Zhangs breakthrough somehow say anything about more than one $k$ or something related? Sep 20, 2015 at 0:19