Breaking Fermat (Part 1 of 3)

The year was 1995 when Andrew Wiles claimed to have proved the famous Fermat's Last Theorem (FLT, not to be confused with FML), and hence claiming the Abel Prize, a good amount approaching $1,000,000 bucks. FLT was for nearly 400 years an unattainable journey in mathematics. Many tried to prove it. All failed. Wiles claims to be the one to have solved it. More on this later...

FLT is a very easy problem to explain, and that's why it became so famous (unlike mysterious problems such as Riemman Hypothesis which is impossible to understand even what the problem is about). Here is what FLT is:

"The equation X^N + Y^N = Z^N has no non-trivial integer solutions for N > 2"

Non-trivial just means that we're ignoring any "zero" solutions (that is, solutions such that X*Y*Z = 0). It is straightforward to find solutions for smaller Ns, such as N=2: 5^2 + 12^2 = 13^2. But for N greater than 2, no one has ever been able to find a solution. Until now!

I think mathematicians expected FLT to be true from the beginning, but they've always deep inside hoped for it to be false, that is, for someone to find a solution to that equation for N > 2. Wiles spent 7 years and came up with a 200-pages long proof showing that Fermat was right: there is no solution for that equation with N > 2. Or so he thought...

I'm glad to inform the world that FLT has been broken, and a solution for that equation with N > 2 does exist! I've found that solution. Sit down, take a deep breathe, this is historical. Here it goes:


I understand that this might be received with enormous skepticism, so sure let's do few things. First, bring your favorite calculator on your phone, type the first part of the equation (7965^32 + 9516^32) and hit enter, see if you get this:


Now try the second half (9517^32), and voila, the same result. Still skeptical, right? Not a problem, let's try the Google guys, first the first half:


Now the second one:


Still skeptical? Sure, why don't we try a better search engine, one that shows many more of the digits in the result - how about Bing? One more time, try the first half:


Now, the second one:


No matter where you look at, the results match like a charm. For all these years all attempts were unsuccessful for a reason: FLT is not true! And unfortunately and sadly for Wiles, but happily for me, I should be the one receiving the $1,000,000 prize.

I won't spend it wisely, though. I'll start by buying a big-ass Lambo Aventador and down the pipe goes 1/2 of my prize. The other half will be used for extravagant, luxurious and superfluous parties and vacations.

I have found a truly marvelous algorithm to produce the solutions to FLT, unfortunately Forensic Files is about to start and I have to go.

Comments

  1. haha, this would have been a great 1st April post :)
    http://www.wolframalpha.com/input/?i=7965**32+%2B+9516**32+%3D%3D+9517**32

    ReplyDelete

Post a Comment

Popular posts from this blog

Changing the root of a binary tree

ProjectEuler Problem 719 (some hints, but no spoilers)

The Power Sum, a recursive problem by HackerRank