Properties

Label 210210.et
Number of curves $2$
Conductor $210210$
CM no
Rank $1$
Graph

Related objects

Downloads

Learn more

Show commands: SageMath
Copy content sage:E = EllipticCurve("et1") E.isogeny_class()
 

Rank

Copy content sage:E.rank()
 

The elliptic curves in class 210210.et have rank \(1\).

L-function data

 
Bad L-factors:
Prime L-Factor
\(2\)\(1 - T\)
\(3\)\(1 - T\)
\(5\)\(1 + T\)
\(7\)\(1\)
\(11\)\(1 - T\)
\(13\)\(1 + T\)
 
Good L-factors:
Prime L-Factor Isogeny Class over \(\mathbb{F}_p\)
\(17\) \( 1 - 4 T + 17 T^{2}\) 1.17.ae
\(19\) \( 1 - 8 T + 19 T^{2}\) 1.19.ai
\(23\) \( 1 + 6 T + 23 T^{2}\) 1.23.g
\(29\) \( 1 + 4 T + 29 T^{2}\) 1.29.e
$\cdots$$\cdots$$\cdots$
 
See L-function page for more information

Complex multiplication

The elliptic curves in class 210210.et do not have complex multiplication.

Modular form 210210.2.a.et

Copy content sage:E.q_eigenform(10)
 
\(q + q^{2} + q^{3} + q^{4} - q^{5} + q^{6} + q^{8} + q^{9} - q^{10} + q^{11} + q^{12} - q^{13} - q^{15} + q^{16} + 4 q^{17} + q^{18} + 8 q^{19} + O(q^{20})\) Copy content Toggle raw display

Isogeny matrix

Copy content sage:E.isogeny_class().matrix()
 

The \(i,j\) entry is the smallest degree of a cyclic isogeny between the \(i\)-th and \(j\)-th curve in the isogeny class, in the LMFDB numbering.

\(\left(\begin{array}{rr} 1 & 2 \\ 2 & 1 \end{array}\right)\)

Isogeny graph

Copy content sage:E.isogeny_graph().plot(edge_labels=True)
 

The vertices are labelled with LMFDB labels.

Elliptic curves in class 210210.et

Copy content sage:E.isogeny_class().curves
 
LMFDB label Cremona label Weierstrass coefficients j-invariant Discriminant Torsion structure Modular degree Faltings height Optimality
210210.et1 210210y2 \([1, 0, 0, -136533601, -613763715895]\) \(6975253347115798754407/3981174912000000\) \(160654767797107584000000\) \([2]\) \(58146816\) \(3.3991\)  
210210.et2 210210y1 \([1, 0, 0, -10090081, -5848560439]\) \(2815304098576856167/1263148204032000\) \(50972586208263143424000\) \([2]\) \(29073408\) \(3.0525\) \(\Gamma_0(N)\)-optimal