Comments on: Beal’s Conjecture Keepin' static like wool fabric since 2006 Wed, 08 Oct 2014 14:33:23 +0000 hourly 1 By: stan lesz Mon, 30 May 2011 17:29:13 +0000 Beal’s m,n,r=>3
??? Flt is solvable in Gaussian numbers.

Summation of [(n+1)^3-n^3]=(c+1)^3
n=0 to c to upper limit.

By: Aubrey de Grey Fri, 28 Nov 2008 22:57:53 +0000 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’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 (<20) seems more interesting – the density of such powers is so much higher than that of high powers that you’d be doing most of your existing search, and you could take the bases up to very large numbers in compensation.