2023•EMS Press eBooksOpen access

The congruent number problem and elliptic curves

Ye Tian

Open full text 3 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Conjecture, Elliptic curve, Mathematics, Sato–Tate conjecture, Integer (computer science), Modular elliptic curve, Combinatorics, Supersingular elliptic curve

Related papers

Back to paper searchBrowse research topicsOriginal source
The congruent number problem and elliptic curves — Research Paper | ScholarLens