The \(\theta\)-congruent number elliptic curves via Fermat-type algorithms (Q2052812)

The congruent number problem has a long history in number theory, and it is equivalent to the problem of determining whether the quadratic twist of the elliptic curve \(E_N: y^2=x^3-N^2x\) has a rational point of infinite order. \textit{M. Fujiwara} [in: Number theory. Diophantine, computational and algebraic aspects. Proceedings of the international conference, Eger, Hungary, July 29--August 2, 1996. Berlin: de Gruyter. 235--241 (1998; Zbl 0920.11035); Nat. Sci. Rep. Ochanomizu Univ. 52, No. 2, 1--8 (2001; Zbl 1025.11016)] generalized this problem to the triangles one of whose angle is fixed to be \(\theta \in (0,\pi)\), i.e., given a positive integer \(N\), determine whether or not it can be the area of a triangle such that one of its angle is \(\theta\), and it has rational side lengths. Fujiwara showed that the problem is nearly equivalent to determining whether the quadratic twist of a certain elliptic curve \(E_N^\theta\) has a rational point of infinite order. Such an integer \(N\) is called a \(\theta\)-congruent number, and the triangle with the property is called a \(\theta\)-congruent number triangle with area \(N\). The correspondence is in fact more specific. Given a congruent number \(N\) and the three sides \((a,b,c)\) of its right triangle, we can construct a rational point \((x,y)\) of infinite order on \(E_N\), and the converse holds as well. Fujiwara generalizes this construction for triangles with fixed angle \(\theta\), i.e., he constructs a rational point of infinite order on \(E_N^\theta\) from a \(\theta\)-congruent number triangle with area \(N\), and vice versa. Via this connection to elliptic curves, there must be a way of constructing more \(\theta\)-congruent number triangles with area \(N\) using the group law of elliptic curves if we are given one \(\theta\)-congruent number triangle with area \(N\). Fermat showed one method for \(\theta=\pi/2\). The authors of the paper under review generalizes Fermat's algorithm for all values of \(\theta\), and they also show that their general formula corresponds to the one obtained by the multiplication-by-2 map on the elliptic curve \(E_N^\theta\). The authors also present an alternative proof to Fujiwara's result on the connection to elliptic curves.