Fermat's Last theorem short proof
in [Math]
|
From: essam abd allah on 19 Apr 2007 10:37 i have really found a simple proof of Fermat's Last Theorem how can i announce this solution ? and what is the amount of prizes on this proof ??? and where can i send that proof ??can you help me ??
From: Denis Feldmann on 19 Apr 2007 14:51 essam abd allah a écrit : > i have really found a simple proof of Fermat's Last Theorem > how can i announce this solution ? You just did > and what is the amount of prizes on this proof ??? exactly 0 (Hint: a guy named Wiles already collected) and where can i send that proof ?? I could name places, but this would not be very polite can you help me ?? Probably not. See a good psy.
From: quasi on 19 Apr 2007 16:01 On Thu, 19 Apr 2007 14:37:09 EDT, essam abd allah <fmgret12(a)yahoo.com> wrote: >i have really found a simple proof of Fermat's Last Theorem >how can i announce this solution ? > and what is the amount of prizes on this proof ??? and where can i send that proof ??can you help me ?? There is no longer any prize -- the problem has already been solved by Wiles & Taylor. As far as what you should do with a simple proof, I think you should post it here in sci.math, but include your real name in the message, so if it's correct, you will still get credit. If it's not correct, and you should _assume_ it's probably not correct based on history and common sense, the responses may help you see where you went wrong. quasi
From: Rick Decker on 19 Apr 2007 17:17 bassam king karzeddin wrote: > Dear All > > As a generalization to one of my posts in this thread > > > Given, two distinct, coprime non zero integers > (x & y), > > Theorem- (new or old, I don't care), precisely I don't know > > If, (n & m) are two positive integers, where > > m = gcd ((x+y), n), > > then this implies the following theorem: > > Gcd ((x+y), (x^n+y^n)/(x+y)) = Rad (m), > > Where Rad (m) equals the product of all the prime factors of (m), that is to say > Rad (m) is square free number that divides (x^n+y^n), Oh? Perhaps you need another condition, since x = 15 and y = 49 are coprime and if we pick n = 8 then m = gcd(x+y, n) = gcd(64, 8) = 8 but 15^8 + 49^8 = (16617746730113)(2) which isn't even divisible by x+y. Regards, Rick
From: bassam king karzeddin on 19 Apr 2007 14:46
> i have really found a simple proof of Fermat's Last > Theorem > how can i announce this solution ? > and what is the amount of prizes on this proof ??? > ? and where can i send that proof ??can you help me ?? Hello Essam I really wish to help you, but I can't help my self either, I also may believe you because I guess tomorrow FLT proof would be football audience's big joke It seems to me that announcing the proof here only should work perfectly (if it is true), but I'm afraid because the majority who are fake mathematicians will feel insulted, and the Journals would close up their doors, (In fact they must because their reasons of existence are almost vanished, and new rules must arise to make it the easy way and tragedy less for the true genius), So your assumed valid proof will be stolen by a very long tongue mathematician in power (even you send it for them, since this is not a silly issue, and unfortunately there is no other planet),- OR will be neglected and postponed at least for a century, because mathematicians love to talk about the gone people, despite neglecting them in their life time-see for example FERMAT – TRAGEDIOUS story Good Luck B.Karzeddin |