z-logo
open-access-imgOpen Access
Proof Of Fermat’s Last Theorem By Choosing Two Unknowns in the Integer Solution Are Prime Exponents
Author(s) -
SRINIVAS,
Dr.BRAOU,
Mr. THIRUCHINARPALLI SRINIVAS
Publication year - 2020
Publication title -
pacific international journal
Language(s) - English
Resource type - Journals
eISSN - 2663-8991
pISSN - 2616-4825
DOI - 10.55014/pij.v3i4.108
Subject(s) - fermat's last theorem , mathematics , diophantine equation , integer (computer science) , prime (order theory) , fermat number , discrete mathematics , combinatorics , prime number , fermat's little theorem , number theory , brouwer fixed point theorem , danskin's theorem , fixed point theorem , computer science , programming language
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom