期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
A New Proof for Congruent Number’s Problem via Pythagorician Divisors
1
作者 Léopold Dèkpassi Keuméan François Emmanuel Tanoé 《Advances in Pure Mathematics》 2024年第4期283-302,共20页
Considering Pythagorician divisors theory which leads to a new parameterization, for Pythagorician triplets ( a,b,c )∈ ℕ 3∗ , we give a new proof of the well-known problem of these particular squareless numbers n∈ ℕ... Considering Pythagorician divisors theory which leads to a new parameterization, for Pythagorician triplets ( a,b,c )∈ ℕ 3∗ , we give a new proof of the well-known problem of these particular squareless numbers n∈ ℕ ∗ , called congruent numbers, characterized by the fact that there exists a right-angled triangle with rational sides: ( A α ) 2 + ( B β ) 2 = ( C γ ) 2 , such that its area Δ= 1 2 A α B β =n;or in an equivalent way, to that of the existence of numbers U 2 , V 2 , W 2 ∈ ℚ 2∗ that are in an arithmetic progression of reason n;Problem equivalent to the existence of: ( a,b,c )∈ ℕ 3∗ prime in pairs, and f∈ ℕ ∗ , such that: ( a−b 2f ) 2 , ( c 2f ) 2 , ( a+b 2f ) 2 are in an arithmetic progression of reason n;And this problem is also equivalent to that of the existence of a non-trivial primitive integer right-angled triangle: a 2 + b 2 = c 2 , such that its area Δ= 1 2 ab=n f 2 , where f∈ ℕ ∗ , and this last equation can be written as follows, when using Pythagorician divisors: (1) Δ= 1 2 ab= 2 S−1 d e ¯ ( d+ 2 S−1 e ¯ )( d+ 2 S e ¯ )=n f 2;Where ( d, e ¯ )∈ ( 2ℕ+1 ) 2 such that gcd( d, e ¯ )=1 and S∈ ℕ ∗ , where 2 S−1 , d, e ¯ , d+ 2 S−1 e ¯ , d+ 2 S e ¯ , are pairwise prime quantities (these parameters are coming from Pythagorician divisors). When n=1 , it is the case of the famous impossible problem of the integer right-angled triangle area to be a square, solved by Fermat at his time, by his famous method of infinite descent. We propose in this article a new direct proof for the numbers n=1 (resp. n=2 ) to be non-congruent numbers, based on an particular induction method of resolution of Equation (1) (note that this method is efficient too for general case of prime numbers n=p≡a ( ( mod8 ) , gcd( a,8 )=1 ). To prove it, we use a classical proof by induction on k , that shows the non-solvability property of any of the following systems ( t=0 , corresponding to case n=1 (resp. t=1 , corresponding to case n=2 )): ( Ξ t,k ){ X 2 + 2 t ( 2 k Y ) 2 = Z 2 X 2 + 2 t+1 ( 2 k Y ) 2 = T 2 , where k∈ℕ;and solutions ( X,Y,Z,T )=( D k , E k , f k , f ′ k )∈ ( 2ℕ+1 ) 4 , are given in pairwise prime numbers.2020-Mathematics Subject Classification 11A05-11A07-11A41-11A51-11D09-11D25-11D41-11D72-11D79-11E25 . 展开更多
关键词 Prime Numbers-Diophantine Equations of Degree 2 & 4 Factorization Greater Common Divisor Pythagoras Equation Pythagorician Triplets Congruent Numbers Inductive Demonstration Method Infinite Descent bsd conjecture
下载PDF
On the Birch-Swinnerton-Dyer Conjecture of Elliptic Curves E_D:y^2=x^3-D^2x 被引量:4
2
作者 Delang Li Department of Mathematics,Sichuan Union University,Chengdu 610064,P.R.China Ye Tian Department of Mathematics,Columbia University,New York,NY 10027,USA 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2000年第2期229-236,共8页
We prove in this paper that the BSD conjecture holds for a certain kind of elliptic curves.
关键词 Elliptic curve bsd conjecture GRAPH 2-component
原文传递
A Criterion for Elliptic Curves with Second Lowest 2-Power in L(1)(Ⅱ) 被引量:1
3
作者 Chun Lai ZHAO 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2005年第5期961-976,共16页
Let D = p1p2 …pm, where p1,p2, ……,pm are distinct rational primes with p1 ≡p2 ≡3(mod 8), pi =1(mod 8)(3 ≤ i ≤ m), and m is any positive integer. In this paper, we give a simple combinatorial criterion fo... Let D = p1p2 …pm, where p1,p2, ……,pm are distinct rational primes with p1 ≡p2 ≡3(mod 8), pi =1(mod 8)(3 ≤ i ≤ m), and m is any positive integer. In this paper, we give a simple combinatorial criterion for the value of the complex L-function of the congruent elliptic curve ED2 : y^2 = x^3- D^2x at s = 1, divided by the period ω defined below, to be exactly divisible by 2^2m-2, the second lowest 2-power with respect to the number of the Gaussian prime factors of D. As a corollary, we obtain a new series of non-congruent numbers whose prime factors can be arbitrarily many. Our result is in accord with the predictions of the conjecture of Birch and Swinnerton-Dyer. 展开更多
关键词 Elliptic curve L-FUNCTION Congruent number bsd conjecture
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部