Authors: Gang Li
We discuss an elementary approach to prove the first case of Fermat's last theorem (FLT). The essence of the proof is to notice that $a+b+c$ is of order $N^{\alpha}$ if $a^N+b^N+c^N=0$. To prove FLT, we first show that $\alpha$ can not be $2$; we then show that $\alpha$ can not be $3$, etc. While this is is the standard method of induction, we refer to it here as the ``infinite ascent'' technique, in contrast to Fermat's original ``infinite descent'' technique. A conjecture, first noted by Ribenboim is used.
Comments: 13 Pages. Submitted to JNT. This is an improved version of the paper posted at http://vixra.org/abs/1706.0288
Download: PDF
[v1] 2018-05-09 19:09:09
Unique-IP document downloads: 74 times
Vixra.org 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. Vixra.org 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.