Proof Of Fermat’s Last Theorem By Choosing Two Unknowns in the Integer Solution Are Prime Exponents
DOI:
https://doi.org/10.55014/pij.v3i4.108Keywords:
number theory, proof of Fermat’s last theorem, Diophantine equationsAbstract
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.
Downloads
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2022 Pacific International Journal
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.