I knew about the Wiki http://michaelnielsen.org/polymath1/index.php?title=Bounded_gaps_between_primes http://michaelnielsen.org/polymath1/index.php?title=Bounde

I knew about the Wiki http://michaelnielsen.org/polymath1/index.php?title=Bounded_gaps_between_primes http://michaelnielsen.org/polymath1/index.php?title=Bounded_... However, I did not know about the solo paper http://arxiv.org/abs/1311.4600 http://arxiv.org/abs/1311.4600 In their celebrated paper [5], Goldston, Pintz and Yıldırım introduced a new method for counting tuples of primes, and this allowed them to show that [eq 1.1] The recent breakthrough of Zhang [9] managed to extend this work to prove [eq 1.2] "Sieve methods" say integer properties like divisibility are essentially random. This is how we can show two integer randomly chosen are relativley prime with probabilty pi²/6= 0.608... http://math.stackexchange.com/questions/64498/probability-that-two-random-numbers-are-coprime http://math.stackexchange.com/questions/64498/probability-th... Here we are trying to count primes separated by certain small gaps.