Re: Fermat's Last theorem short proof

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

But, still Rad(m) divides (x^n +y^n), Doesn't it?

Regards
B.Karzeddin
.

Relevant Pages

  • Re: Fermats Last theorem short proof
    ... As a generalization to one of my posts in this ... Given, two distinct, coprime non zero integers ...
    (sci.math)
  • Re: Fermats Last theorem short proof
    ... As a generalization to one of my posts in this ... Given, two distinct, coprime non zero integers ...
    (sci.math)
  • Re: Fermats Last theorem short proof
    ... As a generalization to one of my posts in this ... Given, two distinct, coprime non zero integers ... If, are two positive integers, where ...
    (sci.math)
  • Re: Fermats Last theorem short proof
    ... As a generalization to one of my posts in this thread ... Given, two distinct, coprime non zero integers ... Where Rad equals the product of all the prime factors of, ...
    (sci.math)
  • Re: Fermats Last theorem short proof
    ... As a generalization to one of my posts in this thread ... Given, two distinct, coprime non zero integers ... Where Rad equals the product of all the prime factors of, ...
    (sci.math)
Loading