Pythagorician Divisors and Applications to Some Diophantine Equations  

Pythagorician Divisors and Applications to Some Diophantine Equations

在线阅读下载全文

作  者:François Emmanuel Tanoé Prosper Kouadio Kimou François Emmanuel Tanoé;Prosper Kouadio Kimou(UFR Mathématiques et Informatique. Université Félix Houphouë,t BOIGNY, Abidjan, Cô,te D’ivoire;Laboratoire d’Informatique et de Mathématiques Appliquées. Institut Polytechnique Félix Houphouë,t BOIGNY, Yamoussoukro, Cô,te D’ivoire)

机构地区:[1]UFR Mathématiques et Informatique. Université Félix Houphouë,t BOIGNY, Abidjan, Cô,te D’ivoire [2]Laboratoire d’Informatique et de Mathématiques Appliquées. Institut Polytechnique Félix Houphouë,t BOIGNY, Yamoussoukro, Cô,te D’ivoire

出  处:《Advances in Pure Mathematics》2023年第2期35-70,共36页理论数学进展(英文)

摘  要:We consider the Pythagoras equation X<sup>2</sup> +Y<sup>2</sup> = Z<sup>2</sup>, and for any solution of the type (a,b = 2<sup>s</sup>b<sub>1 </sub>≠0,c) ∈ N<sup>*3</sup>, s ≥ 2, b<sub>1</sub>odd, (a,b,c) ≡ (±1,0,1)(mod 4), c > a , c > b, and gcd(a,b,c) = 1, we then prove the Pythagorician divisors Theorem, which results in the following: , where (d,d′′) (resp. (e,e<sup>n</sup>)) are unique particular divisors of a and b, such that a = dd′′ (resp. b = ee′′ ), these divisors are called: Pythagorician divisors from a, (resp. from b). Let’s put λ ∈{0,1}, defined by: and S = s -λ (s -1). Then such that . Moreover the map is a bijection. We apply this new tool to obtain a new classification of the primitive, positive and non-trivial solutions of the Pythagoras equations: a<sup>2</sup> + b<sup>2</sup> = c<sup>2</sup> via the Pythagorician parameters (d,e,S ). We obtain for (d, e) fixed, the equivalence class of any Pythagorician solution (a,b,c), checking , namely: . We also update the solutions of some Diophantine equations of degree 2, already known, but very important for the resolution of other equations. With this tool of Pythagorean divisors, we have obtained (in another paper) new recurrent methods to solve Fermat’s equation: a<sup>4</sup> + b<sup>4 </sup>= c<sup>4</sup>, other than usual infinite descent method;and to solve congruent numbers problem. We believe that this tool can bring new arguments, for Diophantine resolution, of the general equations of Fermat: a<sup>2p</sup> + b<sup>2p</sup> = c<sup>2p</sup> and a<sup>p</sup> + b<sup>p</sup> = c<sup>p</sup>. MSC2020-Mathematical Sciences Classification System: 11A05-11A51-11D25-11D41-11D72.We consider the Pythagoras equation X<sup>2</sup> +Y<sup>2</sup> = Z<sup>2</sup>, and for any solution of the type (a,b = 2<sup>s</sup>b<sub>1 </sub>≠0,c) ∈ N<sup>*3</sup>, s ≥ 2, b<sub>1</sub>odd, (a,b,c) ≡ (±1,0,1)(mod 4), c > a , c > b, and gcd(a,b,c) = 1, we then prove the Pythagorician divisors Theorem, which results in the following: , where (d,d′′) (resp. (e,e<sup>n</sup>)) are unique particular divisors of a and b, such that a = dd′′ (resp. b = ee′′ ), these divisors are called: Pythagorician divisors from a, (resp. from b). Let’s put λ ∈{0,1}, defined by: and S = s -λ (s -1). Then such that . Moreover the map is a bijection. We apply this new tool to obtain a new classification of the primitive, positive and non-trivial solutions of the Pythagoras equations: a<sup>2</sup> + b<sup>2</sup> = c<sup>2</sup> via the Pythagorician parameters (d,e,S ). We obtain for (d, e) fixed, the equivalence class of any Pythagorician solution (a,b,c), checking , namely: . We also update the solutions of some Diophantine equations of degree 2, already known, but very important for the resolution of other equations. With this tool of Pythagorean divisors, we have obtained (in another paper) new recurrent methods to solve Fermat’s equation: a<sup>4</sup> + b<sup>4 </sup>= c<sup>4</sup>, other than usual infinite descent method;and to solve congruent numbers problem. We believe that this tool can bring new arguments, for Diophantine resolution, of the general equations of Fermat: a<sup>2p</sup> + b<sup>2p</sup> = c<sup>2p</sup> and a<sup>p</sup> + b<sup>p</sup> = c<sup>p</sup>. MSC2020-Mathematical Sciences Classification System: 11A05-11A51-11D25-11D41-11D72.

关 键 词:Pythagoras Equation Pythagorician Triplets Diophantine Equations of Degree 2 Factorisation-Gcd-Fermat’s Equations 

分 类 号:O15[理学—数学]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象