The congruent number problem and elliptic curves
Ye Tian
Abstract
Ye Tian
Abstract
The Birch and Swinnerton-Dyer (BSD) conjecture and Goldfeld conjecture are fundamental problems in the arithmetic of elliptic curves. The congruent number problem (CNP) is one of the oldest problems in number theory which is, for each integer $n$, to find all the rational right triangles of area $n$. It is equivalent to finding all rational points on the elliptic curve $E^{(n)}: ny^{2}=x^{3}-x$. The BSD conjecture for $E^{(n)}$ solves CNP, and Goldfeld conjecture for this elliptic curve family solves CNP for integers with probability one. In this article, we introduce some recent progress on these conjectures and problems.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The Birch and Swinnerton-Dyer (BSD) conjecture and Goldfeld conjecture are fundamental problems in the arithmetic of elliptic curves. The congruent number problem (CNP) is one of the oldest problems in number theory which is, for each integer $n$, to find all the rational right triangles of area $n$. It is equivalent to finding all rational points on the elliptic curve $E^{(n)}: ny^{2}=x^{3}-x$. The BSD conjecture for $E^{(n)}$ solves CNP, and Goldfeld conjecture for this elliptic curve family solves CNP for integers with probability one. In this article, we introduce some recent progress on these conjectures and problems.
Key concepts: Conjecture, Elliptic curve, Mathematics, Sato–Tate conjecture, Integer (computer science), Modular elliptic curve, Combinatorics, Supersingular elliptic curve