## Fermat's Last theorem

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 n>2 when 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?

 PhysOrg.com science news on PhysOrg.com >> Front-row seats to climate change>> Attacking MRSA with metals from antibacterial clays>> New formula invented for microscope viewing, substitutes for federally controlled drug
 Mentor I thought it was proved in the '90s?
 Recognitions: Homework Help Science Advisor Either try all infinite 'n' - might take a while (actually only need to test all the infinite number of prime n's) or learn an awful lot of seriously complicated number theory about elliptic curves and some conjecture that I can't even spell as Andrew Wiles did. There isn't a proof understandable by mere mortals.

## Fermat's Last theorem

Yes, thats a mistake, it was done so in the 90's but that's apart from the point...

 Recognitions: Homework Help Science Advisor There is a good book by Simon Singh, but since it is pretty impossible to even outline the numerical techniques to someone without grad school maths it mainly concentrates on the stories of the people involved. It would be interesting to know what Fermat's original proof was and where he went wrong!
 Recognitions: Gold Member Science Advisor Staff Emeritus There was no original proof. After he wrote his comment in the margin of a book, he gave completely different proofs for n= 3 and n= 4. He wouldn't have done that if he had a proof for all n. What happened to Fermat is what happens to mathematicians all the time- he saw a way of extending result he already had and wrote that "marginal" comment. Later he realized it didn't extend as he thought.
 Also known as the Taniyama–Shimura conjecture. Don't even bother starting unless you already know what elliptic curves and modular functions have to do with each other. (I don't. Not a clue.)
 Recognitions: Gold Member Science Advisor Staff Emeritus I wouldn't say it is "also known as". Yes, Wiles proved the Taniyama-Shimura conjecture. It has already been proven that Fermat's last theorem was true if and only if theTaniyama-Shimura conjecture was true.
 The German mathematician Frey announced that he believes that Fermat's equation, if false, will imply that the Taniyami-Shimura Conjeture to be false. This became known as the Eplison Conjecture. Soon the mathematician Kenneth Ribet actually prove this idea in detail. Wiles immediately realized that all he needs to do know if prove the Taniyami-Shimura Conjecture. In the old days, Fermat's problem was attacked by Kummer Ideal Complex numbers. But this does not work succesfully. There is a book (I forgot the name) which teaches algebraic number theory while simultaneously working with Fermat's equation in a classical approach.

 Quote by ron_jay 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?
How did you "run a program" to check for all n= 3, 4, 5?

Recognitions:
Homework Help
 Quote by HallsofIvy I wouldn't say it is "also known as". Yes, Wiles proved the Taniyama-Shimura conjecture. It has already been proven that Fermat's last theorem was true if and only if the Taniyama-Shimura conjecture was true.
I thought Taniyama-Shimura was stronger than Fermat's last theorem -- that Wiles proved special case of T-S first, enough to prove Fermat's last theorem, and later (with several others) proved the whole Taniyama-Shimura conjecture. Am I confusing this with something else?

It was bit of an accident that I stumbled upon Fermat's Last Theorem. I was originally coding a program to find the smallest number, which when squared, can be expressed as the sum of two different sets of individually squared numbers, which is:

65 = 1^2+8^2 = 4^2+7^2

in terms of three three numbers, you have:

325 = 1^2+18^2 = 10^2+15^2 = 6^2+17^2

in terms of four numbers, you have:

1105 = 23^2+24^2 = 4^2+33^2 = 9^2+32^2 = 12^2+31^2

This list goes on...but what I tried to do next is replace the power of n=2 with n=3 or greater integral values. What I encountered is that the program kept looping till infinity i.e. the program never terminated for the first set of two numbers cubed individually(a^3+b^n=c^n);this led me to doubt the program. I checked the program but found no errors. So I concluded that there was no solution for a power greater than 2. I incidentally also came across Fermat's last theorem.So my conclusion was indeed justified.

 How did you "run a program" to check for all n= 3, 4, 5?
Well, here is a program in c++ for reference:

Code:
#include <iostream.h>
#include <conio.h>
#include <math.h>

int main()
{
long n=1,i,j,flag,s,k;  //initializing
long p=3;               //replace 'p' to check for any other power

while(1)                //loop till infinity
{
flag=0;k=pow(n,p);

for(i=1;pow(i,p)<k;i++)         //looping first number
{
for(j=i+1;pow(i,p)+pow(j,p)<=k;j++) //looping second number
{
s=pow(i,p)+pow(j,p);
if(s==k){flag++;}
if(flag==2){break;}           //break out of loop if found
}
if(flag==2){break;}
}
if(flag==2){cout<<n;break;}  //print number if found and the program terminates
n++;
}
return 0;
}
Replace 'p' for power of the expression, and you will find that for p=2, answer is 25 which rightly is the smallest pythagorean triplet; but for n>2 and n having an integral value, the program doesn't terminate i.e there is no solution.

Recognitions:
Homework Help
 Quote by ron_jay the program doesn't terminate i.e there is no solution.
Have you it for an infinite time yet?

To prove all odd numbers greater than 2 are prime numbers :
Mathematician: 3 is prime number, 5 is prime number, 7 is prime number, by induction, all odd numbers greater than 2 are prime numbers
Physicist: 3 is prime number, 5 is prime number, 7 is prime number, 9 is experiment error, 11 is prime number,......
Engineer : 3 is prime number, 5 is prime number, 7 is prime number, 9 is prime number, 11 is prime number,......
Computer Programmer: 3 is prime number, 5 is prime number, 7 is prime number, 7 is prime number, 7 is prime number,......
Statistician: Let us try some random numbers: 17 is prime number, 23 is prime number, 11 is prime number,......

 ha...Alrighty. Agreed that the program will not run for an infinite time but if there was a solution to it, the program would have given it in a relatively short period of time.Wouldn't it? So you could conjecture that the equation is unlikely to have a solution.
 Recognitions: Homework Help Science Advisor No. You cannot say that. The behaviour for a small, finite time, is no indicator of the over all behaviour.

 No. You cannot say that. The behaviour for a small, finite time, is no indicator of the over all behaviour.
I don't mean to say that it is universally true that for a small behaviour, the overall behaviour is truly indicated. It was only in my case that the unavailability of the solution by the program for a small time led me to faintly suspect that there might be something peculiar about the solution. It was a thought pertaining only to the situation and was not a generalisation of sorts for all other mathematical concepts.

So what exactly is the Taniyama-Shimura conjecture?