Background: https://en.wikipedia.org/wiki/Twin_prime https://en.wikipedia.org/wiki/Twin_prime > On April 17, 2013, Yitang Zhang announced a proof that for some

Background: https://en.wikipedia.org/wiki/Twin_prime https://en.wikipedia.org/wiki/Twin_prime > On April 17, 2013, Yitang Zhang announced a proof that for some integer N that is less than 70 million, there are infinitely many pairs of primes that differ by N.[9] Zhang's paper was accepted by Annals of Mathematics in early May 2013.[10] Terence Tao subsequently proposed a Polymath Project collaborative effort to optimize Zhang's bound.[11] As of April 14, 2014, one year after Zhang's announcement, the bound has been reduced to 246.[12]