Entradas

Mostrando las entradas etiquetadas como A simple solution

Something I didn't think of.

Imagen
  I’m sorry.   There is something I didn’t think of some days ago, while I was looking for a simple solution to Fermat’s statement. I had just proved ( you can click here to see it ) that any triangle that has sides a, b, c the length of positive integers satisfies Fermat’s statement ( aⁿ ≠ bⁿ + cⁿ for any positive integer value of n > 2 ).   And I thought that was it… A mistake.   I mean, my proof was solid and sound; but I hadn’t finished yet.   Why? All triangles verify that each of its three sides is smaller than the sum (addition) of the other two. Let’s forget triangles from this point on. If we have three positive integers a, b, c …   One of them could be equal to the sum of the other two as in a = (b + c) . One of them could be bigger than the sum of the other two as in a > (b + c) . I need to prove that those two possibilities actually satisfy Fermat’s statement in order to have a complete, simple solution. And that’s what...

A simple solution.

Imagen
                   French mathematician Pierre de Fermat wrote a statement around 1.637 A.D. that said “...no three positive integers a, b and c satisfy the equation a ⁿ + b ⁿ = c ⁿ for any integer value of n greater than 2” .          The exceptions are the trivial solutions (0, 1, 1) , (1, 0, 1) and (0, 0, 0) , of course.    The cases n=1 and n=2 have been known since antiquity to have infinitely many solutions (Wikipedia dixit).          Fermat didn’t write proof of his statement because, apparently, there was not enough blank space left in the page to do it .   Wait, what?          In 1995 (more than 350 years later) mathematician Andrew Wiles (with the help of his colleague Richard Taylor) proved Fermat’s statement in a published article…   The first complete, valid proof of that sta...