<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://number.subwiki.org/w/index.php?action=history&amp;feed=atom&amp;title=Brun%27s_theorem</id>
	<title>Brun&#039;s theorem - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://number.subwiki.org/w/index.php?action=history&amp;feed=atom&amp;title=Brun%27s_theorem"/>
	<link rel="alternate" type="text/html" href="https://number.subwiki.org/w/index.php?title=Brun%27s_theorem&amp;action=history"/>
	<updated>2026-06-29T14:32:33Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.41.2</generator>
	<entry>
		<id>https://number.subwiki.org/w/index.php?title=Brun%27s_theorem&amp;diff=524&amp;oldid=prev</id>
		<title>Vipul: Created page with &#039;==Statement==  The theorem states the following:  For any &lt;math&gt;x &gt; 0&lt;/math&gt;, the number of fact about::twin primes less than or equal to &lt;math&gt;x&lt;/math&gt; is bounded from above…&#039;</title>
		<link rel="alternate" type="text/html" href="https://number.subwiki.org/w/index.php?title=Brun%27s_theorem&amp;diff=524&amp;oldid=prev"/>
		<updated>2010-05-29T21:16:02Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;#039;==Statement==  The theorem states the following:  For any &amp;lt;math&amp;gt;x &amp;gt; 0&amp;lt;/math&amp;gt;, the number of &lt;a href=&quot;/w/index.php?title=Fact_about::twin_primes&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;Fact about::twin primes (page does not exist)&quot;&gt;fact about::twin primes&lt;/a&gt; less than or equal to &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; is bounded from above…&amp;#039;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;==Statement==&lt;br /&gt;
&lt;br /&gt;
The theorem states the following:&lt;br /&gt;
&lt;br /&gt;
For any &amp;lt;math&amp;gt;x &amp;gt; 0&amp;lt;/math&amp;gt;, the number of [[fact about::twin primes]] less than or equal to &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; is bounded from above by:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\frac{cx (\log \log x)^2}{(\log x)^2}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;c&amp;lt;/math&amp;gt; is a positive constant independent of &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
As a corollary, we obtain that the sum, over all pairs of [[twin primes]], of the reciprocals of both members of the pair, is finite. Specifically, the following sum is finite:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\left(\frac{1}{3} + \frac{1}{5}\right) + \left(\frac{1}{5} + \frac{1}{7}\right) + \left(\frac{1}{11} + \frac{1}{13}\right) + \dots&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The constant to which this sum converges is termed [[Brun&amp;#039;s constant]]. No explicit finite upper bound on Brun&amp;#039;s constant has been established.&lt;br /&gt;
&lt;br /&gt;
The following are some easy corollaries:&lt;br /&gt;
&lt;br /&gt;
# The sum of the reciprocals of all twin primes is finite. Note that this sum differs from the sum above by &amp;lt;math&amp;gt;1/5&amp;lt;/math&amp;gt; since &amp;lt;math&amp;gt;1/5&amp;lt;/math&amp;gt; appears twice in the above sum. In other words, the set of twin primes is a [[fact about::small set| ]][[proves property satisfaction of::small set]].&lt;br /&gt;
# The sum of the reciprocals of each of the &amp;#039;&amp;#039;lesser&amp;#039;&amp;#039; of the pairs of twin primes is finite.&lt;br /&gt;
# The sum of the reciprocals of each of the &amp;#039;&amp;#039;greater&amp;#039;&amp;#039; of the pairs of twin primes is finite.&lt;/div&gt;</summary>
		<author><name>Vipul</name></author>
	</entry>
</feed>