Elementary proof of Fermat Last Theorem based on parity considerations and binomial expansions
| Main Author: | Shestopaloff Yu. K. |
|---|---|
| Format: | info publication-preprint eJournal |
| Bahasa: | eng |
| Terbitan: |
, 2019
|
| Subjects: | |
| Online Access: |
https://zenodo.org/record/3236583 |
Daftar Isi:
- An elementary proof of Fermat Last Theorem (FLT) on the basis of binomial expansions and parity considerations is proposed. FLT was formulated by Fermat in 1637, and proved by A. Wiles in 1995. Here, a simpler approach is studied. The initial equation x^n + y^n = z^n is considered in integer numbers and subdivided into several equations based on the parity of terms and their powers. Then, each equation is studied separately, using methods suitable for it. Proving FLT means to prove that each such sub-equation has no solution in integer numbers. Once this is accomplished, it would mean that the original FLT equation has no solution in natural numbers.
- Note that Version 5 has different title: "Elementary proof of Fermat Last Theorem based on parity considerations and binomial expansions" (file "BinomExpan_17z.pdf")