Update tests for efficiency and coverage

Author: drago-96

src/sage/schemes/elliptic_curves/mod_poly.py

@@ -85,21 +85,23 @@ def classical_modular_polynomial(l, j=None):
         sage: j = GF(q).random_element()
         sage: l = random_prime(50)
         sage: Y = polygen(parent(j), 'Y')
-        sage: classical_modular_polynomial(l,j) == classical_modular_polynomial(l)(j,Y)
+        sage: classical_modular_polynomial(l, j) == classical_modular_polynomial(l)(j, Y)
         True
         sage: p = 2^216 * 3^137 - 1
-        sage: F.<i> = GF(p^2, modulus=[1,0,1])
+        sage: F.<i> = GF((p,2), modulus=[1,0,1])
         sage: l = random_prime(50)
         sage: j = F.random_element()
         sage: Y = polygen(parent(j), 'Y')
-        sage: classical_modular_polynomial(l,j) == classical_modular_polynomial(l)(j,Y)
+        sage: classical_modular_polynomial(l, j) == classical_modular_polynomial(l)(j, Y)
         True
         sage: E = EllipticCurve(F, [0, 6, 0, 1, 0])
         sage: j = E.j_invariant()
-        sage: classical_modular_polynomial(l,j) == classical_modular_polynomial(l)(j,Y)
+        sage: l = random_prime(50)
+        sage: classical_modular_polynomial(l, j) == classical_modular_polynomial(l)(j, Y)
         True
         sage: R.<Y> = QQ['Y']
         sage: j = QQ(1/2)
+        sage: l = random_prime(50)
         sage: classical_modular_polynomial(l, j) == classical_modular_polynomial(l)(j, Y)
         True
     """