<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Polignac&#039;s conjecture - Page 2 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Polignac's_conjecture&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Polignac%27s_conjecture&amp;p=3">3.Next</a>
</p>
<p>or disproven for any given value of n, in 2013 an important breakthrough was made by <a href="page.php?w=Zhang_Yitang">Yitang Zhang</a> who proved that there are infinitely many <a href="page.php?w=prime_gap">prime gap</a>s of size n for some value of n < 70,000,000. Later that year, <a href="page.php?w=James_Maynard_%28mathematician%29">James Maynard announced a related breakthrough which proved that there are infinitely many prime gaps of some size less than or equal to 600. As of April 14, 2014, one year after Zhang's announcement, according to the <a href="page.php?w=Polymath_projects">Polymath project wiki</a>, n has been reduced to 246. Further, assuming the <a href="page.php?w=Elliott-Halberstam_conjecture">Elliott-Halberstam conjecture</a> and its generalized form, the Polymath project wiki states that n has been reduced to 12 and 6, respectively.</></p><p>
<a accesskey="1" href="page.php?w=Polignac's_conjecture&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Polignac%27s_conjecture&amp;p=3">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
