Proof Of Fermat’s Last Theorem By Choosing Two Unknowns in the Integer Solution Are Prime Exponents
SRINIVAS, Dr.BRAOU, Mr. THIRUCHINARPALLI SRINIVAS
Abstract
Open-access reader
SRINIVAS, Dr.BRAOU, Mr. THIRUCHINARPALLI SRINIVAS
Abstract
Open-access reader
In this paper we are revisits well known problem in number theory ‘ proof of Fermat’s last theorem ‘ with different perspective .Also we are presented for n greater than 2, Diophantine equations K(xn+yn)=zn and xn+yn=L zn are satisfied by some positive prime exponents of x,y,z with some sufficient values of K and L. But it is not possible to find positive integers x,y and z, which are satisfies above equations with exactly K=1 and L=1. Clearly it proves Fermat’s last theorem, which states that No positive integers of x, y, z are satisfies the equation xn+yn=zn for n greater than 2.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper we are revisits well known problem in number theory ‘ proof of Fermat’s last theorem ‘ with different perspective .Also we are presented for n greater than 2, Diophantine equations K(xn+yn)=zn and xn+yn=L zn are satisfied by some positive prime exponents of x,y,z with some sufficient values of K and L. But it is not possible to find positive integers x,y and z, which are satisfies above equations with exactly K=1 and L=1. Clearly it proves Fermat’s last theorem, which states that No positive integers of x, y, z are satisfies the equation xn+yn=zn for n greater than 2.
Key concepts: Fermat's Last Theorem, Mathematics, Diophantine equation, Integer (computer science), Prime (order theory), Fermat number, Discrete mathematics, Combinatorics