Corrigendum to ”on the congruent number problem over integers of cyclic number fields”, Math. Slovaca 66(3) (2016), 561–564

2019 ◽  
Vol 69 (5) ◽  
pp. 1233-1233
Author(s):  
Albertas Zinevičius
2009 ◽  
Vol 59 (3) ◽  
Author(s):  
E. Girondo ◽  
G. González-Diez ◽  
E. González-Jiménez ◽  
R. Steuding ◽  
J. Steuding

AbstractGiven any positive integer n, we prove the existence of infinitely many right triangles with area n and side lengths in certain number fields. This generalizes the famous congruent number problem. The proof allows the explicit construction of these triangles; for this purpose we find for any positive integer n an explicit cubic number field ℚ(λ) (depending on n) and an explicit point P λ of infinite order in the Mordell-Weil group of the elliptic curve Y 2 = X 3 − n 2 X over ℚ(λ).


2016 ◽  
Vol 66 (3) ◽  
Author(s):  
Albertas Zinevičius

AbstractGiven a cyclic field extension


Author(s):  
Cheol-Min Park ◽  
Sun Woo Park

Given a number field [Formula: see text], we define the degree of an algebraic number [Formula: see text] with respect to a choice of a primitive element of [Formula: see text]. We propose the question of computing the minimal degrees of algebraic numbers in [Formula: see text], and examine these values in degree 4 Galois extensions over [Formula: see text] and triquadratic number fields. We show that computing minimal degrees of non-rational elements in triquadratic number fields is closely related to solving classical Diophantine problems such as congruent number problem as well as understanding various arithmetic properties of elliptic curves.


2021 ◽  
Author(s):  
Alex Nguhi

With respect to some classification of Pythagorean triples, if anumber 𝑘 is congruent then it can easily be proven. This expandsthe quest to resolve the congruent number problem. A proposi-tion is put forward on rational sides forming a congruent number.


Author(s):  
Jan Feliksiak

The congruent number problem is the oldest unsolved major mathematical problem to date. The problem aiming to determine whether or not some given integer n is congruent, which corresponds to a Pythagorean triangle with integer sides, can be settled in a finite number of steps. However, once we permit the triangles to acquire rational values for its sides, the degree of difficulty of the task changes dramatically. In this paper a basis is developed, to produce right Pythagorean triangles with rational sides and integral area in a straightforward manner. Determining whether or not a given natural number n is congruent, is equivalent to a search through an ordered 2D array.


2011 ◽  
Vol 07 (08) ◽  
pp. 2237-2247 ◽  
Author(s):  
LARRY ROLEN

We study a certain generalization of the classical Congruent Number Problem. Specifically, we study integer areas of rational triangles with an arbitrary fixed angle θ. These numbers are called θ-congruent. We give an elliptic curve criterion for determining whether a given integer n is θ-congruent. We then consider the "density" of integers n which are θ-congruent, as well as the related problem giving the "density" of angles θ for which a fixed n is congruent. Assuming the Shafarevich–Tate conjecture, we prove that both proportions are at least 50% in the limit. To obtain our result we use the recently proven p-parity conjecture due to Monsky and the Dokchitsers as well as a theorem of Helfgott on average root numbers in algebraic families.


Sign in / Sign up

Export Citation Format

Share Document