W*****d
发帖数: 4196 | 1 看这一段，大部分篇幅都是讲陶的，而且说陶的方法更简单并且是独立想出来的
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.[1][2] Zhang's paper was accepted by Annals of Mathematics in
early May 2013.[3] Terence Tao subsequently proposed a Polymath project
collaborative effort to optimize Zhang’s bound.[4] As of April 14, 2014,
one year after Zhang's announcement, according to the Polymath project wiki,
the bound has been reduced to 246.[5] Further, assuming the Elliott–
Halberstam conjecture and its generalized form, the Polymath project wiki
states that the bound has been reduced to 12 and 6, respectively.[6] These
improved bounds were discovered using a different approach that was simpler
than Zhang's and was discovered independently by James Maynard and Terence
Tao. This second approach also gave bounds for the smallest f(m) needed to
guarantee that infinitely many intervals of width f(m) contain at least m
primes. | l******r
发帖数: 18699 | 2 经费多的好处
that
wiki,
【在 W*****d 的大作中提到】
: 看这一段，大部分篇幅都是讲陶的，而且说陶的方法更简单并且是独立想出来的
: 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.[1][2] Zhang's paper was accepted by Annals of Mathematics in
: early May 2013.[3] Terence Tao subsequently proposed a Polymath project
: collaborative effort to optimize Zhang’s bound.[4] As of April 14, 2014,
: one year after Zhang's announcement, according to the Polymath project wiki,
: the bound has been reduced to 246.[5] Further, assuming the Elliott–
: Halberstam conjecture and its generalized form, the Polymath project wiki
: states that the bound has been reduced to 12 and 6, respectively.[6] These
| d******r
发帖数: 16947 | 3 尼玛陶就沦落到拾人牙慧的地步了
that
wiki,
【在 W*****d 的大作中提到】
: 看这一段，大部分篇幅都是讲陶的，而且说陶的方法更简单并且是独立想出来的
: 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.[1][2] Zhang's paper was accepted by Annals of Mathematics in
: early May 2013.[3] Terence Tao subsequently proposed a Polymath project
: collaborative effort to optimize Zhang’s bound.[4] As of April 14, 2014,
: one year after Zhang's announcement, according to the Polymath project wiki,
: the bound has been reduced to 246.[5] Further, assuming the Elliott–
: Halberstam conjecture and its generalized form, the Polymath project wiki
: states that the bound has been reduced to 12 and 6, respectively.[6] These
| g*****a
发帖数: 1112 | 4 而且说陶的方法更简单并且是独立想出来的
-----无所谓，作科研的都知道，这跟原创比根本不值一提。 这种工作就好象是数学
竞赛，你已经知道肯定有解了，再去想方法做出来／优化解。张的工作是所有人都不知
道能不能解的时候作的。 |
|
