Number Theory


The Last Theorem of Fermat. the Simplest Proof

Authors: Victor Sorokine

All calculations are done with numbers in base n, a prime number greater than 2. If in the Fermat equality A^n+B^n-C^n=0, the number U=A+B-C=un^k ends by k zeroes and the factor u is not ending by digit 1, after discarding k-digit endings in the numbers A, B, C, the Fermat equality turns into an inequality, which is NOT transformed back into an equality after the restoration of k-digit endings.

Comments: 2 Pages.

Download: PDF

Submission history

[v1] 2018-05-13 14:29:57
[v2] 2018-05-25 01:31:15

Unique-IP document downloads: 105 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