Re: Nice.
Fermat's Last Theorem required a and b (and therefore c) to be positive integers greater than zero, and n to be greater than two.
I realised some years ago that the general theorem which states that the following has no solution:
a^n + b^n = c^n
can be simplified to the following true algorithm:
(a-1)^n + a^n < (a+1)^n
for all n greater than two.
Which I would assume (I'm no mathematician) is easier to prove in a mathematical sense than the original theorem. Which would then also prove Fermat.
(I like to think this is the simple proof Fermat alluded to in his infamous margin, but I guess we'll never know.)
Biting the hand that feeds IT
