Advances in Pure Mathematics

Volume 14, Issue 4 (April 2024)

ISSN Print: 2160-0368   ISSN Online: 2160-0384

Google-based Impact Factor: 0.50  Citations  h5-index & Ranking

Fermat and Pythagoras Divisors for a New Explicit Proof of Fermat’s Theorem:a4 + b4 = c4. Part I

HTML  XML Download Download as PDF (Size: 500KB)  PP. 303-319  
DOI: 10.4236/apm.2024.144017    47 Downloads   154 Views  

ABSTRACT

In this paper we prove in a new way, the well known result, that Fermat’s equation a4 + b4 = c4, is not solvable in , when abc0 . To show this result, it suffices to prove that: ( F 0 ): a 1 4 + ( 2 s b 1 ) 4 = c 1 4 , is not solvable in , (where a 1 , b 1 , c 1 2+1 , pairwise primes, with necessarly 2s ). The key idea of our proof is to show that if (F0) holds, then there exist α 2 , β 2 , γ 2 2+1 , such that ( F 1 ): α 2 4 + ( 2 s1 β 2 ) 4 = γ 2 4 , holds too. From where, one conclude that it is not possible, because if we choose the quantity 2 ≤ s, as minimal in value among all the solutions of ( F 0 ) , then ( α 2 ,2 s1 β 2 , γ 2 ) is also a solution of Fermat’s type, but with 2s1<s , witch is absurd. To reach such a result, we suppose first that (F0) is solvable in ( a 1 ,2 s b 1 , c 1 ) , s ≥ 2 like above; afterwards, proceeding with “Pythagorician divisors”, we creat the notions of “Fermat’s b-absolute divisors”: ( d b , d b ) which it uses hereafter. Then to conclude our proof, we establish the following main theorem: there is an equivalence between (i) and (ii): (i) (F0): a 1 4 + ( 2 s b 1 ) 4 = c 1 4 , is solvable in , with 2s , ( a 1 , b 1 , c 1 ) ( 2+1 ) 3 , coprime in pairs. (ii) ( a 1 , b 1 , c 1 ) ( 2+1 ) 3 , coprime in pairs, for wich: ( b 2 , b 2 , b 2 ) ( 2+1 ) 3 coprime in pairs, and 2s , checking b 1 = b 2 b 2 b 2 , and such that for notations: S=sλ( s1 ) , with λ{ 0,1 } defined by c 1 a 1 2 λ( mod2 ) , d b =gcd( 2 s b 1 , c 1 a 1 )= 2 S b 2 and d b = 2 sS b 2 = 2 s B 2 d b , where ( 2 s B 2 ) 2 =gcd( b 1 2 , c 1 2 a 1 2 ) , the following system is checked: { c 1 a 1 = d b 4 2 2+λ = 2 2λ ( 2 S1 b 2 ) 4 c 1 + a 1 = 2 1+λ d b 4 = 2 1+λ ( 2 sS b 2 ) 4 c 1 2 + a 1 2 =2 b 2 4 ; and this system implies: ( b 1λ,2 4 ) 2 + ( 2 4s3 b λ,2 4 ) 2 = ( b 2 2 ) 2 ; where: ( b 1λ,2 , b λ,2 , b 2 )={ ( b 2 , b 2 , b 2 )ifλ=0 ( b 2 , b 2 , b 2 )ifλ=1 ; From where, it is quite easy to conclude, following the method explained above, and which thus closes, part I, of this article.

Share and Cite:

Kimou, P. , Tanoé, F. and Kouakou, K. (2024) Fermat and Pythagoras Divisors for a New Explicit Proof of Fermat’s Theorem:a4 + b4 = c4. Part I. Advances in Pure Mathematics, 14, 303-319. doi: 10.4236/apm.2024.144017.

Cited by

No relevant information.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.