About Fermat’s Last Theorem
DOI:
https://doi.org/10.47363/JMCA/2024(3)195Keywords:
Highest Common Factor (HCF), Greatest Common Divisor (GCD), Max / Min(a, b, c) stands for the Largest/Least among the numbers a, b and c, Lowest Common Multiple (LCM), O(n) and M(n) with the usual meaningsAbstract
In this paper, the possibility of finding a simple proof of Fermat’s Last Theorem is discussed by using the principles of elementary algebra instead of using the Modularity theorem. For an odd prime n the Fermat’s diophantine equation xn = yn + zn gives rise to an equation of (n − 1) th degree which can be proved to be irreducible over the field Q of rational real numbers by using Eisenstein’s criterion. This proves the theorem for any odd prime n. For n = 4 we use a method of reductio-ad-absurdum to prove the theorem. Finally, we deduce Beal’s conjecture.
Downloads
Published
2024-11-26
Issue
Section
Articles