Wednesday, August 19, 2009

Fermat's Last Theorem

Dear All

In the margin of his copy of a book by Diophantus, Pierre de Fermat wrote that it is possible to have a square be the sum of two squares, but that a cube can not be the sum of two cubes, nor a fourth power be a sum of two fourth powers, and so on. Further, he wrote that he had found a truly marvelous proof which the margin was too small to contain.

Fermat's Last Theorem states that xn + yn = zn has no non-zero integer solutions for x, y and z when n > 2.

That is to say, there are no integers x, y, z such that x3 + y3 = z3 or integers x, y, z such that x7 + y7 = z7.

Although this is easily stated, it has proved to be one of the most puzzling problems in the whole history of mathematics. Long after all the other statements made by Fermat had been either proved or disproved, this remained; hence it is called Fermat's Last Theorem (actually, Conjecture would be more accurate than Theorem).

This conjecture was worked on by many famous mathematicians. Fermat himself proved this theorem for n = 4, and Leonhard Euler did n = 3. Special cases were dispatched one after another. New theories were developed to attack the problem, but all attempts at a general proof failed. They failed, that is, until this decade, when, building on work of many famous mathematicians, Prof. Andrew Wiles of Princeton University finally proved it in 1996. His method could not have been known to Fermat. Fermat's "truly marvelous proof" is now believed to have been faulty.

The actual proof is very indirect, and involves two branches of mathematics which at face value appear to have nothing to do either with each other or with Fermat's theorem. The two subjects are elliptic curves and modular forms and involve work done previously by Taniyama and Shimura. The greatest difficulty was in proving that the Taniyama-Shimura conjecture was true. This is the contribution made by Andrew Wiles, and the final stage in establishing Fermat's Last theorem.

To know more, click here.

1 comment:

  1. was that proof done with taking every integers for "n" one by one ?? is dat the only way ??



Dear all, Please do watch my latest video (dated 10-01-2021) on the topic “NUMBER OF TRAILING ZEROES IN A PRODUCT (PART -2)” VIDEO LINK HERE...