Proof for Fermats Last theorem for n=3 (

It is not my intention to repeat what is there in great mathematicians books. I am presenting whatever I understood. If we want to solve any equation, We may solve it using fundamental principles of mathematics. If the equation to be solved is need three equations. (a, b, c are all integers >0), There are three unknowns, we

Thus we have first clue or hint that is all are integers [1] Let us examine three conditions comparing (a + b) and c 1) (a + b)=c => 2) (a + b)<c 3) a+b>c => , then => ( then also then it is possible to have

That means we have second clue as a+b > c a > (c-b) --- [2]

--- [3] That means square of a should have c-b and c+b as its factors, I will concentrate on (c-b) because from the first principles we can see that if to be true, then since ) ===[3] We have fourth clue that number 1 is common factor to all, so it is natural to examine with the condition c-b=1 then [3] can be reduced to , that means

Since a>(c-b)=1 from [2] , we check with the first odd number greater than 1 that is 3 If a = 3, then Bingo. We have hit first Pythagorean triplet (3,4,5) and we extend it to every odd number a=5,7,9 and we find infinite basic pythagorean triplets

Extending the above rules to higher powers n=3

Let us still keep (c-b) as 1 and we check for any combination that satisfies =[5] Since b*(b+1 ) is the product of consecutive integers is even number -- [6] From [5] and [6] b(b+1)=(a-1)( since b(b+1) is an even integer either (a-1) should be multiple of 3 or is 3 multiple [7] We have two conditions that a-1 is multiple of 3 that is (a-1)=3*n (n is another integer) and a-1 is even (since a is odd) (a-1)=2m=3n If 2m=3n, m should be multiple of 3 and n is even let us take m=3r and n=2r That means a-1=6r (where r is an integer) a is of the form 6r+1 (that satisfies both the conditions that a-1 is even and also multiple of 3) Substituting a=6r+1 in [7] b*(b+1)=(6r+1-1)( =2r( =2r(

b(b+1)=6r( ) , as you can see that 6r and dont have common factor , so b(b+1) cant be of the form of 6r( From [7] If

are co-prime , that means they

a is odd number of the form 2m+1a(a+1) is evena(a+1)+1 is odd P is also odd number.

p=

If P needs to be an integer

shoule be multiple of 3 that means m is multiple of 3 let us say 3r

a is of the form 2m+1 that means 6r+1 also results to the conclusion that a is also of the form 6r+1

we have already proven that for a=6r+1 we cant have integer solutions for

That means we cant have integer solutions for =============================================== Let us check if (c-b)==2 any integer solutions for

if (c-b) = 1

for

(c-b)==2 that means c and b both are either even or odd. If all a,b,c are even the equation will be reduced to at least one of a,b,c is odd. So let us take c and b are odd that means and a is even a=2m, b=2n+1 and c=2n+3

Since

That means we cant have integer solutions for m , so also a Hence we cant find any integer solutions for if (c-b)=2 =============================================== Let us check if the difference is d >2 that means (c-b)=d From [3] Since From [2] we have a>(c-b) That means a should have (c-b) as its factor. That means a=(c-b) *p where p is another integer[8] So

From the fundamental principle of Mathematics if b is not divisible by d so also b+d Since its factor So [9] We have proven that from *8+ a also is multiple of (c-b) If that means C also is multiple of (c-b) and if (c-b) >2 we can divide whole equation by (c-b) . We can reduce the equation until (c-b)=1 is an integer is also integer , it follows that b should have d as

We have already proven that if (c-b)=1 no integer solution exists for

EUREKA we have proven that if n=3 we cant have integer solutions for