2020•Journal of Mathematical Problems Equations and StatisticsRequires access

A Simple Proof on Fermat’s Last Theorem in Case of n=3

Yue Zhang

Open publisher page 0 citations

Abstract

Fermat’s last theorem was proposed more than 350 years ago, it attracted the interests of a lot of researchers [1-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.

About this research paper

What this paper is about

Fermat’s last theorem was proposed more than 350 years ago, it attracted the interests of a lot of researchers [1-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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Fermat’s last theorem was proposed more than 350 years ago, it attracted the interests of a lot of researchers [1-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.

Key concepts: Fermat's Last Theorem, Fermat number, Fermat's little theorem, Mathematics, Wieferich prime, Proofs of Fermat's little theorem, Regular prime, Mathematical proof

Related papers

Back to paper searchBrowse research topicsOriginal source
A Simple Proof on Fermat’s Last Theorem in Case of n=3 — Research Paper | ScholarLens