An Elementary Proof for Fermat's Last Theorem using Ramanujan-Nagell Equation
Creators
- 1. Retired Executive Engineer, Energy Conservation Cell, Tamil Nadu State Electricity Board, Anna Salai, Chennai (Tamil Nadu), India.
Description
Abstract: Fermat’s Last Theorem states that it is impossible to find positive integers A, B and C satisfying the equation An + Bn = Cn where n is any integer > 2. Taking the proofs of Fermat for the index n = 4, and Euler for n = 3, it is sufficient to prove the theorem for n = p, any prime > 3. We hypothesize that all r, s and t are non-zero integers in the equation rp + sp = tp and establish a contradiction in this proof. Just for supporting the proof in the above equation, we have used another equation x3 + y3 = z3 Without loss of generality, we assert that both x and y as non-zero integers; z3 a non-zero integer; z and z2 irrational. We create transformed equations to the above two equations through parameters, into which we have incorporated the Ramanujan - Nagell equation. Solving the transformed equations we prove the theorem.
Files
B118004021024.pdf
Files
(510.8 kB)
Name | Size | Download all |
---|---|---|
md5:35c9c33e0b94f7640982bc7c7854a539
|
510.8 kB | Preview Download |
Additional details
Identifiers
- DOI
- 10.54105/ijam.B1180.04021024
- EISSN
- 2582-8932
Dates
- Accepted
-
2024-10-15Manuscript received on 05 October 2024 | Revised Manuscript received on 10 October 2024 | Manuscript Accepted on 15 October 2024 | Manuscript published on 30 October 2024.
References
- Hardy G. H. and Wright E. M., An introduction to the theory of numbers, 6th ed. Oxford University Press, 2008, pp. 261-586. DOI: http://dx.doi.org/10.1080/00107510903184414
- Lawrence C. Washington, Elliptic Curves, Number Theory and Cryptography, 2nd ed. 2003, pp. 445-448. DOI: https://doi.org/10.1201/9781420071474
- Andrew Wiles, Modular Elliptic Curves and Fermat's Last Theorem, Annals of Mathematics, 1995; 141(3); pp.443-551. DOI https://doi.org/10.2307/2118559
- 13 Lectures on Fermat's Last Theorem by Paulo Ribenboim, Publisher: Springer , New York , originally published in 1979, pages 159. DOI: https://doi.org/10.1007/978-1-4684-9342-9
- KEERTHIIKA, V. K. (2019). Role of Chinese Remainder Theorem in Cryptography. In International Journal of Engineering and Advanced Technology (Vol. 8, Issue 6, pp. 256–258). https://doi.org/10.35940/ijeat.e7522.088619
- Tamizharasi, R., & Yamuna, M. (2019). Encryption Algorithm - Detecting Chemical Structures using Graph Theory. In International Journal of Innovative Technology and Exploring Engineering (Vol. 9, Issue 1, pp. 3654–3658). https://doi.org/10.35940/ijitee.a4693.119119
- Tahiliani, Dr. S. (2021). More on Diophantine Equations. In International Journal of Management and Humanities (Vol. 5, Issue 6, pp. 26–27). https://doi.org/10.35940/ijmh.l1081.025621
- Nongbsap, W., & Singh, Dr. M. M. (2021). A Cryptographic Application of the M-Injectivity of 𝑀𝑛(𝑍𝑝) Over Itself. In International Journal of Recent Technology and Engineering (IJRTE) (Vol. 10, Issue 4, pp. 7–14). https://doi.org/10.35940/ijrte.d6515.1110421
- Bashir, S. (2023). Pedagogy of Mathematics. In International Journal of Basic Sciences and Applied Computing (Vol. 10, Issue 2, pp. 1–8). https://doi.org/10.35940/ijbsac.b1159.1010223