Skip to main content

Timeline for Yitang Zhang's paper

Current License: CC BY-SA 3.0

9 events
when toggle format what by license comment
Feb 15, 2015 at 18:32 comment added GH from MO @ToddTrimble: Thanks for pointing this out. I updated the text accordingly.
Feb 15, 2015 at 18:09 history edited GH from MO CC BY-SA 3.0
added 439 characters in body
Feb 15, 2015 at 14:43 comment added Todd Trimble My understanding is that $H_1$ has been lowered from 252 to 246: see arxiv.org/abs/1409.8361.
Apr 10, 2014 at 20:14 comment added GH from MO @John: To your second comment, it was proved by János Pintz that there is a positive integer $C$ such that among any $C$ consecutive positive integers there is a number that occurs infinitely often as a difference of two primes. This follows from the quoted result of Zhang. On the other hand, we only know the existence of such a $C$, and in fact the quoted results of Zhang/Maynard/Tao/PolyMath8 do not allow to specify this $C$.
Apr 10, 2014 at 20:08 comment added GH from MO @John: To your first comment, I am saying that if you take 51 integers that do not form a complete residue system modulo any integer greater than 1, then one of the pairwise distances among these integers occurs infinitely often as the difference of two distinct primes. In particular, there is a gap less than or equal to 252 that occurs infinitely often.
Apr 10, 2014 at 19:07 comment added John Nicholson The difference of the pair $k$ happens for an infinite number of other pairs > 252 with a difference of $k$?
Apr 10, 2014 at 18:55 comment added John Nicholson So using the improved numbers of 252 and 51, you are saying that any number from 2 to 51 that do no complete a residue system modulo, which mean that the dividing number is greater than $\ceilimg{\sqrt{51}} = 8$ has a pair with another prime < 252?
Apr 10, 2014 at 15:23 history edited GH from MO CC BY-SA 3.0
added 5 characters in body
Apr 10, 2014 at 15:00 history answered GH from MO CC BY-SA 3.0