My Math Forum  

Go Back   My Math Forum > Welcome > New Users

New Users Post up here and introduce yourself!


Reply
 
LinkBack Thread Tools Display Modes
January 7th, 2016, 02:28 AM   #11
Newbie
 
gishan's Avatar
 
Joined: Jan 2016
From: Srilanka

Posts: 7
Thanks: 0

when c<a+b then c^n < [a+b]^n considering a,b,c are positive integers and n is a integer. I remind you Fermat also select same numbers. Because when a,b,c are not integers and n is not a not a integer, then It may c^n > [a+b]^n, That is why Fermat selected integers only. Then there is a indication come, Fermat also had followed my method.

Last edited by gishan; January 7th, 2016 at 02:36 AM.
gishan is offline  
 
January 7th, 2016, 02:37 AM   #12
Global Moderator
 
Joined: Dec 2006

Posts: 19,505
Thanks: 1740

That also holds for positive a, b and c that are not all integers, so you are not relying on a, b and c all being integers.
skipjack is offline  
January 7th, 2016, 03:58 PM   #13
Newbie
 
gishan's Avatar
 
Joined: Jan 2016
From: Srilanka

Posts: 7
Thanks: 0

Quote:
Originally Posted by skipjack View Post
The values I gave for a, b and c satisfy a^4 + b^4 = c^4 and the inequalities quoted. They don't satisfy the equation that you claimed is a consequence of those inequalities.

FLT (by its definition) requires consideration of values of n greater than 2. What you are aiming to prove is that a^n + b^n = c^n cannot be satisfied by positive integers with n > 2, so you need to allow n > 2 and reach a contradiction, which is what you purport to have done.

However, your method never relies on a, b and c being integers, so its logic is incorrect as a^4 + b^4 = c^4 is easily satisfied if a, b and c needn't all be positive integers.
I am the Author of above proof. My name is G.L.W.A Jayathilaka. Address----Guruwattha walawwa, Meetiyagoda, Srilanka. ALTHOUGH I PRODUCE THE PROOF, STILL I HAVE A SECRET WHICH IS NOT EXPOSED. FERMAT AND I KNOW THAT SECRET ONLY. IF I WILL GET A OPPORTUNITY TO PROVE IT IN OPEN MEETING , I WILL PROVE THAT SECRET. THAT IS FOR a,b,c when n>2 there is no positive integers . FERMAT KNOW THAT SECRET PROOF. I ALSO KNOW THAT REMAIN SECRET PROOF.
gishan is offline  
January 7th, 2016, 07:11 PM   #14
Global Moderator
 
Joined: Dec 2006

Posts: 19,505
Thanks: 1740

As Fermat is no longer alive, he doesn't know anything now, and we can't ever know for certain what ideas he had but left undisclosed. A purported proof that contains a mathematically invalid step is, by definition, not a valid proof, and the same applies to any currently secret purported proof that uses that same invalid step.
skipjack is offline  
Reply

  My Math Forum > Welcome > New Users

Tags
fermat, original, proof, theorem



Search tags for this page
Click on a term to search for related topics.
Thread Tools
Display Modes


Similar Threads
Thread Thread Starter Forum Replies Last Post
Simpler proof of fermat's last theorem MrAwojobi Number Theory 46 August 12th, 2015 06:04 AM
Fermat's last theorem proof MrAwojobi Number Theory 20 June 16th, 2014 08:32 PM
SIMPLEST PROOF OF FERMAT'S LAST THEOREM MrAwojobi Number Theory 43 July 15th, 2013 06:27 AM
6 Step Fermat's Last Theorem Proof jhon13 Algebra 4 May 24th, 2012 08:26 AM
6 Step Fermat's Last Theorem Proof gyro Number Theory 7 May 9th, 2012 07:05 AM





Copyright © 2018 My Math Forum. All rights reserved.