Proving The Fermat Last Theorem for Case q≤n
Baiq Desy Aniska Prayanti, Maxrizal Maxrizal
Abstract
Open-access reader
Baiq Desy Aniska Prayanti, Maxrizal Maxrizal
Abstract
Open-access reader
Fermat's Last Theorem is a well-known classical theorem in mathematics. Andrew Willes has proven this theorem using the modular elliptic curve. However, the proposed proof is difficult for mathematicians and researchers to understand. For this reason, in this study, we provide evidence of several properties of Fermat's Last Theorem with a simple concept. We use Newton's Binomial Theorem, well-known in Fermat's time. In this study, we prove Fermat's Last Theorem for case . We also use the Newton’s Binomial theorem to verify several cases .
A significance statement is not available in the OpenAlex record.
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.
Fermat's Last Theorem is a well-known classical theorem in mathematics. Andrew Willes has proven this theorem using the modular elliptic curve. However, the proposed proof is difficult for mathematicians and researchers to understand. For this reason, in this study, we provide evidence of several properties of Fermat's Last Theorem with a simple concept. We use Newton's Binomial Theorem, well-known in Fermat's time. In this study, we prove Fermat's Last Theorem for case . We also use the Newton’s Binomial theorem to verify several cases .
Key concepts: Fermat's Last Theorem, Fermat's little theorem, Proofs of Fermat's little theorem, Binomial theorem, Mathematics, Regular prime, Fermat number, Wieferich prime