The following question is related to the families of high rank elliptic curves with torsion subgroup $mathbb{Z}/6mathbb{Z}$.

The SageMath/Python code below produces a list of small fractions $a$ for which $e=sqrt{a(a+1)}$ is a multiple of $sqrt{r}=sqrt{2}$.

```
from time import time
t0 = time()
r = 2
listA = ()
top = 100
for n in range(-top, top + 1):
for d in range(1, top + 1):
if gcd(n,d) == 1:
a = QQ(n) / QQ(d)
e = sqrt(a * (a + 1) / r)
if (e in QQ) and a != -1 and a != 0:
listA.append(a)
print(listA)
print(time() - t0)
```

```
(-98/17, -98/73, -98/89, -98/97, -81/31, -81/49, -81/73, -81/79, -72/23, -72/47, -72/71, -50, -50/41, -50/49, -49/17, -49/31, -49/41, -49/47, -32/7, -32/23, -32/31, -25/7, -25/17, -25/23, -18/17, -9, -9/7, -8/7, -2, 1, 1/7, 1/17, 1/31, 1/49, 1/71, 1/97, 2/7, 2/23, 2/47, 2/79, 8, 8/17, 8/41, 8/73, 9/23, 9/41, 9/89, 18/7, 18/31, 25/7, 25/47, 25/73, 32/17, 32/49, 32/89, 49, 49/23, 49/79, 50/31, 50/71, 72/49, 72/97, 81/17, 81/47, 98/23, 98/71)
1.3610780239105225
```

Given some $a$, I would like to derive a simple formula to produce a different value $b$ in the same list. I would measure the complexity of the formula by the sum $s$ of degrees of its numerator and denominator.

By analyzing the high rank $mathbb{Z}/6mathbb{Z}$ families, three simple formulas were derived to date. Note that these formulas are true for any value of $r$, not just $r=2$.

$(1)$ $b=-frac{(a+1)}{(1-3a)}$; $s=2$

$(2)$ $b=frac{a(a+1)}{(1-3a)}$; $s=3$

$(3)$ $b=-frac{(5a+1)^2}{(3a-1)^2}$; $s=4$

Applying $(2)$ and $(2)$ consecutively:

$(4)$ $b=frac{a(a+1)(a^2-2a+1)}{(-1+6a+3a^2)(-1+3a)}$; $s=7$

For a higher value of $s$:

$(5)$ $b=-frac{(1+2a+5a^2)^2}{(-1+6a+3a^2)^2}$; $s=8$

**My questions:**

- Is it possible to derive some new formula(s) for $sle6$?
- Is there a way to write a smarter/faster code, e.g., by skipping some values of $n$ and/or $d$ for a given value of $r$?