<?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: Perfect numbers, interlude (Challenge #11)</title>
	<atom:link href="http://www.mathlesstraveled.com//?feed=rss2&#038;p=90" rel="self" type="application/rss+xml" />
	<link>http://www.mathlesstraveled.com/?p=90</link>
	<description>Explorations in mathematical beauty</description>
	<lastBuildDate>Wed, 08 Sep 2010 14:28:08 -0400</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.1</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Carnival of Mathematics #21: Bar-hopping at last &#171; Secret Blogging Seminar</title>
		<link>http://www.mathlesstraveled.com/?p=90&#038;cpage=1#comment-9823</link>
		<dc:creator>Carnival of Mathematics #21: Bar-hopping at last &#171; Secret Blogging Seminar</dc:creator>
		<pubDate>Thu, 06 Dec 2007 05:39:45 +0000</pubDate>
		<guid isPermaLink="false">http://www.mathlesstraveled.com/?p=90#comment-9823</guid>
		<description>[...] Less Travelled does a 4-part post on Perfect numbers, part I (and part II and part III, with a challenge in between). It&#8217;s a pretty elementary subject, but one that people have been unable unlock [...]</description>
		<content:encoded><![CDATA[<p>[...] Less Travelled does a 4-part post on Perfect numbers, part I (and part II and part III, with a challenge in between). It&#8217;s a pretty elementary subject, but one that people have been unable unlock [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Brent</title>
		<link>http://www.mathlesstraveled.com/?p=90&#038;cpage=1#comment-9642</link>
		<dc:creator>Brent</dc:creator>
		<pubDate>Tue, 27 Nov 2007 17:30:30 +0000</pubDate>
		<guid isPermaLink="false">http://www.mathlesstraveled.com/?p=90#comment-9642</guid>
		<description>DB: right.  As it turns out, n does have to be prime, but that&#039;s not a sufficient condition.

Steve: It is a nice way to pass the time, indeed. =)  I don&#039;t think 9 works, though.  2^8 * 511 = 130816, the sum of the proper divisors of which is 171696, not 130816.  That&#039;s because 511 is not prime; 2^(3*3) - 1 = (2^3 - 1)(2^6 + 2^3 + 1) = 7 * 73.</description>
		<content:encoded><![CDATA[<p>DB: right.  As it turns out, n does have to be prime, but that&#8217;s not a sufficient condition.</p>
<p>Steve: It is a nice way to pass the time, indeed. =)  I don&#8217;t think 9 works, though.  2^8 * 511 = 130816, the sum of the proper divisors of which is 171696, not 130816.  That&#8217;s because 511 is not prime; 2^(3*3) &#8211; 1 = (2^3 &#8211; 1)(2^6 + 2^3 + 1) = 7 * 73.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve Gilberg</title>
		<link>http://www.mathlesstraveled.com/?p=90&#038;cpage=1#comment-9638</link>
		<dc:creator>Steve Gilberg</dc:creator>
		<pubDate>Tue, 27 Nov 2007 16:21:04 +0000</pubDate>
		<guid isPermaLink="false">http://www.mathlesstraveled.com/?p=90#comment-9638</guid>
		<description>I figured out the same thing as DB while I was on Thanksgiving break and away from the computer. Nice way to pass the time.

But it is not required that n be prime. I&#039;m pretty sure that it works when n is 9.</description>
		<content:encoded><![CDATA[<p>I figured out the same thing as DB while I was on Thanksgiving break and away from the computer. Nice way to pass the time.</p>
<p>But it is not required that n be prime. I&#8217;m pretty sure that it works when n is 9.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: DB</title>
		<link>http://www.mathlesstraveled.com/?p=90&#038;cpage=1#comment-9564</link>
		<dc:creator>DB</dc:creator>
		<pubDate>Fri, 23 Nov 2007 21:37:16 +0000</pubDate>
		<guid isPermaLink="false">http://www.mathlesstraveled.com/?p=90#comment-9564</guid>
		<description>So far, these perfect numbers are of the form 2^(n-1) * (2^n - 1), but only when (2^n - 1) is prime.  Works for n=2, 3, 5, and 7, so maybe n itself should be prime?</description>
		<content:encoded><![CDATA[<p>So far, these perfect numbers are of the form 2^(n-1) * (2^n &#8211; 1), but only when (2^n &#8211; 1) is prime.  Works for n=2, 3, 5, and 7, so maybe n itself should be prime?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
