Simple Proof of Fermat's Last Theorem and Beal's Conjecture

[MrAwojobi]

Attached is the proof.

 

[MrAwojobi]

I forgot to mention that n is odd and A and B are not necessarily integers in the transformation. This slight ammendments are in this new attachment.

 

[micromass]

A simple argument shows why A^n + B^n ≠ (P+Q)^n if n is odd.

Please provide this argument. I mean, I can give proofs like this to. You simply leave out the hard part...

Obviously, if n is even, A^n + B^n = C^n collapses to the Pythagorean equation.

I do not see this. Please provide a proof...

 

[MrAwojobi]

I have revamped the proof again so that n is not required to be odd.

 

[ramsey2879]

I have revamped the proof again so that n is not required to be odd.

The statement "it should be clear that since the coefficients referred to previously are set in a particular way for each part, the only way they can equal each other is if C and B and therefore A have a common prime factor" is not proven. It is merely a restatement of Beal's conjecture.

 

[MrAwojobi]

ramsey2879

I have added an extra paragraph to my article and this offers more explanations to my claims.