Number Theory


Fermat's Proof of Fermat's Last Theorem

Authors: Johnny E Magee

Focusing on the properties and constraints of the decompositions of Fermat’s equation and its elements --and employing only basic arithmetic and algebraic techniques that would have been known to Fermat-- we identify certain specific requirements necessary for c, of (an + bn) = cn, to be an integer, and establish that these requirements can only be met at n = 2. AMS Subject Classification (2010): Primary, 11D41 Key words and phrases: Fermat’s Last Theorem, Fermat’s Equation, Binomial Theorem

Comments: 18 Pages.

Download: PDF

Submission history

[v1] 2017-09-27 19:45:24

Unique-IP document downloads: 83 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus