<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Another prime number down, infinity to&#160;go</title>
	<atom:link href="http://boingboing.net/2013/02/11/another-prime-number-down-inf.html/feed" rel="self" type="application/rss+xml" />
	<link>http://boingboing.net/2013/02/11/another-prime-number-down-inf.html</link>
	<description>Brain candy for Happy Mutants</description>
	<lastBuildDate>Sat, 18 May 2013 10:07:00 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.4.1</generator>
	<item>
		<title>By: showme</title>
		<link>http://boingboing.net/2013/02/11/another-prime-number-down-inf.html#comment-1653163</link>
		<dc:creator>showme</dc:creator>
		<pubDate>Tue, 12 Feb 2013 14:14:00 +0000</pubDate>
		<guid isPermaLink="false">http://boingboing.net/?p=212319#comment-1653163</guid>
		<description>Not The Life of Pi?</description>
		<content:encoded><![CDATA[<p>Not The Life of Pi?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Marc Montoya</title>
		<link>http://boingboing.net/2013/02/11/another-prime-number-down-inf.html#comment-1652957</link>
		<dc:creator>Marc Montoya</dc:creator>
		<pubDate>Tue, 12 Feb 2013 04:54:00 +0000</pubDate>
		<guid isPermaLink="false">http://boingboing.net/?p=212319#comment-1652957</guid>
		<description>i got it right here, but i cant put it here due to space and time constraints. nor can i tell you &#039;cause of space and time constraints. sigh</description>
		<content:encoded><![CDATA[<p>i got it right here, but i cant put it here due to space and time constraints. nor can i tell you &#8217;cause of space and time constraints. sigh</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Andrew Pautz</title>
		<link>http://boingboing.net/2013/02/11/another-prime-number-down-inf.html#comment-1652823</link>
		<dc:creator>Andrew Pautz</dc:creator>
		<pubDate>Tue, 12 Feb 2013 02:40:00 +0000</pubDate>
		<guid isPermaLink="false">http://boingboing.net/?p=212319#comment-1652823</guid>
		<description>Disclaimer: You&#039;ll choke your browser.

You can see the number fully written out (base-10) here:http://www.isthe.com/chongo/tech/math/digit/m57885161/huge-prime-c.html
</description>
		<content:encoded><![CDATA[<p>Disclaimer: You&#8217;ll choke your browser.</p>
<p>You can see the number fully written out (base-10) here:<a href="http://www.isthe.com/chongo/tech/math/digit/m57885161/huge-prime-c.html" rel="nofollow">http://www.isthe.com/chongo/tech/math/digit/m57885161/huge-prime-c.html</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: BillStewart2012</title>
		<link>http://boingboing.net/2013/02/11/another-prime-number-down-inf.html#comment-1652810</link>
		<dc:creator>BillStewart2012</dc:creator>
		<pubDate>Tue, 12 Feb 2013 02:17:00 +0000</pubDate>
		<guid isPermaLink="false">http://boingboing.net/?p=212319#comment-1652810</guid>
		<description>Mersenne primes aren&#039;t particularly useful for cryptography.  There aren&#039;t very many of them, and they&#039;ve got special forms which make them easy to find but might interfere with cryptographic use.  On the other hand, they&#039;re a good problem to use for developing tools for large distributed computations, and potentially more practical than looking for Space Aliens.</description>
		<content:encoded><![CDATA[<p>Mersenne primes aren&#8217;t particularly useful for cryptography.  There aren&#8217;t very many of them, and they&#8217;ve got special forms which make them easy to find but might interfere with cryptographic use.  On the other hand, they&#8217;re a good problem to use for developing tools for large distributed computations, and potentially more practical than looking for Space Aliens.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: cjporkchop</title>
		<link>http://boingboing.net/2013/02/11/another-prime-number-down-inf.html#comment-1652806</link>
		<dc:creator>cjporkchop</dc:creator>
		<pubDate>Tue, 12 Feb 2013 02:14:00 +0000</pubDate>
		<guid isPermaLink="false">http://boingboing.net/?p=212319#comment-1652806</guid>
		<description>From https://www.eff.org/awards/coop --
&quot;Prize money comes from a special donation provided by an individual EFF supporter, earmarked specifically for this project. Prize money does NOT come from EFF membership dues, corporate or foundation grants, or other general EFF funds.&quot;</description>
		<content:encoded><![CDATA[<p>From <a href="https://www.eff.org/awards/coop" rel="nofollow">https://www.eff.org/awards/coop</a> &#8211;<br />
&#8220;Prize money comes from a special donation provided by an individual EFF supporter, earmarked specifically for this project. Prize money does NOT come from EFF membership dues, corporate or foundation grants, or other general EFF funds.&#8221;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: awjt</title>
		<link>http://boingboing.net/2013/02/11/another-prime-number-down-inf.html#comment-1652730</link>
		<dc:creator>awjt</dc:creator>
		<pubDate>Tue, 12 Feb 2013 00:56:00 +0000</pubDate>
		<guid isPermaLink="false">http://boingboing.net/?p=212319#comment-1652730</guid>
		<description>Hey, rules are rules, and I&#039;m hereby making them!  :-)</description>
		<content:encoded><![CDATA[<p>Hey, rules are rules, and I&#8217;m hereby making them!  :-)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: bzishi</title>
		<link>http://boingboing.net/2013/02/11/another-prime-number-down-inf.html#comment-1652686</link>
		<dc:creator>bzishi</dc:creator>
		<pubDate>Tue, 12 Feb 2013 00:09:00 +0000</pubDate>
		<guid isPermaLink="false">http://boingboing.net/?p=212319#comment-1652686</guid>
		<description>Why? I assure you, &lt;a href=&quot;http://en.wikipedia.org/wiki/Euclid%27s_theorem&quot; rel=&quot;nofollow&quot;&gt;there are enough&lt;/a&gt; prime numbers for everyone to discover!</description>
		<content:encoded><![CDATA[<p>Why? I assure you, <a href="http://en.wikipedia.org/wiki/Euclid%27s_theorem" rel="nofollow">there are enough</a> prime numbers for everyone to discover!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: jimkirk</title>
		<link>http://boingboing.net/2013/02/11/another-prime-number-down-inf.html#comment-1652682</link>
		<dc:creator>jimkirk</dc:creator>
		<pubDate>Tue, 12 Feb 2013 00:04:00 +0000</pubDate>
		<guid isPermaLink="false">http://boingboing.net/?p=212319#comment-1652682</guid>
		<description>Whenever someone tells me to &quot;pick a number, any number&quot;, I just start rattling off digit until they get bored/aggravated and usually ask me to stop.</description>
		<content:encoded><![CDATA[<p>Whenever someone tells me to &#8220;pick a number, any number&#8221;, I just start rattling off digit until they get bored/aggravated and usually ask me to stop.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: bucaneer</title>
		<link>http://boingboing.net/2013/02/11/another-prime-number-down-inf.html#comment-1652679</link>
		<dc:creator>bucaneer</dc:creator>
		<pubDate>Mon, 11 Feb 2013 23:59:00 +0000</pubDate>
		<guid isPermaLink="false">http://boingboing.net/?p=212319#comment-1652679</guid>
		<description>It&#039;s a matter of collateral benefit, I think. Calculating a 100 million digit prime would require a breakthrough in computing power, algorithm design or mathematical theory, all of which would most probably find some good wider use. See also: indirect benefits of space race.</description>
		<content:encoded><![CDATA[<p>It&#8217;s a matter of collateral benefit, I think. Calculating a 100 million digit prime would require a breakthrough in computing power, algorithm design or mathematical theory, all of which would most probably find some good wider use. See also: indirect benefits of space race.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Asmodeus</title>
		<link>http://boingboing.net/2013/02/11/another-prime-number-down-inf.html#comment-1652657</link>
		<dc:creator>Asmodeus</dc:creator>
		<pubDate>Mon, 11 Feb 2013 23:38:00 +0000</pubDate>
		<guid isPermaLink="false">http://boingboing.net/?p=212319#comment-1652657</guid>
		<description>Prime numbers are used in cryptography, so the EFF would use that to help with internet privacy.</description>
		<content:encoded><![CDATA[<p>Prime numbers are used in cryptography, so the EFF would use that to help with internet privacy.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Cameron Postelwait</title>
		<link>http://boingboing.net/2013/02/11/another-prime-number-down-inf.html#comment-1652645</link>
		<dc:creator>Cameron Postelwait</dc:creator>
		<pubDate>Mon, 11 Feb 2013 23:21:00 +0000</pubDate>
		<guid isPermaLink="false">http://boingboing.net/?p=212319#comment-1652645</guid>
		<description>spoiler alert: this is the plot to Speed 3! </description>
		<content:encoded><![CDATA[<p>spoiler alert: this is the plot to Speed 3! </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jake0748</title>
		<link>http://boingboing.net/2013/02/11/another-prime-number-down-inf.html#comment-1652641</link>
		<dc:creator>Jake0748</dc:creator>
		<pubDate>Mon, 11 Feb 2013 23:18:00 +0000</pubDate>
		<guid isPermaLink="false">http://boingboing.net/?p=212319#comment-1652641</guid>
		<description>I love the EFF. But what reason could they possibly have for offering money for a new prime number?   Shouldn&#039;t they be using that dough to fight the good copyfight? </description>
		<content:encoded><![CDATA[<p>I love the EFF. But what reason could they possibly have for offering money for a new prime number?   Shouldn&#8217;t they be using that dough to fight the good copyfight? </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark Dow</title>
		<link>http://boingboing.net/2013/02/11/another-prime-number-down-inf.html#comment-1652633</link>
		<dc:creator>Mark Dow</dc:creator>
		<pubDate>Mon, 11 Feb 2013 23:14:00 +0000</pubDate>
		<guid isPermaLink="false">http://boingboing.net/?p=212319#comment-1652633</guid>
		<description>With a measly 18 or 19 digits.

From http://primes.utm.edu/notes/faq/LongestList.html

&quot;Perhaps the longest lists ever calculated (but not all stored) are those corresponding to the maximal prime gap (and twin prime constant) projects.  See Nicely&#039;s lists. At the time I last updated this page, these projects had found (but not stored) all the prime up to 10^18, but not yet to 10^19.&quot;</description>
		<content:encoded><![CDATA[<p>With a measly 18 or 19 digits.</p>
<p>From http://primes.utm.edu/notes/faq/LongestList.html</p>
<p>&#8220;Perhaps the longest lists ever calculated (but not all stored) are those corresponding to the maximal prime gap (and twin prime constant) projects.  See Nicely&#8217;s lists. At the time I last updated this page, these projects had found (but not stored) all the prime up to 10^18, but not yet to 10^19.&#8221;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: awjt</title>
		<link>http://boingboing.net/2013/02/11/another-prime-number-down-inf.html#comment-1652621</link>
		<dc:creator>awjt</dc:creator>
		<pubDate>Mon, 11 Feb 2013 22:51:00 +0000</pubDate>
		<guid isPermaLink="false">http://boingboing.net/?p=212319#comment-1652621</guid>
		<description>New rule:  it should be against the law, and you spend time thinking about it in the Hague, to calculate any large prime without knowing all the primes that come before it.  You cannot skip ahead.</description>
		<content:encoded><![CDATA[<p>New rule:  it should be against the law, and you spend time thinking about it in the Hague, to calculate any large prime without knowing all the primes that come before it.  You cannot skip ahead.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
