Re: Fermat's Last theorem short proof

Dear All

Did you really think about Little Fermat's theorem?

A^p = p*B +C, as a hint - assuming (C=0), then you get

A^P= P* B,
where
A = x+y+z
B = (x+y)*(x+z)*(y+z)*N (x, y, z)
C = x^p + y^p + z^p

And (x, y, z) are three (non-zero), distinct coprime integers

Now, you can see it, clearly, WHY (A^p = p*B), does not have any solution

So , Fermat had shown us the part (C) of his eqn. and kept hidden A & B the complete picture of his original little theorem, may be for a reason, because once others see it, then immediately all his work is vain, and may be he was waiting them to admit his talent in open and ask him , but again they won't because it is a matter of dignity and they have never learnt yet, that Mathematics is mainly by BIRTH

Of course, he knew that

A^P = C Mod p , and
C = A Mod p

Then he asked himself the following question, as an argument to complete the picture, is it true that holds in any case if (p (is or is not) a prime factor of A, then

A^P = (A Mod p) Mod p must hold

Which of course can not hold in both cases, and I hoop the proof is complete now, but the Question is open now, will you accept it , especially it is free of cost and not from JOURNALS

Can You Dare to say the TRUTH , AND THAT IS A COURAGE,

I have already tried Journals many years back, before, but not in this issue because I never heard about it (FLT), before I started posting here in 2004,

, and it seems that will not work, they may be looking to the longest ever proof found in order to make more money


My Regards

Bassam.Karzeddin
Al-Hussein Bin Talal University
JORDAN
.

Relevant Pages
Quantcast