Re: Fermat's Last theorem short proof

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),

or simply that proves FLT and some other unsolved problems if you can see, but unfortunately I don't have much time to show you the little dirty and silly work (the proofs), but it is still too easy to prove the above theorem, isn’t it?

Good Luck

Regards

بسام غرزالدين

Bassam Karzeddin
Al Hussein bin Talal University
JORDAN
.

Relevant Pages
Loading