<?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: Beal&#8217;s Conjecture</title>
	<atom:link href="http://www.danvk.org/wp/2007-05-24/beals-conjecture/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.danvk.org/wp/2007-05-24/beals-conjecture/</link>
	<description>Keepin' static like wool fabric since 2006</description>
	<lastBuildDate>Sun, 05 Feb 2012 04:54:46 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: stan lesz</title>
		<link>http://www.danvk.org/wp/2007-05-24/beals-conjecture/comment-page-1/#comment-83437</link>
		<dc:creator>stan lesz</dc:creator>
		<pubDate>Mon, 30 May 2011 17:29:13 +0000</pubDate>
		<guid isPermaLink="false">http://www.danvk.org/wp/?p=158#comment-83437</guid>
		<description>Beal&#039;s m,n,r=&gt;3
3^8-18^3=3^6
3^14-162^3=3^12
104^3-91^3=13^5
1352^3-1183^3=13^8
??? Flt is solvable in Gaussian numbers.
(a+√b)^3-(-a+√b)3=c^3
(3+√93)^3-(-3+√93)^3=12^3

Summation of [(n+1)^3-n^3]=(c+1)^3
n=0 to c to upper limit.</description>
		<content:encoded><![CDATA[<p>Beal&#8217;s m,n,r=&gt;3<br />
3^8-18^3=3^6<br />
3^14-162^3=3^12<br />
104^3-91^3=13^5<br />
1352^3-1183^3=13^8<br />
??? Flt is solvable in Gaussian numbers.<br />
(a+√b)^3-(-a+√b)3=c^3<br />
(3+√93)^3-(-3+√93)^3=12^3</p>
<p>Summation of [(n+1)^3-n^3]=(c+1)^3<br />
n=0 to c to upper limit.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Aubrey de Grey</title>
		<link>http://www.danvk.org/wp/2007-05-24/beals-conjecture/comment-page-1/#comment-15004</link>
		<dc:creator>Aubrey de Grey</dc:creator>
		<pubDate>Fri, 28 Nov 2008 22:57:53 +0000</pubDate>
		<guid isPermaLink="false">http://www.danvk.org/wp/?p=158#comment-15004</guid>
		<description>Dan - have you considered adapting your program to seek additional solutions to the weaker problem where one of the exponents can be 2 but the sun of their reciprocals must be less than 1? The known solutions are intriguingly distributed: apart from the semi-trivial solution 1+8=9, there are just four solutions to this in which z^r is under 15,000 and then five more where it is between 10^11 and 10^15. No others are known, but only very weak partial non-existence results have been proved (the strongest being that there are only finitely many solutions for any particular mnr triplet), and I&#039;m not sure that any search has gone very high.

Regarding the Beal conjecture itself, a search in which the exponents are all kept really low (&lt;20) seems more interesting - the density of such powers is so much higher than that of high powers that you&#039;d be doing most of your existing search, and you could take the bases up to very large numbers in compensation.</description>
		<content:encoded><![CDATA[<p>Dan &#8211; have you considered adapting your program to seek additional solutions to the weaker problem where one of the exponents can be 2 but the sun of their reciprocals must be less than 1? The known solutions are intriguingly distributed: apart from the semi-trivial solution 1+8=9, there are just four solutions to this in which z^r is under 15,000 and then five more where it is between 10^11 and 10^15. No others are known, but only very weak partial non-existence results have been proved (the strongest being that there are only finitely many solutions for any particular mnr triplet), and I&#8217;m not sure that any search has gone very high.</p>
<p>Regarding the Beal conjecture itself, a search in which the exponents are all kept really low (&lt;20) seems more interesting &#8211; the density of such powers is so much higher than that of high powers that you&#8217;d be doing most of your existing search, and you could take the bases up to very large numbers in compensation.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

