Abstract

In 1995, A, Wiles [2], [3], announced, using cyclic groups ( a subject area which was not available at the time of Fermat), a proof of Fermat's Last Theorem, which is stated as fol-lows: If is an odd prime and x; y; z; are relatively prime positive integers, then z 6= x + y: In this note, a new elegant proof of this result is presented. It is proved, using elementary algebra, that if is an odd prime and x; y; z; are positive integers satisfying z = x + y; then z; y; x; are each divisible by :

Highlights

  • [3], many papers and books have been written trying to solve this problem in an elegant algebraic way, but none have suceeded. (See [1], and go to a search engine on the computer and search Fermats Last Theorem)

  • It is clear that z (x y ) 0; so z 0; y 0

  • Using z 0, it follows that z x y = 0 0

Read more

Summary

Introduction

[3], many papers and books have been written trying to solve this problem in an elegant algebraic way, but none have suceeded. (See [1], and go to a search engine on the computer and search Fermats Last Theorem). [3], many papers and books have been written trying to solve this problem in an elegant algebraic way, but none have suceeded. (See [1], and go to a search engine on the computer and search Fermats Last Theorem).

Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.