Abstract
A Heron quadrilateral is a cyclic quadrilateral whose area and side lengths are rational. In this work, we establish a correspondence between Heron quadrilaterals and a family of elliptic curves of the form y2 = x3 + αx2 − n2x. This correspondence generalizes the notions of Goins and Maddox who established a similar connection between Heron triangles and elliptic curves. We further study this family of elliptic curves, looking at their torsion groups and ranks. We also explore their connection with congruent numbers, which are the α = 0 case. Congruent numbers are positive integers which are the area of a right triangle with rational side lengths.
Keywords: 2010 AMS Mathematics subject classification, Primary 14H52, Secondary 51M04, 14G05, 11G05, Heron quadrilateral, cyclic quadrilateral, congruent numbers, elliptic curves
1. Introduction.
A positive integer n is a congruent number if it is equal to the area of a right triangle with rational sides. Equivalently, n is congruent if the elliptic curve En : y2 = x3 − n2x has positive rank. Congruent numbers have been intensively studied, see for example [10], [11], [30]. The curves En are closely connected with the problem of classifying areas of right rational triangles. Indeed, Koblitz [31], used the areas of rational triangles as a motivation for studying elliptic curves and modular forms. In [24], Goins and Maddox generalized some of Koblitz’s notions ([31, Ch. 1, §2, ex. 3]) by exploring the correspondence between positive integers n associated with arbitrary triangles (with rational side lengths) which have area n and the family of elliptic curves y2 = x(x − nτ)(x + nτ−1) for nonzero rational τ. Congruent number curves are of course the τ = 1 case.
In this work, we extend these ideas to show a correspondence between cyclic quadrilaterals with rational side lengths and area n (Heron quadrilaterals) and a family of elliptic curves of the form y2 = x3 + αx2 − n2x. We give explicit formulas which show how to construct the elliptic curve and some non-trivial points on the curve given the side lengths and area of the quadrilateral. If we set one of the side lengths to zero, then the formulas collapse to exactly those of Maddox and Goins. We also show the other direction of the correspondence, that is, how to find a cyclic quadrilateral which corresponds to a given elliptic curve in our family. We call the pair (α, n) a generalized congruent number pair if the elliptic curve y2 = x3 + αx2 − n2x has a point of infinite order. We similarly call the curve a generalized congruent number elliptic curve. The generalized congruent number curves with α = 0 are precisely the congruent number curves. Stated in this way, our results relate generalized congruent number pairs with cyclic quadrilaterals with area n.
We also study the family of curves defined by the generalized congruent number pairs, looking at their torsion groups and ranks. The torsion groups are usually , although in some cases it is , or . Studying families of elliptic curves with torsion group with high rank has been of much interest [2], [9], [32], [33], [38]. The highest known rank for a curve with is 19, due to Elkies [16]. Fermigier found infinite families with rank at least 8 [20, 21, 22].
Any elliptic curve with a 2-torsion point may be written in the form Eα,β : y2 = x3 + αx2 + βx. Special cases of the family of the curves E0,β : y2 = x3 + βx, and their ranks have been studied by many authors including Bremner and Cassels [7], Kudo and Motose [34], Maenishi [35], Ono and Ono [39], Izadi, Khoshnam and Nabardi [29], Aguirre and Peral [3], Spearman [46, 47], and Hollier, Spearman and Yang [26]. The general case was studied by Aguirre, Castaneda, and Peral [1] and they found curves of rank 12 and 13. See [16, 17] for tables with the highest known ranks for other fixed torsion groups, including references to the papers where each curve can be found.
In this work, the curves we study are of the form Eα, −n2. We believe this is the first time in the literature curves of this form have been examined. We find many such curves with rank (at least) 10. We also construct an infinite family of the Eα,−n2 with rank at least 5. All of these curves arise from cyclic quadrilaterals. Furthermore, in the special case with α = 0, we find infinite families of congruent number curves with ranks 2 and 3, matching the results of [43], [51], [30].
This work is organized as follows. In section 2 we review basic facts about cyclic quadrilaterals. Section 3 details the correspondence between cyclic quadrilaterals and the elliptic curves, and includes our main result. We examine the torsion groups of the family of elliptic curves we study in Section 4. In sections 5 and 6 we find examples of congruent number curves with high rank, as well as high rank curves from the family Eα,−n2. We conclude with some examples and data in Section 7.
2. Cyclic quadrilaterals.
A cyclic polygon is one with vertices upon which a circle can be circumscribed. Specifically, we will focus on cyclic quadrilaterals. Mathematicians have long been interested in cyclic quadrilaterals. For example, consider Kummer’s complex construction to generate Heron quadrilaterals outlined in [15]. The existence and parametrization of quadrilaterals with rational side lengths (and additional conditions) has a long history [4, 14, 15, 25, 27]. Buchholz and Macdougall [8] have shown that there exist no nontrivial Heron quadrilaterals having the property that the rational side lengths form an arithmetic or geometric progression. In [28], (cyclic) Brahmagupta quadrilaterals were used to construct infinite families of elliptic curves with torsion group having ranks 4, 5, and 6.
A convex quadrilateral is cyclic if and only if its opposite angles are supplementary. An example of a quadrilateral which is not cyclic is a non-square rhombus. Another characterization of cyclic quadrilaterals can be given by Ptolemy’s theorem: if the diagonals have lengths p, q, then a convex quadrilateral is cyclic if and only if pq = ac + bd. Given four side lengths such that the sum of any three sides is greater than the remaining side, there exists a cyclic quadrilateral with these side lengths [12], [49]. The area of a cyclic quadrilateral with side lengths a, b, c, d can be found using Brahmagupta’s formula
where s = (a + b + c + d)/2. Letting d = 0, the formula collapses to Heron’s formula for the area of a triangle. It is known that a cyclic quadrilateral has maximal area among all quadrilaterals with the same side lengths.
Assume we have a cyclic quadrilateral whose consecutive sides have lengths a, b, c, and d, with rational area n. Let θ be the angle between the sides with lengths a and b. Then by considering the Law of Cosines and the area formula, we have
| (2.1) |
3. Cyclic quadrilaterals and elliptic curves.
In this section we establish a correspondence between cyclic quadrilaterals whose area and side lengths are rational and elliptic curves. In [24], the authors created a similar correspondence between triangles with rational area and elliptic curves, which in some sense were generalizations of congruent number curves. We follow the same initial approach.
We use the notation from the previous section. From equation (2.1), we see that both cos θ and sin θ are rational. Set τ to be
Note that
and
From (2.1), consider that
so then
Thus, if we set u = a − b cos θ, v = b sin θ, and w = c + d cos θ, then
Hence we know there exists a t such that
in terms of
Set
The point P1 = (x1, y1) is on the curve y2 = x3 + αx2 + βx where
We denote this defined cubic equation by Eα,−n2. The discriminant of the curve is
and is nonzero because a, b, c and d are positive. Hence, the cubic does indeed define a nonsingular curve. A point P = (x, y) has order 2 if and only if y = 0; hence as n ≠ 0 then y1 = (a/4)(a+b+c−d)(a−b+c+d) ≠ 0 and so P1 does not have order 2. This construction generalizes Goins and Maddox’s technique since setting d = 0, the formulas for τ, t, α, β, sin θ, cos θ, (x1, y1) obtained are exactly those in [24].
We can easily find other points on the elliptic curve Eα,−n2. Namely, let
Note that a = y1/x1, b = −y2/x2, d = −y3/x3. It can be checked that (x1, y1) + (x2, y2) + (x3, y3) = ∞. Furthermore, using the height pairing matrix it can be checked that any two of the set of points (x1, y1), (x2, y2), (x3, y3) are linearly independent. So the rank of E is generically at least 2.
Using the addition law, we also have
| (3.1) |
| (3.2) |
In particular
from which we can derive the following
| (3.3) |
| (3.4) |
Obviously, using the above quantities, we could solve for c, cos θ, sin θ, τ, etc. In particular
and
The correspondence we have illustrated is the main result of this work. We note that for every rational value n, there are many cyclic quadrilaterals with area n. For example, any rectangle with side lengths k and n/k. Still, we find the above correspondence very interesting.
Theorem 3.1. For every cyclic quadrilateral with rational side lengths and area n, there is an elliptic curve
with 2 rational points, neither of which has order 2. Conversely, given an elliptic curve Eα,−n2 with positive rank, then there is a cyclic quadrilateral with area n whose side lenghts are rational (under the correspondence given above).
Proof. Given a cyclic quadrilateral, the above construction shows how to construct Eα,−n2, with points P1 and P2. The points Pi are of order 2 if and only if yPi = 0, which implies xPi = 0 as well, since for example y1 = ax1. However the x-coordinates are all non-zero, since in any quadrilateral (cyclic or not) the largest side length is less than the sum of the other three sides. This shows one direction.
For the converse, we fix a point P1 = (x1, y1) of infinite order (which exists since Eα,−n2 has positive rank). We may replace P1 by −P1 or P1 + (0, 0) (see (3.1)) so that we can take x1, y1 > 0. Set a = y1/x1. Then consider the three equations:
| (3.5) |
| (3.6) |
We set , which can be easily shown to be equal to a2 − a + 2n2/x1. Let
and let r be a root of h(x) = 0. It can be checked that a solution to the three equations above is given by c = (−br + ζ)/a, and d = r. In order for d = r to be rational, the discriminant of h must be a square, equivalently
We can then express
This quartic curve C(b, z) is actually birationally equivalent to y2 = x3 + ax2 − n2x.
Lemma 3.2. The curve C(b, z) is birationally isomorphic to the curve Eα,−n2 : y2 = x3 + αx2 − n2x.
Proof. Note the curve C(b, z) has rational point (−a, ζ). Under the transformation f1(b, z) → (b + a, z), we map to the curve
with rational point (0, ζ). We now map to a Weierstrass curve by
We now perform a simple linear change of variables , sending the curve to
We compute
Thus, C3(x, y) is really just y2 = x3 + αx2 − n2x. Composing the maps f1, f2, and f3, we see the curves are birationally equivalent. □
We continue the proof of Theorem 3.1. Since Eα,−n2 has positive rank, then so does C(b, z). In other words, there are infinitely many rational points (b, z) on C(b, z). Given any rational values for (b, z), we can then compute c and d. It remains to check that c and d are positive.
We have an infinite number of choices for b. We will pick a “small” b so that the quantity a2 − b2 will be positive. We then want aζ − bz > 0 and −bζ + az > 0, which will guarantee c, d > 0. Note that when b = a, both the line z = (ζ/a)b and the hyperbola z = (aζ)/b intersect the curve C(b, z) at the same point (a, ζ). Looking in the first quadrant (i.e., where b, z > 0), the line and hyperbola can possibly intersect C(b, z) additional times. The line will intersect C(b, z) if b2 = (ζ2 + 2a2α − a4)/a2. The hyperbola will intersect C(b, z) if b4 + (a2 − 2a)b2 + ζ2 = 0. Let r* be the minimum positive b-value of any intersections of C(b, z) with either the line or hyperbola. Also observe that for positive b near b = 0, the value of the hyperbola z = (aζ)/b goes to infinity.
We claim the quartic curve C(b, z) intersects the z-axis. We must check that (0, ) is a real point on C(b, z), i.e., that ζ2 − a4 + 2a2α > 0. Equivalently, this is . Now, since then . Substituting this in to the previous equation we have , and thus ζ2 − a4 + 2a2a > 0.
We now utilize the above analysis to show how to choose a “small” b. Since the curve C(b, z) has positive rank, then it has an infinite number of rational points. The curve is obviously symmetric about the b-axis, and it is easy to check that it does not intersect the b-axis. Thus the number of connected components (over ) is one. In particular, we can conclude there are an infinite number of rational points with z > 0. By the density of rational points on positive rank curves (see Th. 5 Ch. 11 of [45]), we can choose a rational b0 with 0 < b0 < ϵ < a (for any ϵ < min{a, }) yielding a rational point on C(b0, z0). As seen in the analysis above, the point (0, ) lies beneath the hyperbola z = (aζ)/b and above the line z = (ζ/a)b, hence the same is true for (b0, z0). Thus with this choice of (b0, z0) (for small enough ϵ), we see that both c and d are positive.
In fact, this argument shows we have an infinite number of possibilities for positive b, c, and d. The cyclic quadrilateral with side lengths (a, b, c, d) will then correspond to Eα,−n2 since the equations (3.5) and (3.6) are satisfied. This completes the proof. □
We remark that while the proof showing the existence of a cyclic quadrilateral is not completely constructive (since we require c, d > 0), in practice it is not hard to produce the cyclic quadrilaterals. Start with two points P1 and P2, which are not of order 2 (and whose sum is P1 + P2 is also not of order 2). Write Pi = (xi, yi), and set a = y1/x1, b = −y2/x2. Then set P3 = −P1 − P2 = (x3, y3), and d = −y3/x3. By assumption, P3 is not 2-torsion, and hence y3 = 0, so d = 0. By replacing Pi by Pi + (0, 0) or −Pi, we can assume x1 > 0, y1 > 0, x2 < 0, y2 > 0, and x3 < 0, y3 > 0 so that a, b, and d are positive. Then compute c = (x1 + n2/x1 − bd)/a. If we assume the rank of Eα,−n2 is positive, then we will have an infinite number of choices for P1 and P2. From numerical experiments, we have observed that c, as derived above, is usually positive. However, in the case c is negative, we can simply replace P1 and/or P2 until c > 0.
If neither of the points P1, P2 has infinite order, then the cyclic quadrilateral must be of a special form.
Theorem 3.3. If the curve Eα, −n2 arising from a cyclic quadrilateral has rank 0 then the associated quadrilateral is either a square, or an isosceles trapezoid with three sides equal (a = b = d) such that (a + c)(3a − c) is a square. The torsion group is for this rank 0 case.
Proof. We will show in the next section that the torsion group is , , , or . We already showed that P1 does not have order 2, hence the torsion group must be either or . We first handle the case of , showing that when the rank is 0, it cannot have come from a cyclic quadrilateral.
Let the three points of order 2 be denoted (0, 0), T1, and T2. The point P1 = (x1, y1) is not a point of order 2, and hence must be a point of order 4. By Lemma 4.1, 2 P1 = (0, 0), and without loss of generality we may take 2P1 = T1. Then the four points which are not of order 2 are {P1, −P1, P1 + (0, 0), −P1 + (0, 0)}, and it must be that P2 = (x2, y2) is one of these points. If P2 = P1, then a = y1/x1 = y2/x2 = −b, a contradiction as a, b > 0. Similarly, if P2 = −P1 + (0, 0) then we again end up with a = −b, a contradiction. If P2 = P1 + (0, 0) then P3 = −(P1 + P2) = −2P1 + (0, 0) = T1 + (0, 0) = T2, however P3 = (x3, y3) is not a point of order 2 since y3 = 0. We can therefore conclude that P2 = −P1, but this is likewise a contradiction because then P3 = −P1 − P2 = ∞. Thus the torsion group for a rank 0 curve Eα, −n2 arising from a cyclic quadrilateral cannot be .
So we can assume the torsion group is . If P1 has order 6, then the set of all rational points of E is {P1, 2P1, 3P1 = (0, 0), 4P1 = P1 + (0, 0), 5P1 = −P1, ∞}. Then
As 2P1 = −4P1 then
Now notice that the ratio of yk/xk for kP1 = (xk, yk) (with k = 1, 2, 4, 5) is either a or −a. But we have P2 = (x, −bx), which must be one of the points P1, 2P1, 4P1, 5P1, and hence we must have a = b (since a, b > 0). Using the doubling formula, we have that the x-coordinate of 2P1 is , (as a = b) which must equal the x-coordinate of P1 + (0, 0) which is (−1/4)(c + d)(2b − c + d). Equating these two x-coordinates requires (c + d)(b + d)/2 = 0, a contradiction. Thus, if the rank is 0 then P1 cannot have order 6.
The only other possibility is that P1 has order 3. Then necessarily Q = P1 + (0, 0) has order 6. The set of all rational points must be {Q = P1 + (0, 0), 2Q = −P1, (0, 0), 4Q = P1 5Q = −P1 + (0, 0), ∞}. Similarly as above, the ratio y/x of the points not equal to (0, 0) or ∞ is equal to ±a. Considering P2, we must have b = a. This means that Q = ((−1/4)(c + d)(2b − c + d), (b/4)(c + d)(2b − c + d)). Using the doubling formula for 2Q, the x-coordinate is (c + d)2/4, which must equal the x-coordinate of −P1 = (1/4)(2b + c − d)(c + d). Equating these two yields (c + d)(b − d) = 0. Thus a = b = d. Checking the area, we see the area will be rational if and only if (a + c)(3a − c) is a square.
We observe that since any cyclic quadrilateral with two non-consecutive sides equal is a trapezoid, we have an isosceles trapezoid (which is not a square) with three sides equal if a = c. If a = c, then we have a square, as a cyclic rhombus must be square. □
So we see that when the rank is 0, the cyclic quadrilateral must have at least three sides equal. We now examine the converse, which is distinguished by whether or not the quadrilateral is a square.
Theorem 3.4. If the quadrilateral is a square, then the rank is 0, with torsion group .
Proof. If the quadrilateral is a square, i.e., a = b = c = d. Then the curve Eα,−n2 is y2 = x3 + a2x2 − a4x. For any a = 0 we can do a change of variables x = a2X, y = a3Y, which shows that this curve is isomorphic to E : Y2 = X3 + X2 − X, which is a curve of rank 0, with six torsion points.
Thus also the curve Eα,−n2 has only 6 rational points. These points are . The point P = (−a2, a3) has exact order 6. The rank of Eα,−n2 is zero. □
The rank need not be 0 for isosceles trapezoids with three sides equal. Take, for example the quadrilateral with side lengths (13, 13, 23, 13), which yields the curve E−11,−2162. This curve has rank 1, with generating point (−196, 1092) and has torsion group . We also remark that we can have rank 0 curves Eα,−n2 with torsion group . Take for example α = 7, n = 12. The previous results prove that such curves do not correspond with a cyclic quadrilateral. If we allow quadrilaterals with d = 0, then it can be shown that these curves come from quadrilaterals with d = 0, i.e. triangles with rational area.
Theorem 3.5. If the quadrilateral is a three-sides-equal trapezoid (a, a, c, a), then the torsion group is .
Proof. If the the quadrilateral is of the form (a, a, c, a), then we have the point which can be checked has order 3. By Corollary 4.5, we immediately have that the torsion group is . □
By scaling the sides of a rational cyclic quadrilateral, we can always assume that area is an integer N (since we are only considering quadrilaterals with rational area). Using the definition of the generalized congruent number elliptic curve and taking into account Theorems 3.3, 3.4, and 3.5, we can restate Theorem 3.1 in the following way.
Theorem 3.6. Every non-square and non-three-sides equal trapezoidal rational cyclic quadrilateral with area gives rise to a generalized congruent number elliptic curve Eα,−N2 with positive rank. Conversely, for any integer N and generalized congruent curve Eα,−N2 with positive rank, there are infinitely many non-rectangular cyclic quadrilaterals.
Proof. Given a non-square and non-three-sides equal trapezoidal cyclic quadrilateral with side lengths (a, b, c, d) and area n = p/q, consider the quadrilateral with side lengths (qa, qb, qc, qd) which has area . By our correspondence in Theorem 3.1, we can construct the curve Eα,(pq)2, where α2 = q2(a2 + b2 − c2 + d2)/2. If the curve were to have rank 0, then by Theorem 3.3 the quadrilateral would have to have 3 sides equal, which it doesn’t. Hence Eα, −(pq)2 has positive rank.
For the converse, given any integer N and α such that Eα −N2 has positive rank, then again by Theorem 3.1 we are able to construct a cyclic quadrilateral with area N. As the rank is positive, we have an infinite number of choices for P1, P2 in the correspondence, yielding an infinite number of cyclic quadrilaterals. If the quadrilateral were to be a rectangle, then b = d. Recall d = yP3/xP3, where P3 = −(P1 + P2). But there are only five points P = (x, y) on E such that y/x = d, so we can choose P1, P2 so as to avoid these five points. □
We conclude this section by noting there are an infinite number of non-rectangular cyclic quadrilaterals with area n, for any rational n. Specifically, consider the isosceles trapezoid (which is necessarily cyclic) with side lengths (j2 + k2, ℓ, j2 + k2, ℓ + 2j2 − 2k2), where j > k. The height of this trapezoid is 2jk, yielding an area of 2jk(ℓ + j2 − k2). Hence, by choosing , the trapezoid will have area n.
4. Torsion points.
In this section, we examine the possible torsion groups T for the curve Eα,−n2, corresponding to a cyclic quadrilateral. By a theorem of Mazur [44], the only possible torsion groups over , , are for n = 1, 2,…, 10, 12 or for 1 ≤ n ≤ 4. The point P2 = (0, 0) has order 2, hence we know the order of the torsion group must be even. We will show that the torsion group must be , , , or . We begin by showing , , or .
Lemma 4.1. There is no point P on the curve Eα,−n2 such that 2P = (0, 0). Consequently, the torsion group , , or .
Proof. Let P = (x, y) be a point on Eα,−n2 such that 2P = (0, 0). By using the formula for doubling a point (see (3.2)), we must have
However, this is clearly impossible, since x2 + n2 > 0. Thus no such point P exists.
Note that if the torsion group were , , or , then there would necessarily have to be a point P with 2P = (0, 0), since (0, 0) would be the unique point of order 2. As this is not possible, then T cannot be any of these three groups. □
Proposition 4.2. There are no points of order 5 on the curve Eα,−n2.
Proof. By an old result, an elliptic curve with a rational point of order 5 will have its j-invariant of the form (s2 + 10s + 5)3/s for some [23]. Calculating the j-invariant of Eα,−n2, we must therefore have
Let w = α2 + 4n2, so that
and write w − n2 = c(s2 + 10s + 5). Simplifying we obtain the (genus 0) curve
with rational point (c, s) = (−n2/32, 9/4). We can parameterize all solutions by , and . Since α2 = w − 4n2 = c(s2 + 10s + 5) − 3n2, we can solve for α2 in terms of m (and n):
This equation will have rational solutions if and only if the curve
has rational points. The curve C is birationally equivalent to the curve
using the maps
With SAGE, we compute that this curve E has rank 0, with only one torsion point (96,0) [48]. This corresponds to having (m, z) = (−1/(6n4), 0), which is thus the only rational point on C. However, this leads to no rational points on the curve relating α2 and n, m. From this we may conclude our initial assumption was not possible. Thus, there are no elliptic curves resulting from cyclic quadrilaterals with rational area which have a point of order 5. □
The previous two lemmas show that if T is cyclic, then T must either be or . We now turn to the case when T is not cyclic, i.e., T has more than one point of order 2. This will occur precisely when x2 + αx − n2 = 0 has a rational root, which happens if and only if the discriminant α2 + 4n2 = a2b2 + a2d2 + b2d2 + 2abcd is a square.
Lemma 4.3. The torsion group T is not .
Proof. Suppose we have a curve with torsion group . Then necessarily we have three 2-torsion points, so we can assume x2 + αx − n2 = (x + M)(x + N), for some rational M, N = 0. The points (0, 0), (−M, 0), and (−N, 0) all have order 2 on Eα,−n2. By a theorem of Ono [[40],Main Theorem 1], the torsion group of Eα,−n2 contains as a subgroup if (i) M and N are both squares, or if (ii) −M and N − M are both squares, or if (iii) −N and M − N are both squares. We show only case (iii) is possible.
Without loss of generality we may take α2+4n2=r2 (with r > 0) and , . For case (i), if M and N are both squares, then so is MN. However, this is a contradiction as MN = −n2 and n > 0. For case (ii), N–M = −r and so cannot be a square (r > 0).
Therefore we must be in case (iii), and we have both −N and M – N = r squares. If we write −N = j2 for some j, then MN = −n2 and so M = −n2/N = n2/j2, hence M is square. By the second part of Ono’s theorem, if then M = u4 − v4 and N = −v4, with u2 + v2 = w2. As M is square then u4 − v4 = z2 for some rational z. This equation is well known to have no non-trivial solutions, i.e. only when M = u4 − v4 = 0. However, this contradicts our initial assumption, and so supposing must have been incorrect. D
Lemma 4.4. The torsion group T is not .
Proof. It is well known that a curve has a point of order 3 if and only if the 3-torsion polynomial ψ3 has a root. For Eα,−n2, this is
or equivalently
| (4.1) |
where w = α/n. In order to have more than one 2-torsion point, we also must have that α2 + 4n2 is a square, or equivalently w2 +4 is a square. We may parameterize to find that w can be written , for some rational j. Substituting this back into (4.1), we see that
This is a genus one curve, birationally equivalent to the curve
via the maps
Using SAGE, we compute the curve E has rank 0, and only the three 2-torsion points (7/3,0), (−2/3,0), (−5/3,0) [48]. Tracing these points back through the substitutions, we get no rational points on the curve C besides (0, 0). Thus, this torsion group is not possible. □
Combining the above series of results, we immediately obtain the following corollary.
Corollary 4.5. Given a cyclic quadrilateral with corresponding elliptic curve Eα,−n2, the torsion group must be , , , or .
Proof. By Mazur’s theorem, we have a finite list of possible torsion groups. We know the torsion group must have order divisible by 2, as the point (0, 0) has order 2. Eliminating the various groups from the previous four lemmas, we have the result. □
We note that all four torsion groups are possible. As we previously showed, any square will have torsion group . For any m > 2, if we let a = m2 – 4 and b = 2m, then the rectangle with side lengths a and b will have torsion group . This follows since the curve is y2 = x(x + m4 − 4m2)(x − 4m2 + 16), and hence has three points of order 2. For an example of curves with torsion group , let α = u4 − 6u2v2 + v4 and n = 2uv(u2 − v2). Then the curve Eα,−n2 will have torsion group with the point (2uv(u + v)2, 2uv(u2 + v2)(u + v)2) having order 4. The most common case for a cyclic quadrilateral is .
It turns out that if the cyclic quadrilateral is a non-square rectangle, we can rule out two of the possible torsion groups.
Proposition 4.6. The elliptic curve arising from a rectangle has a point of order 3 if and only if the rectangle is actually a square.
Proof. By Theorem 3.4, if we begin with a square, the torsion group is . For the converse, suppose we have a curve (arising from a rectangle) which has a point of order 3. The curve equation is y2 = x3 + b2x2 − a2b2x. Under the isomorphism (x, y) → (b2x, b3y), this is the curve y2 = x3 + x2 − Cx, where C = (a/b)2. The three-torsion polynomial for this curve is
and so under our assumption of having a point of order 3, there exists a rational x satisfying Ψ3(x) = 0. Solving for C, in terms of x, we find
We can parameterize rational solutions of 3x2 + x being a square by x = (m − 2)2/(m2 − 3). This makes C either
or
Now, substituting these values into x3 + x2 − Cx, we obtain that both (3m − 5)2 (m − 2)4/(m2 − 3)3 and (m − 1)2 (m – 2)4/(m2 − 3)3 must be squares, or equivalently m2 – 3 must be a square. We can parameterize the rational solutions of m2 − 3 being square by
We substitute this value of m in for C1, and C2, obtaining
Recall that C = (a/b)2 is a square, and hence both C1 and C2 must be as well, leading to the equations
These are both elliptic curves, for which it can be checked that each has rank 0, and exactly 6 torsion points [48]. These are (t, z1) = (2, 0), (3, ±1), (5, ±3) and (t, z2) = (2, 0), (1, ±1), (−1, ±3). Substituting these values of t in and calculating C1 and C2, we find that they lead to C1 = 1 or 0, and the same holds true for C2. Thus C = 0 or 1, which means that a/b = 0 or a/b = 1. As we are assuming ab = 0, then a = b and we have a square. □
Corollary 4.7. Given a non-square rectangle with sides a and b, then or . We get the latter group if and, only if 4a2 + b2 is a square.
Proof. The only torsion group we need to show is not possible is . Assume that contains T. As there are three points of order 2, we must necessarily have 4a2 + b2 is equal to a square, say r2. Then a theorem of Ono [[40], Main Theorem 1], implies that
and are both squares, or
and −br are both squares, or
and br are both squares.
For (i),
Therefore we have which is contradiction. For ii), as b > 0 and we can take r > 0, then −br is not a square. For iii), if , then b4 + 4a2b2 = s4. We may rewrite this as (2a/b)2 = (s/b)4 − 1, since b > 0. The only rational points on the curve are (±1, 0), and as we can assume s > 0, then it must be that s/b = 1. However, if s = b, then we have 4a2b2 = 0, a contradiction.
The corollary now follows immediately from the previous results in this section. □
5. Congruent numbers.
Recall a congruent number is an integer n which is the area of a right triangle with rational sides. It is well known that n is congruent if and only if the elliptic curve y2 = x3 − n2x has a rational point P, which is not of order 2. These congruent curves are a subset of our curves Eα,−n2, with α = 0. If the point P has infinite order, then by the main result of this paper, we can construct a cyclic quadrilateral with area n, and side lengths (a, b, c, d) such that a2 + b2 + d2 = c2. Note by setting d = 0, we get the correspondence between congruent numbers and elliptic curves just mentioned. In this sense, Theorem 3.1 provides a generalization of this congruent number – elliptic curve connection. This gives us the following corollary.
Corollary 5.1. An integer n is congruent if and only if there is a cyclic quadrilateral with area n, and rational side lengths (a, b, c, d) with a2 + b2 + d2 = c2.
This characterization of congruent numbers can be added to the list of the many other known characterizations of congruent numbers. Several of these are given in Koblitz’s book [31]. Given an integer n, it is a well-known open problem to determine whether or not n is congruent. A partial answer is given by Tunnell’s theorem, which gives an easily testable criterion for determining if a number is congruent. However, this result relies on the unproven Birch and Swinnerton-Dyer Conjecture for curves of the form y2 = x3 − n2x. The criterion involves counting the number of integral solutions (x, y, z) to a few Diophantine equations of the form ax2 + by2 + cz2 = n. See [50] for more details.
In the remainder of this section, we give infinite families of congruent number elliptic curves with (at least) rank three. Searching for families of congruent curves with high rank has been done before [18],[19],[42],[43],[51]. Currently, the best known results are a few infinite families with rank at least 3 [30], [43], and several individual curves with rank 7 [51].
5.1. A family of congruent number elliptic curves with rank at least 3.
In order for n to be congruent, we need α = a2 + b2 − c2 + d2 = 0. It is known ([5], Page 79), that we can parameterize the solutions of a2 + b2 − c2 + d2 = 0 by a = p2 + q2 − r2, b = 2pr, c = p2 + q2 + r2, and d = 2qr. By scaling, we can assume that r = 1. The condition that the quadrilateral have rational area is then that
is a square. To simplify a bit, we require both
to be squares. From the first of these equations, we can parameterize the solutions by . We note the bottom expression will be a square if p = q, thus we have . We can scale the resulting sides by so that the area of the resulting quadrilateral is n = z(z − 1)(z + 1). From our correspondence, we have the following points on the curve y2 = x3 − n2x:
It can be checked that P1 = −2P2, hence we only have a rank 1 family. A natural approach to finding more rational points on this curve is to look for factors B of n(z) such that B − n(z)2/B is square. Note that if x3 = 2z2(z + 1), then . Thus we can set to obtain a square. It can be checked (by specializing) that our new point with x-coordinate is linearly independent from P1 (or P2).
We now repeat the process, with (after scaling)
With x4 = −3(t − 1)(t + 1)(t2 + 2)2, then we will obtain another rational point if t2 + 1 is a square. We again parameterize by setting . Checking the factors of n, we did not find any new independent points on the curve.
We summarize the above results. The cyclic quadrilateral with side lengths
has area
The resulting congruent curve y2 = x3 − n2x has three independent points with the following x-coordinates
The points being independent can be checked by specialization – for instance, when w = 2, the height pairing matrix has determinant 43.6831845338168 as computed by SAGE. This family has been previously discovered in [43]. We also note that for w = 14/9 (or w = 5/23, 23/5, 9/14 which all yield the same curve) we obtain a rank 6 curve.
5.2. Other families of rank 3 congruent number curves.
We can find other families with rank 3 using the same technique illustrated in the previous subsection. For example, instead of selecting the particular x4, if we had instead chosen x4 = 6(t − 1)(t + 1)(2t2 + 1)2, then x4 will lead to a rational point if 10t4 − 2t2 − 8 is a square. The equation C : s2 = 10t4 − 2t2 – 8 has the rational point (2, 12), and hence is an elliptic curve. There is a birational transformation from C to the curve E : y2 = x3 + 58x2 + 1440x + 12960, given by t = −(x + 36)/x, s = 36y/x2. The curve E has rank 1, with generator P = (−12, 48). As we have an infinite number of points on E, then we get an infinite number of congruent number curves with 3 independent points. Specifically, given (x, y) on C, let t = −(x + 36)/x, then x4 as defined above will give a rational point on the congruent number curve.
If we start with other parameterizations for (a, b, c, d), it is not hard to find other families of congruent number elliptic curves with rank (at least) 3 using the same techniques. As a final example, let
The area of the cyclic quadrilateral is then
The points arising from the x-coordinates
are linearly independent. If we set
then this will be a point provided that 5t4 + 35t2 + 5 is a square. This is birationally equivalent to the elliptic curve E : y2 − 20xy − 1200y = x3 + 55x2 − 4500x − 247500, which has rank 1. Specifically, given a point (x, y), let t = (30x + 1650)/y − 2, leading us to obtain a third point. Specializing, we see we get an infinite family of rank 3 congruent number curves, arising from the infinite number of points on E.
Both of the examples given in this subsection are new, meaning they have not appeared in the literature before. We find it not too difficult to generate a large number of rank 2 families, which will have a third independent point arising from an associated elliptic curve with positive rank. We did not find any unconditional rank 3 family besides the one given in the previous subsection, nor did we find a family with rank 4. These families could be useful in a new search for congruent curves with high rank. The search performed in [51] used a rank 2 family, and it is possible that new families could lead to more congruent curves with high rank.
6. High rank curves with torsion group .
In this section, we look for infinite families of curves corresponding to cyclic quadrilaterals with high rank, as well as specific curves in these families with high rank. The family of curves Eα,−n2 is a subset of the more general family of elliptic curves with a 2-torsion point. Studying families of elliptic curves with torsion group with high rank has been of much interest, as described in the introduction. The highest known rank for a curve with is 19, due to Elkies [16]. For infinite families, Fermigier found some with rank at least 8. We use our correspondence to find an infinite family with rank 5, and specific curves with ranks as high as 10 (see Table 1 in Section 7).
Table 1.
High rank curves in the family Eu,w from Section 6.1
| u | w | rank |
|---|---|---|
| −84/11 | 29/14 | 10 |
| −63/22 | 97/5 | 10 |
| −62/81 | 32/9 | 10 |
| −60/77 | 22/3 | 10 |
| −53/77 | 31/5 | 10 |
| −47/27 | 45/7 | 10 |
| −32/77 | 49/25 | 10 |
| 7/11 | 3161/4679 | 10 |
| 9/25 | 6091/19600 | 10 |
| 63/85 | 5/97 | 10 |
6.1. An infinite family with rank at least 4.
A quadrilateral with side lengths (a, c + 2, c, a + 2) will have rational area if a(a + 2)c(c + 2) is square. We parameterize the solutions of a(a + 2) being a square by a = −u2/(2u − 2), and similarly set c = v2/(2v + 2). By using the same technique as described in Section 5.1. We find that x3 = u2v(u − 1)(v + 1)(v + 2) will be the x-coordinate of a rational point if . We clear denominators, and repeat the procedure to obtain the following family of rank (at least) 4.
Set
Let the curve Eu,w be defined with this value of α and n2. Then
are all rational x-coordinates of points on Eu,w. If we further set w = (m2 + 2(u − 1)(u2 − 2u + 4)m + 8(u − 1)2)/((u – 1)m2 − 8(u – 1)3), then
will also be a rational x-coordinate of a point on the curve. We performed a computer search to find elliptic curves in the family Eu,w with high rank, and found hundreds of curves with rank 9 and several curves with rank 10 (see Table 1). We remark that other families could be similarly constructed if we begin with different side lengths. Also note that the curves Eu,−w and Eu,1/w both are equivalent to the curve Eu,w.
6.2. A family with rank at least 5.
We conclude this section with a subfamily with rank 5. We search for a fifth point P5, which will be rational if a certain quartic equation in m is a square. Specifically, let x5 = −x4 = −u2(u − 1)(w4 − 1). To yield a rational point, we need that the quartic (in m)
is square. As the coefficient of m4 is square, we may use a technique attributed to Fermat ([15], p. 639) to solve for m in terms of u so that the resulting equation is square. A short calculation finds
Thus, we have a parameterized family with 5 rational points. Specializing (at u = 3 for example), shows the five points are linearly independent, and hence the rank of this family is at least five.
We performed a computer search for high rank curves in the rank 5 family, but the search was not nearly as successful as for the Eu,w family since the size of the coefficients were so large. Note that this rank 5 family is a subset of the Eu,w family anyhow.
7. Examples and Data.
Our starting point for examples of high rank curve is the family of elliptic curves with rank at least 4 from Section 6.1. We use the sieving method based on Mestre-Nagao sums
(see [36, 37]). For curves with large values of S(N, E), we compute the Selmer rank, which is a well-known upper bound for the rank. Specifically we searched for curves E that satisfied the bounds S(523, E) > 20 and S(1979, E) > 28. We combine this information with the conjectural parity for the rank.
Finally, we try to compute the rank and find generators for the best candidates for large rank. We have implemented this procedure in SAGE [48] and PARI [41], using Cremona’s program mwrank [13], for the computation of rank and Selmer rank. In the following table, we present examples of the curves we found with rank 10.
Finally, in Table 2 we present examples of cyclic quadrilaterals with rational area n and associated elliptic curves for positive integers n up to 50. For a given n, there are many cyclic quadrilaterals that we could use, however we chose ones which had numerators and denominators relatively small. Note the rank for all these curves is at least 2.
Table 2.
Transformation from Eα,−n2 to cyclic quadrilateral.
| n | α | rank | [a, b, c, d] |
|---|---|---|---|
| 1 | 5/2 | 2 | [5/6, 1, 5/6, 2] |
| 2 | 1/9 | 2 | [1/3, 4/3, 8/3, 7/3] |
| 3 | 3 | 2 | [3, 1/2, 4, 3/2] |
| 4 | 10 | 2 | [5/3, 2, 5/3, 4] |
| 5 | 1/9 | 2 | [1/3, 7/3, 13/3, 11/3] |
| 6 | 9/40 | 3 | [1,12/5, 2813/680, 447/136] |
| 7 | −7/18 | 2 | [4/3, 7/2, 9/2, 7/3] |
| 8 | 1/4 | 2 | [1/2, 7/2, 31/6, 23/6] |
| 9 | −5/4 | 2 | [2, 5/2, 5, 7/2] |
| 10 | 1 | 2 | [1, 4, 16/3, 11/3] |
| 11 | 1/4 | 2 | [1/2, 13/6, 127/15, 41/5] |
| 12 | 46 | 2 | [1,6,3,8] |
| 13 | 829/4 | 2 | [1/4, 16, 13/4, 13] |
| 14 | 1/4 | 2 | [1/2, 2, 34/3, 67/6] |
| 15 | 15 | 2 | [4, 3/2, 5, 15/2] |
| 16 | 40 | 2 | [10/3, 4, 10/3, 8] |
| 17 | 4 | 2 | [2, 106/39, 8017/1092, 199/28] |
| 18 | 1 | 2 | [1, 4, 8, 7] |
| 19 | 1 | 2 | [1, 17/2, 91/10, 17/5] |
| 20 | 7 | 2 | [4, 7, 22/3, 5/3] |
| 21 | 1/4 | 2 | [1/2, 15/2, 9, 5] |
| 22 | −149/3 | 2 | [3,20/3,40/3,5] |
| 23 | 4 | 3 | [2/5, 2, 383/20, 77/4] |
| 24 | 9/10 | 3 | [2, 24/5, 2813/340, 447/68] |
| 25 | 4/9 | 2 | [2/3, 58/3, 233/12, 23/12] |
| 26 | 64 | 2 | [8, 5, 7/3, 20/3] |
| 27 | 8/5 | 2 | [12/5, 176/35, 597/70, 67/10] |
| 28 | −14/9 | 2 | [8/3, 7, 9, 14/3] |
| 29 | −1/5 | 2 | [437/120, 569/56, 682639/62160, 1139/592] |
| 30 | 4 | 2 | [2, 6, 9, 7] |
| 31 | 4/9 | 2 | [2/3, 1069/24, 32427/728, 66/91] |
| 32 | 1 | 2 | [1, 7, 31/3, 23/3] |
| 33 | −7/4 | 2 | [2, 41/10, 58/5, 21/2] |
| 34 | 2 | 2 | [19/6, 311/36, 352771/35460, 25291/5910] |
| 35 | 385/9 | 2 | [7/3, 35/3, 9, 5] |
| 36 | −5 | 2 | [4, 5, 10, 7] |
| 37 | −4/3 | 2 | [5/6, 9/2, 175/12, 55/4] |
| 38 | 4/9 | 2 | [2/3, 17/3, 197/15, 178/15] |
| 39 | 333/2 | 2 | [9/2, 15, 7/2, 10] |
| 40 | −3 | 2 | [7/3, 6, 34/3, 9] |
| 41 | 4/9 | 3 | [2/3, 98/15, 1427/110, 247/22] |
| 42 | 1 | 3 | [1,9,12,8] |
| 43 | −8/9 | 3 | [104/15, 32/3, 5387/420, 79/84] |
| 44 | −2/3 | 3 | [10/21, 5, 353/21, 16] |
| 45 | 1 | 2 | [1,7,13,11] |
| 46 | 1/4 | 2 | [1/2, 65/2, 2867/88, 205/88] |
| 47 | 4 | 2 | [2/7, 2, 1727/42, 247/6] |
| 48 | 184 | 2 | [2, 16, 6, 12] |
| 49 | 245/6 | 2 | [35/6, 7, 35/6, 14] |
| 50 | 25/9 | 2 | [5/3, 20/3, 40/3, 35/3] |
Acknowledgements:
The authors would like to thank Peter Mueller for the idea behind the proof of Proposition 4.2.
Contributor Information
FARZALI IZADI, Department of Mathematics, Faculty of Science, Urmia University, P. O. Box 165, Urmia 5715799313, Iran.
FOAD KHOSHNAM, Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz 53751-71379, Iran.
DUSTIN MOODY, Computer Security Division, National Institute of Standards & Technology, Gaithersburg, MD 20899-8930.
REFERENCES
- 1.Aguirre J, Castaneda A, Peral JC, High rank elliptic curves with torsion group , Math. Comp, 73 (2003), no. 245, 323–331. [Google Scholar]
- 2.Aguirre J, Lozano-Robledo A and Carlos JC, Elliptic curves of maximal rank, to appear in Rev. Mat. Iberoamericana. [Google Scholar]
- 3.Aguirre J, Peral JC, Elliptic Curves and Biquadrates, Glas. Mat. Ser. III, 48 (2013), no. 68, 49–58. [Google Scholar]
- 4.Alsina C, and Nelsen RB, On the Diagonals of a Cyclic Quadrilateral, Forum Geom, 7 (2007), 147–149. [Google Scholar]
- 5.Andreescu T, Andrica D, Cucurezeanu I, An Introduction to Diophantine Equations: A Problem-Based Approach, Springer-Verlag, New York, 2010. [Google Scholar]
- 6.Bosma W, Cannon J, Playoust C, The Magma algebra system. I. The user language, J. Symbolic Comput, 24 (1997), no. 3–4, 235–265. Online at http://magma.maths.usyd.edu.au. [Google Scholar]
- 7.Bremner A, and Cassels JWS, On the equation Y2 = X(X2 + p), Math. Comp, 42 (1984), 257–264. [Google Scholar]
- 8.Buchholz RH, and Macdougall JA, Heron quadrilaterals with sides in sides in arithmetic or geometric progression, Bull. Austral. Math. Soc, 59 (1999), no. 2, 263–269. [Google Scholar]
- 9.Campbell G, Finding Elliptic Curves and Families of Elliptic Curves over ℚ of Large Rank, PhD Thesis, Rutgers University; (1999). [Google Scholar]
- 10.Chahal JS, Congruent numbers and elliptic curves. Amer. Math. Monthly, 113 (2006), no. 4, 308–317. [Google Scholar]
- 11.Coates JH, Congruent Number Problem, Pure Appl. Math. Q., 1 (2005), no. 1, 14–27. [Google Scholar]
- 12.Coxeter HSM, Samuel L Greitzer, Cyclic Quadrangles; Brahmagupta’s formula, in Geometry Revisited, Math. Assoc. of Amer, (1967), 57–60. [Google Scholar]
- 13.Cremona J, Algorithms for Modular Elliptic Curves, Cambridge University Press, Cambridge, 1997. [Google Scholar]
- 14.Daia L, On a conjecture, Gaz. Math, 89 (1984), 276–279. [Google Scholar]
- 15.Dickson LE, History of the theory of numbers II, Chelsea publishing company, New York, 1971. [Google Scholar]
- 16.Dujella A, http://web.math.pmf.unizg.hr/duje/tors/tors.html.
- 17.Dujella A, http://web.math.pmf.unizg.hr/duje/tors/generic.html.
- 18.Dujella A, Janfada AS and Salami S, A search for high rank congruent number elliptic curves, J. Integer Seq, 12 (2009), Article 09.5.8. [Google Scholar]
- 19.Dujella A, Janfada AS, Peral JC, Salami S, On the high rank π/3 and 2π/3 - congruent number elliptic curves, Rocky Mountain J. Math, to appear. [Google Scholar]
- 20.Fermigier S, Exemples de courbes elliptiques de grand rang sur ℚ(t) et sur ℚ possedant des points d’ordre 2, C. R. Acad. Sci. Paris Ser. I Math, 322 (1996), 949–952. MR 97b:11073 [Google Scholar]
- 21.Fermigier S, Construction of high-rank elliptic curves over ℚ and ℚ(t) with nontrivial 2- torsion, in Algorithmic Number Theory, Springer, Berlin, 1996 (1996). [Google Scholar]
- 22.Fermigier S, Une courbe elliptique definie sur de rang ≥ 22, Acta Arith, 82 (1997), 359–363. MR 98j:11041 [Google Scholar]
- 23.Fricke R, Die elliptischen Funktionen und ihre Anwendungen, Bd. 2 B. G. Teubner, Leipzig, (1922). [Google Scholar]
- 24.Goins EH and Maddox D, Heron Triangles via Elliptic Cuves, Rocky Mountain J. Math, 36 (2006), no. 5, 1511–1526. [Google Scholar]
- 25.Gupta RC, Parameśvara’s rule for the circumradius of a cyclic quadrilateral, Historia Math., 4 (1977), no. 1, 67–74. [Google Scholar]
- 26.Hollier AJ, Spearman BK, and Yang Q, Elliptic curves y2 = x3 + pqx with maximal rank, Int. Math. Forum, 5 (2010), no. 23, 1105–1110. [Google Scholar]
- 27.Ismailescu D, and Vojdany A, Class preserving dissections of convex quadrilaterals, Forum Geom, 9 (2009), 195–211. [Google Scholar]
- 28.Izadi F, Khoshnam F, Moody D, Shamsi A, Elliptic Curves Arising from Brahmagupta Quadrilaterals, Bull. Aust. Math. Soc, 0 (2014), 1–10. [Google Scholar]
- 29.Izadi F, Khoshnam F, Nabardi K, Sum of two biquadrates and elliptic curves of rank ≥ 4, Math. J. Okayama Univ, 56 (2014), 51–63. [Google Scholar]
- 30.Johnstone JA, and Spearman BK, Congruent number elliptic curves with rank at least three, Canad. Math. Bull, 53 (2010), no. 4, 661–666. [Google Scholar]
- 31.Koblitz N, Introduction to Elliptic Curves and Modular Forms, Springer-Verlag, New York, 1984. [Google Scholar]
- 32.Kretschmer T, Construction of elliptic curves with large rank, Math. Comp, 46 (1986), no. 174, 627–635. [Google Scholar]
- 33.Kretschmer T, Konstruktion elliptischer Kurven von hohem Rang, Diploma thesis, Saarbruckern, 1983. [Google Scholar]
- 34.Kudo T, and Motose K, On group structure of some special elliptic curves, Math. J. Okayama Univ, 47 (2005), 81–84. [Google Scholar]
- 35.Maenishi M, On the rank of elliptic curves y2 = x3 − pqx, Kumamoto J. Math, 15 (2002), 1–5. [Google Scholar]
- 36.Mestre JF, Construction de courbes elliptiques sur Q de rang ≥ 12, C. R. Acad. Sci. Paris Ser. I, 295 (1982), no. 12, 643–644. [Google Scholar]
- 37.Nagao KI, An example of elliptic curve over with rank ≥ 20, Proc. Japan Acad. Ser. A Math. Sci, 69 (1993), no. 8, 291–293. [Google Scholar]
- 38.Nagao KI. Construction of high-rank elliptic curves with a nontrivial torsion point. Math. Comp, 66 (1997), no. 217, 411–415. [Google Scholar]
- 39.Ono K, and Ono T, Quadratic form and elliptic curves III, Proc. Japan Acad. Ser. A Math. Sci, 72 (1996), 204–205. [Google Scholar]
- 40.Ono K, Euler’s concordant forms, Acta Arith, 78 (1996), no. 2, 101–123. [Google Scholar]
- 41.PARI/GP, version 2.4.0, Bordeaux, 2008. Online at http://pari.math.u-bordeaux.fr. [Google Scholar]
- 42.Rogers NF, Rank computations for the congruent number elliptic curves. Exp. Math 9, (2000), no. 4, 591–594. [Google Scholar]
- 43.Rubin K, and Silverberg A, Rank Frequencies for Quadratic Twists of Elliptic Curves, Exp. Math 10 (2001), no. 4, 559–569. [Google Scholar]
- 44.Silverman JH, Advanced topics in the arithmetic of elliptic curves, Springer-Verlag, New York, 1994. [Google Scholar]
- 45.Skolem T, Diophantische Gleichungen, Berlin, 1938. [Google Scholar]
- 46.Spearman BK, Elliptic curves y2 = x3 – px of rank two, Math. J. Okayama Univ, 49 (2007), 183–184. [Google Scholar]
- 47.Spearman BK, On the group structure of elliptic curves y2 = x3 – 2px, Int. J. Algebra, 1 (2007), no. 5, 247–250. [Google Scholar]
- 48.Stein WA, et al. Sage mathematics software (version 4.7.2). The Sage Development Team, 2011. Online at http://www.sagemath.org/.
- 49.Thomas P, Maximizing the area of a quadrilateral, College Math. J, 34 (2003), no. 4, 315–316. [Google Scholar]
- 50.Tunnell J, A classical Diophantine problem and modular forms of weight 3/2, Inventiones Math., 72 (1983), 323–334. [Google Scholar]
- 51.Watkins M, Donnelly SR, Elkies ND, Fisher T, Granville A, Rogers NF, On ranks of quadratic twists of elliptic curves, preprint (2012). Available at http://magma.maths.usyd.edu.au/~watkins/papers/RANK7.pdf.
