“Disprove” Fermat's Last Theorem Write a program, in the language of your choice, that appears to successfully find a counterexample to Fermat's Last Theorem.  That is, find integers a, b, c > 0 and n > 2 such that an + bn = cn.

Of course, you can't really do it, unless there's a flaw in Andrew Wiles' proof.  I mean fake it, by relying on


integer overflow
floating-point rounding error
undefined behavior
data types with unusual definitions of addition, exponentiation, or equality
compiler/interpreter bugs
or something along those lines.


You may hard-code some or all of the variables a, b, c, or n, or search for them by doing loops like for a = 1 to MAX.

This isn't a code golf; it's a contest to find clever and subtle solutions.
J

Actually, Fermat did make quite a blunder: It's actually wrong for any b, c or n if a is 1:

   1^3 + 4^3 = 5^3
1
   1^4 + 5^4 = 11^4
1
   1^9 + 3^9 = 42^9
1



   Maybe just maybe, Fermat's precedence rules weren't strictly right to left.