Title: Fermat's Last Theorem Content: thumb|150px|Pierre de Fermat Fermat's Last Theorem or FLT is a very famous idea in mathematics. It says that: : If n is a whole number larger than 2, then the equation x^n + y^n = z^n has no solutions when x, y and z are natural numbers. Or, : It is impossible to express in whole numbers two cubes, which added equal a third cube. Furthermore, it is impossible with anything higher than squares. This means that there are no examples where x, y and z are natural numbers, i.e. whole numbers larger than zero, and where n is a whole number bigger than 2. Pierre de Fermat wrote about it in 1637 inside his copy of a book called Arithmetica. He said "I have a proof of this theorem, but there is not enough space in this margin". However, no correct proof was found for 357 years. It was finally proven in 1995. Most mathematicians do not think that Fermat, in fact, ever had a margin proof of this theorem. In its original the problem is as follows: Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos & generaliter nullam in infinitum ultra quadratum potestatem in duos eiusdem nominis fas est dividere cuius rei demonstrationem mirabilem sane detexi. Hanc marginis exiguitas non caperet. == Overview == Fermat's Last Theorem is a more general form of the Pythagorean theorem,Stark, pp. 151–155. which is an equation that says: : a^2 + b^2 = c^2 When a, b and c are whole numbers this is called a "Pythagorean triple". For example, 3^2 + 4^2 = 9 + 16 = 25, and since \sqrt[2] = 4.49794144528, and so 3^3 + 4^3 = 4.49794144528^3 is an example that confirms this. ===On the equation's quadratic=== The x and y are two unknown sums, summing imaginary third sum z. Despite there being 4 terms: n, x, y & z, the n is a function summing the total of unknown sums. Zero is missing from this equation by the rule of "1 plus 1 is 2 and no more", written 1+1=2+0. To give clarification, the n is known to be a sum. == Proof == The proof was made for some values of n, such as n = 3, n = 4, n = 5 and n = 7, which was managed by many mathematicians including Fermat, Euler, Sophie Germain. However, since there are an infinite number of Pythagorean triples, as numbers count upwards forever, this made Fermat's Last Theorem hard to prove or disprove; the full proof must show that the equation has no solution for all values of n (when n is a whole number bigger than 2) but it is not possible to simply check every combination of numbers if they continue forever. An English mathematician named Andrew Wiles found a solution in 1995, 358 years after Fermat wrote about it. Richard Taylor helped him find the solution . The proof took eight years of research. He proved the theorem by first proving the modularity theorem, which was then called the TaniyamaShimura conjecture. Using Ribet's Theorem, he was able to give a proof for Fermat's Last Theorem. He received the Wolfskehl Prize from Göttingen Academy in June 1997: it amounted to about $50,000 U.S. dollars.Singh S 1998. Fermat's Enigma, p284. New York: Anchor Books. After a few years of debate, people agreed that Andrew Wiles had solved the problem. Andrew Wiles used a lot of modern mathematics and even created new maths when he made his solution. This mathematics was unknown when Fermat wrote his famous note, so de Fermat could not have used it. This leads one to believe that de Fermat did not in fact have a complete solution of the problem. ===Criticism of proof=== Vos Savant wrote in 1995, that Wiles' proof should be rejected for its use of non-Euclidean geometry. She said, "the chain of proof is based in hyperbolic (Lobachevskian) geometry", and because this geometry allows things like squaring the circle, a "famous impossibility" despite being possible in hyperbolic geometry, then "if we reject a hyperbolic method of squaring the circle, we should also reject a hyperbolic proof of Fermat's last theorem." ===Proof without elliptic=== Where n is known to sum two ordinal values, it cannot exceed the counted value 2 if the larger is taken as 1 unit. ==Generalization== Beal's Generalization Conjecture, or the Beal Conjecture, posed by investor Andrew Beal, asks why there are always common factors (like cells in batteries), in equations like this, of the general form aˣ+bʸ=cᶻ.