We all know of this theorem which was finally proved in the 1960's. It says that we cannot find any real integral solution for(adsbygoogle = window.adsbygoogle || []).push({}); n>2when an integer is expressed to a power of 'n' and is equal to the sum of two numbers which individually are raised to the power 'n'.

x^n=a^n+b^n

Well for n=2, we are familiar with the pythagorean(3,4,5 etc.) combinations, but there is indeed is no solution when n>2...check it out.

I recently ran a program to find this solution, but couldn't find for n=3,4,5... This certainly validates the theorem but how do we prove it mathematically?

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Fermat's Last theorem

Loading...

Similar Threads - Fermat's Last theorem | Date |
---|---|

Question on Fermat's Last Theorem | Aug 17, 2012 |

Is this a short, marvelous proof of Fermat's Last Theorem? | Jul 21, 2012 |

Does the elegant proof to the Fermats last theorem exists? | Jul 3, 2012 |

So is chike obo proof of fermat's last theorem | Apr 22, 2012 |

Fermat's last theorem | Feb 28, 2012 |

**Physics Forums - The Fusion of Science and Community**