passagemath-schemes 10.5.48__cp312-cp312-musllinux_1_2_aarch64.whl → 10.6.47__cp312-cp312-musllinux_1_2_aarch64.whl

sage/schemes/elliptic_curves/ell_number_field.py

@@ -162,7 +162,7 @@ class EllipticCurve_number_field(EllipticCurve_field):
             [(52 : 111 : 1)]
             sage: EK = E.base_extend(K)
             sage: EK.gens()                                                             # needs eclib
-            [(52 : 111 : 1)]
+            ((52 : 111 : 1),)
         """
         E = super().base_extend(R)
         if isinstance(E, EllipticCurve_number_field):
@@ -1064,7 +1064,7 @@ class EllipticCurve_number_field(EllipticCurve_field):
 
         return self.local_data(P, proof, algorithm).minimal_model()
 
-    def has_good_reduction(self, P):
+    def has_good_reduction(self, P) -> bool:
         r"""
         Return ``True`` if this elliptic curve has good reduction at the prime `P`.
 
@@ -1099,7 +1099,7 @@ class EllipticCurve_number_field(EllipticCurve_field):
         """
         return self.local_data(P).has_good_reduction()
 
-    def has_bad_reduction(self, P):
+    def has_bad_reduction(self, P) -> bool:
         r"""
         Return ``True`` if this elliptic curve has bad reduction at the prime `P`.
 
@@ -1134,7 +1134,7 @@ class EllipticCurve_number_field(EllipticCurve_field):
         """
         return self.local_data(P).has_bad_reduction()
 
-    def has_multiplicative_reduction(self, P):
+    def has_multiplicative_reduction(self, P) -> bool:
         r"""
         Return ``True`` if this elliptic curve has (bad) multiplicative
         reduction at the prime `P`.
@@ -1170,7 +1170,7 @@ class EllipticCurve_number_field(EllipticCurve_field):
         """
         return self.local_data(P).has_multiplicative_reduction()
 
-    def has_split_multiplicative_reduction(self, P):
+    def has_split_multiplicative_reduction(self, P) -> bool:
         r"""
         Return ``True`` if this elliptic curve has (bad) split multiplicative reduction at the prime `P`.
 
@@ -1200,7 +1200,7 @@ class EllipticCurve_number_field(EllipticCurve_field):
         """
         return self.local_data(P).has_split_multiplicative_reduction()
 
-    def has_nonsplit_multiplicative_reduction(self, P):
+    def has_nonsplit_multiplicative_reduction(self, P) -> bool:
         r"""
         Return ``True`` if this elliptic curve has (bad) non-split
         multiplicative reduction at the prime `P`.
@@ -1231,7 +1231,7 @@ class EllipticCurve_number_field(EllipticCurve_field):
         """
         return self.local_data(P).has_nonsplit_multiplicative_reduction()
 
-    def has_additive_reduction(self, P):
+    def has_additive_reduction(self, P) -> bool:
         r"""
         Return ``True`` if this elliptic curve has (bad) additive reduction at
         the prime `P`.
@@ -1296,7 +1296,7 @@ class EllipticCurve_number_field(EllipticCurve_field):
 
         return self.local_data(P, proof).tamagawa_number()
 
-    def tamagawa_numbers(self):
+    def tamagawa_numbers(self) -> list:
         """
         Return a list of all Tamagawa numbers for all prime divisors of the
         conductor (in order).
@@ -1775,7 +1775,7 @@ class EllipticCurve_number_field(EllipticCurve_field):
                  K.ideal(1))
         return Cl(I)
 
-    def has_global_minimal_model(self):
+    def has_global_minimal_model(self) -> bool:
         r"""
         Return whether this elliptic curve has a global minimal model.
 
@@ -1902,7 +1902,7 @@ class EllipticCurve_number_field(EllipticCurve_field):
             y^2 + a*x*y = x^3 + a*x^2 + (3*a+8)*x + (4*a+3) over Number Field
             in a with defining polynomial x^2 - 10 has no global minimal model!
             For a semi-global minimal model use semi_global=True
-            sage: E.global_minimal_model(semi_global=True)
+            sage: E.global_minimal_model(semi_global=True)                              # needs sage.symbolic
             Elliptic Curve defined by
              y^2 + a*x*y = x^3 + a*x^2 + (3*a+8)*x + (4*a+3) over Number Field in a
              with defining polynomial x^2 - 10
@@ -1910,6 +1910,7 @@ class EllipticCurve_number_field(EllipticCurve_field):
         An example of a curve with everywhere good reduction but which
         has no model with unit discriminant::
 
+            sage: # needs sage.symbolic
             sage: x = polygen(QQ)
             sage: K.<a> = NumberField(x^2 - x - 16)
             sage: K.class_number()
@@ -2375,9 +2376,9 @@ class EllipticCurve_number_field(EllipticCurve_field):
             sage: K.<a> = NumberField(x^2 + 23, 'a')
             sage: E = EllipticCurve(K,[0,0,0,101,0])
             sage: E.gens()                                                              # needs eclib
-            [(23831509/8669448*a - 2867471/8669448 : 76507317707/18049790736*a - 424166479633/18049790736 : 1),
+            ((23831509/8669448*a - 2867471/8669448 : 76507317707/18049790736*a - 424166479633/18049790736 : 1),
              (-2031032029/969232392*a + 58813561/969232392 : -15575984630401/21336681877488*a + 451041199309/21336681877488 : 1),
-             (-186948623/4656964 : 549438861195/10049728312*a : 1)]
+             (-186948623/4656964 : 549438861195/10049728312*a : 1))
 
         It can happen that no points are found if the height bounds
         used in the search are too small (see :issue:`10745`)::
@@ -2386,11 +2387,11 @@ class EllipticCurve_number_field(EllipticCurve_field):
             sage: K.<t> = NumberField(x^4 + x^2 - 7)
             sage: E = EllipticCurve(K, [1, 0, 5*t^2 + 16, 0, 0])
             sage: E.gens(lim1=1, lim3=1)
-            []
+            ()
             sage: E.rank()
             1
             sage: gg = E.gens(lim3=13); gg  # long time (about 4s)
-            [(... : 1)]
+            ((... : 1),)
 
         Check that the point found has infinite order, and that it is on the curve::
 
@@ -2405,7 +2406,7 @@ class EllipticCurve_number_field(EllipticCurve_field):
             sage: K.<t> = NumberField(x^2 - 17)
             sage: E = EllipticCurve(K, [-4, 0])
             sage: E.gens()                                                              # needs eclib
-            [(-1/2*t + 1/2 : -1/2*t + 1/2 : 1), (-t + 3 : -2*t + 10 : 1)]
+            ((-1/2*t + 1/2 : -1/2*t + 1/2 : 1), (-t + 3 : -2*t + 10 : 1))
             sage: E.rank()
             2
 
@@ -2417,7 +2418,7 @@ class EllipticCurve_number_field(EllipticCurve_field):
             sage: EK.rank()
             0
             sage: EK.gens()                                                             # needs eclib
-            []
+            ()
 
         IMPLEMENTATION:
 
@@ -2427,10 +2428,10 @@ class EllipticCurve_number_field(EllipticCurve_field):
         PARI/GP scripts from http://www.math.unicaen.fr/~simon/.
         """
         try:
-            return self.gens_quadratic(**kwds)
+            return tuple(self.gens_quadratic(**kwds))
         except ValueError:
             self.simon_two_descent(**kwds)
-            return self._known_points
+            return tuple(self._known_points)
 
     def period_lattice(self, embedding):
         r"""
@@ -3187,7 +3188,7 @@ class EllipticCurve_number_field(EllipticCurve_field):
             sage: c6c = -124369 + 15988*(1 + s)/2
             sage: E = EllipticCurve_from_c4c6(c4, c6)
             sage: Ec = EllipticCurve_from_c4c6(c4c, c6c)
-            sage: E.is_isogenous(Ec)
+            sage: E.is_isogenous(Ec)                                                    # needs sage.symbolic
             True
 
         Check that :issue:`17295` is fixed::
@@ -3198,7 +3199,7 @@ class EllipticCurve_number_field(EllipticCurve_field):
             sage: Ec = EllipticCurve(k, [3*s*(4 - 5*s), -2*s*(2 - 14*s + 11*s^2)])
             sage: EK = E.base_extend(K)
             sage: EcK = Ec.base_extend(K)
-            sage: EK.is_isogenous(EcK)      # long time (about 3.5 s)
+            sage: EK.is_isogenous(EcK)      # long time (about 3.5 s)                   # needs sage.symbolic
             True
         """
         if not isinstance(other, EllipticCurve_generic):
@@ -3596,7 +3597,7 @@ class EllipticCurve_number_field(EllipticCurve_field):
             return ZZ.zero()
 
     @cached_method
-    def has_cm(self):
+    def has_cm(self) -> bool:
         """
         Return whether or not this curve has a CM `j`-invariant.
 
@@ -3637,7 +3638,7 @@ class EllipticCurve_number_field(EllipticCurve_field):
         return not self.cm_discriminant().is_zero()
 
     @cached_method
-    def has_rational_cm(self, field=None):
+    def has_rational_cm(self, field=None) -> bool:
         r"""
         Return whether or not this curve has CM defined over its
         base field or a given extension.
@@ -4194,9 +4195,9 @@ class EllipticCurve_number_field(EllipticCurve_field):
 
             sage: # needs database_cremona_mini_ellcurve
             sage: E = EllipticCurve("11a1")
-            sage: E.rational_points(bound=5)
+            sage: E.rational_points(bound=5)                                            # needs sage.symbolic
             [(0 : 1 : 0), (5 : 5 : 1)]
-            sage: E.rational_points(bound=6) # long time
+            sage: E.rational_points(bound=6)  # long time                               # needs sage.symbolic
             [(0 : 1 : 0), (5 : -6 : 1), (5 : 5 : 1)]
 
         An example over a number field::

sage/schemes/elliptic_curves/ell_point.py

@@ -275,8 +275,8 @@ class EllipticCurvePoint(AdditiveGroupElement,
             ....:     if xs:
             ....:         pts.append(E(choice(xs), y, z))
             sage: P, Q = pts
-            sage: R = P + Q
-            sage: for d in N.divisors():
+            sage: R = P + Q  # not tested (:issue:`39191`)
+            sage: for d in N.divisors():  # not tested (:issue:`39191`)
             ....:     if d > 1:
             ....:         assert R.change_ring(Zmod(d)) == P.change_ring(Zmod(d)) + Q.change_ring(Zmod(d))
         """
@@ -790,7 +790,7 @@ class EllipticCurvePoint_field(EllipticCurvePoint,
 
     additive_order = order
 
-    def __bool__(self):
+    def __bool__(self) -> bool:
         """
         Return ``True`` if this is not the zero point on the curve.
 
@@ -808,7 +808,7 @@ class EllipticCurvePoint_field(EllipticCurvePoint,
         """
         return bool(self._coords[2])
 
-    def has_order(self, n):
+    def has_order(self, n) -> bool:
         r"""
         Test if this point has order exactly `n`.
 
@@ -907,7 +907,7 @@ class EllipticCurvePoint_field(EllipticCurvePoint,
             self._order = n
         return ret
 
-    def has_finite_order(self):
+    def has_finite_order(self) -> bool:
         """
         Return ``True`` if this point has finite additive order as an
         element of the group of points on this curve.
@@ -937,7 +937,7 @@ class EllipticCurvePoint_field(EllipticCurvePoint,
 
     is_finite_order = has_finite_order  # for backward compatibility
 
-    def has_infinite_order(self):
+    def has_infinite_order(self) -> bool:
         """
         Return ``True`` if this point has infinite additive order as an element
         of the group of points on this curve.
@@ -2417,11 +2417,11 @@ class EllipticCurvePoint_field(EllipticCurvePoint,
             raise ValueError("The point P must be n-torsion")
 
         # NOTE: Pari returns the non-reduced Tate pairing, so we
-        # must perform the exponentation ourselves using the supplied
+        # must perform the exponentiation ourselves using the supplied
         # k value
         ePQ = pari.elltatepairing(E, P, Q, n)
         exp = Integer((q**k - 1)/n)
-        return K(ePQ**exp) # Cast the PARI type back to the base ring
+        return K(ePQ**exp)  # Cast the PARI type back to the base ring
 
     def ate_pairing(self, Q, n, k, t, q=None):
         r"""
@@ -2816,7 +2816,7 @@ class EllipticCurvePoint_number_field(EllipticCurvePoint_field):
 
     additive_order = order
 
-    def has_finite_order(self):
+    def has_finite_order(self) -> bool:
         """
         Return ``True`` iff this point has finite order on the elliptic curve.
 
@@ -2839,7 +2839,7 @@ class EllipticCurvePoint_number_field(EllipticCurvePoint_field):
             return True
         return self.order() != oo
 
-    def has_infinite_order(self):
+    def has_infinite_order(self) -> bool:
         r"""
         Return ``True`` iff this point has infinite order on the elliptic curve.
 
@@ -3037,7 +3037,7 @@ class EllipticCurvePoint_number_field(EllipticCurvePoint_field):
         gxdd = gxd.derivative()
         return (e(gxd(self[0])) > 0 and e(gxdd(self[0])) > 0)
 
-    def has_good_reduction(self, P=None):
+    def has_good_reduction(self, P=None) -> bool:
         r"""
         Return ``True`` iff this point has good reduction modulo a prime.
 
@@ -3770,7 +3770,7 @@ class EllipticCurvePoint_number_field(EllipticCurvePoint_field):
 
         Examples 2 and 3 from [Sil1988]_::
 
-            sage: # needs sage.rings.number_field
+            sage: # needs sage.rings.number_field sage.symbolic
             sage: x = polygen(ZZ, 'x')
             sage: K.<i> = NumberField(x^2 + 1)
             sage: E = EllipticCurve(K, [0,0,4,6*i,0]); E
@@ -3783,8 +3783,6 @@ class EllipticCurvePoint_number_field(EllipticCurvePoint_field):
             0
             sage: P.non_archimedean_local_height(K.ideal(1-2*i))
             0
-
-            sage: # needs sage.rings.number_field
             sage: Q = E.lift_x(-9/4); Q
             (-9/4 : 27/8*i - 4 : 1)
             sage: Q.non_archimedean_local_height(K.ideal(1+i))
@@ -3800,13 +3798,13 @@ class EllipticCurvePoint_number_field(EllipticCurvePoint_field):
 
             sage: E = EllipticCurve([0, 0, 0, -36, 0])
             sage: P = E([-3, 9])
-            sage: P.non_archimedean_local_height()
+            sage: P.non_archimedean_local_height()                                      # needs sage.symbolic
             -log(3)
 
         Local heights of torsion points can be nonzero (unlike the
         global height)::
 
-            sage: # needs sage.rings.number_field
+            sage: # needs sage.rings.number_field sage.symbolic
             sage: K.<i> = QuadraticField(-1)
             sage: E = EllipticCurve([0, 0, 0, K(1), 0])
             sage: P = E(i, 0)
@@ -3815,12 +3813,13 @@ class EllipticCurvePoint_number_field(EllipticCurvePoint_field):
 
         TESTS::
 
-            sage: Q.non_archimedean_local_height(prec=100)                              # needs sage.rings.number_field
+            sage: Q.non_archimedean_local_height(prec=100)                              # needs sage.rings.number_field sage.symbolic
             1.3862943611198906188344642429
-            sage: (3*Q).non_archimedean_local_height()                                  # needs sage.rings.number_field
+            sage: (3*Q).non_archimedean_local_height()                                  # needs sage.rings.number_field sage.symbolic
             1/2*log(75923153929839865104)
 
             sage: # needs sage.rings.number_field
+            sage: x = polygen(ZZ, 'x')
             sage: F.<a> = NumberField(x^4 + 2*x^3 + 19*x^2 + 18*x + 288)
             sage: F.ring_of_integers().basis()
             [1, 5/6*a^3 + 1/6*a, 1/6*a^3 + 1/6*a^2, a^3]
@@ -3831,20 +3830,20 @@ class EllipticCurvePoint_number_field(EllipticCurvePoint_field):
             (-1/6*a^2 - 1/6*a - 1 : a : 1)
             sage: P[0].is_integral()
             True
-            sage: P.non_archimedean_local_height()
+            sage: P.non_archimedean_local_height()                                      # needs sage.symbolic
             0
 
         This shows that the bug reported at :issue:`13951` has been fixed::
 
             sage: E = EllipticCurve([0,17])
             sage: P = E(2,5)
-            sage: P.non_archimedean_local_height(2)
+            sage: P.non_archimedean_local_height(2)                                     # needs sage.symbolic
             -2/3*log(2)
 
         This shows that the bug reported at :issue:`36834` (incorrect
         value when the model is not integral) has been fixed::
 
-            sage: # needs sage.rings.number_field
+            sage: # needs sage.rings.number_field sage.symbolic
             sage: K.<a> = QuadraticField(84131656042917)
             sage: E = EllipticCurve(K, [0, 0, 0, -5482707841/48, -244634179112639/864])
             sage: P = E(349189/12, 1/2*a)
@@ -4673,7 +4672,7 @@ class EllipticCurvePoint_finite_field(EllipticCurvePoint_field):
 
         return ZZ(k % p)
 
-    def has_finite_order(self):
+    def has_finite_order(self) -> bool:
         r"""
         Return ``True`` if this point has finite additive order as an element
         of the group of points on this curve.

sage/schemes/elliptic_curves/ell_rational_field.py

@@ -1726,9 +1726,9 @@ class EllipticCurve_rational_field(EllipticCurve_number_field):
             sage: E = EllipticCurve("974b1")
             sage: r = E.rank(); r
             0
-            sage: E.analytic_rank_upper_bound(max_Delta=1, root_number='ignore')
+            sage: E.analytic_rank_upper_bound(max_Delta=1, root_number='ignore')        # needs sage.symbolic
             1
-            sage: E.analytic_rank_upper_bound(max_Delta=1.3, root_number='ignore')
+            sage: E.analytic_rank_upper_bound(max_Delta=1.3, root_number='ignore')      # needs sage.symbolic
             0
 
         Knowing the root number of `E` allows us to use smaller Delta values
@@ -1736,7 +1736,7 @@ class EllipticCurve_rational_field(EllipticCurve_number_field):
 
         ::
 
-            sage: E.analytic_rank_upper_bound(max_Delta=0.6, root_number='compute')
+            sage: E.analytic_rank_upper_bound(max_Delta=0.6, root_number='compute')     # needs sage.symbolic
             0
 
         There are a small number of curves which have pathologically low-lying
@@ -1751,9 +1751,9 @@ class EllipticCurve_rational_field(EllipticCurve_number_field):
             sage: E = EllipticCurve([0, -1, 0, -7460362000712, -7842981500851012704])
             sage: N, r = E.conductor(), E.analytic_rank(); N, r
             (256944, 0)
-            sage: E.analytic_rank_upper_bound(max_Delta=1, adaptive=False)
+            sage: E.analytic_rank_upper_bound(max_Delta=1, adaptive=False)              # needs sage.symbolic
             2
-            sage: E.analytic_rank_upper_bound(max_Delta=2, adaptive=False)
+            sage: E.analytic_rank_upper_bound(max_Delta=2, adaptive=False)              # needs sage.symbolic
             2
 
         This method is can be called on curves with large conductor.
@@ -1761,7 +1761,7 @@ class EllipticCurve_rational_field(EllipticCurve_number_field):
         ::
 
             sage: E = EllipticCurve([-2934,19238])
-            sage: E.analytic_rank_upper_bound()
+            sage: E.analytic_rank_upper_bound()                                         # needs sage.symbolic
             1
 
         And it can bound rank on curves with *very* large conductor, so long as
@@ -1777,7 +1777,7 @@ class EllipticCurve_rational_field(EllipticCurve_number_field):
             sage: E = EllipticCurve([1, -1, 1, a4, a6])
             sage: bad_primes = [2, 3, 5, 7, 11, 13, 17, 19, 48463]
             sage: N = 3455601108357547341532253864901605231198511505793733138900595189472144724781456635380154149870961231592352897621963802238155192936274322687070
-            sage: E.analytic_rank_upper_bound(max_Delta=2.37, adaptive=False,  # long time
+            sage: E.analytic_rank_upper_bound(max_Delta=2.37, adaptive=False,  # long time, needs sage.symbolic
             ....:                             N=N, root_number=1,
             ....:                             bad_primes=bad_primes, ncpus=2)
             32
@@ -2367,6 +2367,15 @@ class EllipticCurve_rational_field(EllipticCurve_number_field):
             sage: P = E.lift_x(10/9)
             sage: set(E.gens()) <= set([P,-P])                          # needs eclib
             True
+
+        Check that :issue:`38813` has been fixed::
+
+            sage: # long time
+            sage: E = EllipticCurve([-127^2,0])
+            sage: l = E.gens(use_database=False, algorithm='pari', pari_effort=4); l   # random
+            [(611429153205013185025/9492121848205441 : 15118836457596902442737698070880/924793900700594415341761 : 1)]
+            sage: a = E(611429153205013185025/9492121848205441, 15118836457596902442737698070880/924793900700594415341761)
+            sage: assert len(l) == 1 and ((l[0] - a).is_finite_order() or (l[0] + a).is_finite_order())
         """
         if proof is None:
             from sage.structure.proof.proof import get_flag
@@ -2419,14 +2428,15 @@ class EllipticCurve_rational_field(EllipticCurve_number_field):
             True
 
             sage: E = EllipticCurve([-127^2,0])
-            sage: E.gens(use_database=False, algorithm='pari',pari_effort=4)   # random, needs eclib
+            sage: E.gens(use_database=False, algorithm='pari', pari_effort=4)   # long time, needs eclib  # random
             [(611429153205013185025/9492121848205441 : 15118836457596902442737698070880/924793900700594415341761 : 1)]
 
         TESTS::
 
+            sage: E = EllipticCurve([-127^2,0])
             sage: P = E.lift_x(611429153205013185025/9492121848205441)
-            sage: ge = set(E.gens(use_database=False, algorithm='pari', pari_effort=4))     # needs eclib
-            sage: ge <= set([P+T for T in E.torsion_points()]                               # needs eclib
+            sage: ge = set(E.gens(use_database=False, algorithm='pari', pari_effort=4))     # long time, needs eclib
+            sage: ge <= set([P+T for T in E.torsion_points()]                               # long time, needs eclib
             ....:        + [-P+T for T in E.torsion_points()])
             True
         """
@@ -3402,7 +3412,7 @@ class EllipticCurve_rational_field(EllipticCurve_number_field):
             self.__tamagawa_product = Integer(self.pari_mincurve().ellglobalred()[2].sage())
             return self.__tamagawa_product
 
-    def real_components(self):
+    def real_components(self) -> int:
         r"""
         Return the number of real components.
 
@@ -3420,7 +3430,7 @@ class EllipticCurve_rational_field(EllipticCurve_number_field):
         """
         return 2 if self.discriminant() > 0 else 1
 
-    def has_good_reduction_outside_S(self, S=None):
+    def has_good_reduction_outside_S(self, S=None) -> bool:
         r"""
         Test if this elliptic curve has good reduction outside ``S``.
 
@@ -4420,7 +4430,7 @@ class EllipticCurve_rational_field(EllipticCurve_number_field):
         else:
             return Integer(e.ellrootno(p))
 
-    def has_cm(self):
+    def has_cm(self) -> bool:
         r"""
         Return whether or not this curve has a CM `j`-invariant.
 
@@ -4486,7 +4496,7 @@ class EllipticCurve_rational_field(EllipticCurve_number_field):
         except KeyError:
             raise ValueError("%s does not have CM" % self)
 
-    def has_rational_cm(self, field=None):
+    def has_rational_cm(self, field=None) -> bool:
         r"""
         Return whether or not this curve has CM defined over `\QQ`
         or the given field.
@@ -6014,7 +6024,7 @@ class EllipticCurve_rational_field(EllipticCurve_number_field):
         The bug reported on :issue:`22719` is now fixed::
 
             sage: E = EllipticCurve("141d1")
-            sage: E.integral_points()                                                   # needs eclib
+            sage: E.integral_points()                                                   # needs eclib sage.symbolic
             [(0 : -1 : 1), (2 : -2 : 1)]
         """
         xmin = pari(xmin)
@@ -6090,7 +6100,7 @@ class EllipticCurve_rational_field(EllipticCurve_number_field):
         ::
 
             sage: E = EllipticCurve([0,0,1,-7,6])
-            sage: a = E.integral_points(both_signs=True); a                             # needs eclib
+            sage: a = E.integral_points(both_signs=True); a                             # needs eclib sage.symbolic
             [(-3 : -1 : 1), (-3 : 0 : 1), (-2 : -4 : 1), (-2 : 3 : 1), (-1 : -4 : 1),
              (-1 : 3 : 1), (0 : -3 : 1), (0 : 2 : 1), (1 : -1 : 1), (1 : 0 : 1),
              (2 : -1 : 1), (2 : 0 : 1), (3 : -4 : 1), (3 : 3 : 1), (4 : -7 : 1),
@@ -6102,7 +6112,7 @@ class EllipticCurve_rational_field(EllipticCurve_number_field):
 
         An example with negative discriminant::
 
-            sage: EllipticCurve('900d1').integral_points()
+            sage: EllipticCurve('900d1').integral_points()                              # needs eclib sage.symbolic
             [(-11 : -27 : 1), (-4 : -34 : 1), (4 : -18 : 1), (16 : -54 : 1)]
 
         Another example with rank 5 and no torsion points::
@@ -6111,29 +6121,29 @@ class EllipticCurve_rational_field(EllipticCurve_number_field):
             sage: P1 = E.point((540,1188)); P2 = E.point((576,1836))
             sage: P3 = E.point((468,3132)); P4 = E.point((612,3132))
             sage: P5 = E.point((432,4428))
-            sage: a = E.integral_points([P1,P2,P3,P4,P5]); len(a)  # long time (18s on sage.math, 2011)
+            sage: a = E.integral_points([P1,P2,P3,P4,P5]); len(a)  # long time (18s on sage.math, 2011), needs sage.symbolic
             54
 
         TESTS:
 
         The bug reported on :issue:`4525` is now fixed::
 
-            sage: EllipticCurve('91b1').integral_points()
+            sage: EllipticCurve('91b1').integral_points()                               # needs eclib sage.symbolic
             [(-1 : -4 : 1), (1 : -1 : 1), (3 : -5 : 1)]
 
         ::
 
-            sage: [len(e.integral_points(both_signs=False)) for e in cremona_curves([11..100])]  # long time (15s on sage.math, 2011)
+            sage: [len(e.integral_points(both_signs=False)) for e in cremona_curves([11..100])]  # long time (15s on sage.math, 2011), needs eclib sage.symbolic
             [2, 0, 2, 3, 2, 1, 3, 0, 2, 4, 2, 4, 3, 0, 0, 1, 2, 1, 2, 0, 2, 1, 0, 1, 3, 3, 1, 1, 4, 2, 3, 2, 0, 0, 5, 3, 2, 2, 1, 1, 1, 0, 1, 3, 0, 1, 0, 1, 1, 3, 6, 1, 2, 2, 2, 0, 0, 2, 3, 1, 2, 2, 1, 1, 0, 3, 2, 1, 0, 1, 0, 1, 3, 3, 1, 1, 5, 1, 0, 1, 1, 0, 1, 2, 0, 2, 0, 1, 1, 3, 1, 2, 2, 4, 4, 2, 1, 0, 0, 5, 1, 0, 1, 2, 0, 2, 2, 0, 0, 0, 1, 0, 3, 1, 5, 1, 2, 4, 1, 0, 1, 0, 1, 0, 1, 0, 2, 2, 0, 0, 1, 0, 1, 1, 4, 1, 0, 1, 1, 0, 4, 2, 0, 1, 1, 2, 3, 1, 1, 1, 1, 6, 2, 1, 1, 0, 2, 0, 6, 2, 0, 4, 2, 2, 0, 0, 1, 2, 0, 2, 1, 0, 3, 1, 2, 1, 4, 6, 3, 2, 1, 0, 2, 2, 0, 0, 5, 4, 1, 0, 0, 1, 0, 2, 2, 0, 0, 2, 3, 1, 3, 1, 1, 0, 1, 0, 0, 1, 2, 2, 0, 2, 0, 0, 1, 2, 0, 0, 4, 1, 0, 1, 1, 0, 1, 2, 0, 1, 4, 3, 1, 2, 2, 1, 1, 1, 1, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 0, 7, 3, 0, 1, 3, 2, 1, 0, 3, 2, 1, 0, 2, 2, 6, 0, 0, 6, 2, 2, 3, 3, 5, 5, 1, 0, 6, 1, 0, 3, 1, 1, 2, 3, 1, 2, 1, 1, 0, 1, 0, 1, 0, 5, 5, 2, 2, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1]
 
         The bug reported at :issue:`4897` is now fixed::
 
-            sage: [P[0] for P in EllipticCurve([0,0,0,-468,2592]).integral_points()]
+            sage: [P[0] for P in EllipticCurve([0,0,0,-468,2592]).integral_points()]    # needs sage.symbolic
             [-24, -18, -14, -6, -3, 4, 6, 18, 21, 24, 36, 46, 102, 168, 186, 381, 1476, 2034, 67246]
 
         See :issue:`22063`::
 
-            sage: for n in [67,71,74,91]:  # long time
+            sage: for n in [67,71,74,91]:  # long time, needs sage.symbolic
             ....:     assert 4*n^6 + 4*n^2 in [P[0] for P in EllipticCurve([0,0,0,2,n^2]).integral_points()]
 
         ALGORITHM:
@@ -6552,31 +6562,31 @@ class EllipticCurve_rational_field(EllipticCurve_number_field):
 
         ::
 
-            sage: a = E.S_integral_points([2,3])                                            # needs eclib
-            sage: len(a)                                                                    # needs eclib
+            sage: a = E.S_integral_points([2,3])                                            # needs eclib sage.symbolic
+            sage: len(a)                                                                    # needs eclib sage.symbolic
             43
 
         An example with negative discriminant::
 
-            sage: EllipticCurve('900d1').S_integral_points([17], both_signs=True)           # needs eclib
+            sage: EllipticCurve('900d1').S_integral_points([17], both_signs=True)           # needs eclib sage.symbolic
             [(-11 : -27 : 1), (-11 : 27 : 1), (-4 : -34 : 1), (-4 : 34 : 1), (4 : -18 : 1),
              (4 : 18 : 1), (2636/289 : -98786/4913 : 1), (2636/289 : 98786/4913 : 1),
              (16 : -54 : 1), (16 : 54 : 1)]
 
         Output checked with Magma (corrected in 3 cases)::
 
-            sage: [len(e.S_integral_points([2], both_signs=False)) for e in cremona_curves([11..100])] # long time (17s on sage.math, 2011)     # needs eclib
+            sage: [len(e.S_integral_points([2], both_signs=False)) for e in cremona_curves([11..100])]  # long time (17s on sage.math, 2011)     # needs eclib sage.symbolic
             [2, 0, 2, 3, 3, 1, 3, 1, 3, 5, 3, 5, 4, 1, 1, 2, 2, 2, 3, 1, 2, 1, 0, 1, 3, 3, 1, 1, 5, 3, 4, 2, 1, 1, 5, 3, 2, 2, 1, 1, 1, 0, 1, 3, 0, 1, 0, 1, 1, 3, 7, 1, 3, 3, 3, 1, 1, 2, 3, 1, 2, 3, 1, 2, 1, 3, 3, 1, 1, 1, 0, 1, 3, 3, 1, 1, 7, 1, 0, 1, 1, 0, 1, 2, 0, 3, 1, 2, 1, 3, 1, 2, 2, 4, 5, 3, 2, 1, 1, 6, 1, 0, 1, 3, 1, 3, 3, 1, 1, 1, 1, 1, 3, 1, 5, 1, 2, 4, 1, 1, 1, 1, 1, 0, 1, 0, 2, 2, 0, 0, 1, 0, 1, 1, 6, 1, 0, 1, 1, 0, 4, 3, 1, 2, 1, 2, 3, 1, 1, 1, 1, 8, 3, 1, 2, 1, 2, 0, 8, 2, 0, 6, 2, 3, 1, 1, 1, 3, 1, 3, 2, 1, 3, 1, 2, 1, 6, 9, 3, 3, 1, 1, 2, 3, 1, 1, 5, 5, 1, 1, 0, 1, 1, 2, 3, 1, 1, 2, 3, 1, 3, 1, 1, 1, 1, 0, 0, 1, 3, 3, 1, 3, 1, 1, 2, 2, 0, 0, 6, 1, 0, 1, 1, 1, 1, 3, 1, 2, 6, 3, 1, 2, 2, 1, 1, 1, 1, 7, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 8, 5, 1, 1, 3, 3, 1, 1, 3, 3, 1, 1, 2, 3, 6, 1, 1, 7, 3, 3, 4, 5, 9, 6, 1, 0, 7, 1, 1, 3, 1, 1, 2, 3, 1, 2, 1, 1, 1, 1, 1, 1, 1, 7, 8, 2, 3, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1]
 
         An example from [PZGH1999]_::
 
             sage: E = EllipticCurve([0,0,0,-172,505])
-            sage: E.rank(), len(E.S_integral_points([3,5,7]))  # long time (5s on sage.math, 2011)      # needs eclib
+            sage: E.rank(), len(E.S_integral_points([3,5,7]))  # long time (5s on sage.math, 2011)      # needs eclib sage.symbolic
             (4, 72)
 
         This is curve "7690e1" which failed until :issue:`4805` was fixed::
 
-            sage: EllipticCurve([1,1,1,-301,-1821]).S_integral_points([13,2])                           # needs eclib
+            sage: EllipticCurve([1,1,1,-301,-1821]).S_integral_points([13,2])                           # needs eclib sage.symbolic
             [(-13 : -4 : 1), (-9 : -12 : 1), (-7 : 2 : 1), (21 : -52 : 1),
              (23 : -76 : 1), (63 : -516 : 1), (71 : -620 : 1), (87 : -844 : 1),
              (2711 : -142540 : 1), (7323 : -630376 : 1), (17687 : -2361164 : 1)]

sage/schemes/elliptic_curves/formal_group.py

@@ -553,7 +553,7 @@ class EllipticCurveFormalGroup(SageObject):
         # note that the following formula differs from the one in Silverman page 119.
         # See github issue 9646 for the explanation and justification.
         t3 = -t1 - t2 - \
-             (a1*lam + a3*lam2 + a2*nu + 2*a4*lam*nu + 3*a6*lam2*nu) /  \
+             (a1*lam + a3*lam2 + a2*nu + 2*a4*lam*nu + 3*a6*lam2*nu) / \
              (1 + a2*lam + a4*lam2 + a6*lam3)
         inv = self.inverse(prec)