Scinovex
paratext

Untitled

Yue ZhangM HaroldEdwardsRoy BarbaraAnatoly GrinbergKenneth RibetBrian HayesDavide CastelvecchiAndrew WilesJoseph JamesB PereraP UpekshaRad PiyadasaC Levesque

Abstract

Fermat's last theorem was proposed more than 350 years ago, it attracted the interests of a lot of researchers [1][2][3][4][5][6][7][8][9][10][11] .The simplest case of Fermat's last theorem is n=3, but the previous proofs on it are generally complex or not easy to understand.The present work through the transformation x=t+1, firstly proves that when the values of x and t{ tmin, tmax}  { xmin, xmax }, the Fermat's last theorem in the case of n=3 is true.Furthermore, the paper also proves that when x take other positive integers besides x{ tmin, tmax}  {xmin, xmax}, the Fermat's last theorem in the case of n=3 is true as well.Therefore, there are no a group of positive integers of x, y and z to satisfy the Diophantine equation in the case of n=3; Fermat's last theorem in the case of n=3 is true.

Computer science
Citations
0
FWCI
field-weighted impact
References
10
Percentile
vs. same field & year
References
Modular Elliptic Curves and Fermat's Last Theorem
Annals of Mathematics · 1995 · 2,053 citations
Citation Network

How this paper connects to the literature. Drag to explore, click any node to open that paper.