My Math Forum Fermat last theorem original proof
 User Name Remember Me? Password

 New Users Post up here and introduce yourself!

 January 7th, 2016, 03:28 AM #11 Newbie     Joined: Jan 2016 From: Srilanka Posts: 7 Thanks: 0 when c [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 03:36 AM.
 January 7th, 2016, 03:37 AM #12 Global Moderator   Joined: Dec 2006 Posts: 20,288 Thanks: 1968 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.
January 7th, 2016, 04:58 PM   #13
Newbie

Joined: Jan 2016
From: Srilanka

Posts: 7
Thanks: 0

Quote:
 Originally Posted by skipjack 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.

 January 7th, 2016, 08:11 PM #14 Global Moderator   Joined: Dec 2006 Posts: 20,288 Thanks: 1968 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.

 Tags fermat, original, proof, theorem

### fermat theorem forum

Click on a term to search for related topics.
 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post MrAwojobi Number Theory 46 August 12th, 2015 07:04 AM MrAwojobi Number Theory 20 June 16th, 2014 09:32 PM MrAwojobi Number Theory 43 July 15th, 2013 07:27 AM jhon13 Algebra 4 May 24th, 2012 09:26 AM gyro Number Theory 7 May 9th, 2012 08:05 AM

 Contact - Home - Forums - Cryptocurrency Forum - Top