suggested details

Author: fchapoton

src/sage/interfaces/khoca.py

@@ -182,7 +182,7 @@ def prepare_data(data):
         for i in data:
             # i[0]: degree, i[1]: height, i[2]: torsion i[3]: rank
             d, h, t, r = i
-            # make d compatibil with Sage
+            # make d compatible with Sage
             d = int(t / 2) - d
             if (h, d, t) in data_as_dict:
                 data_as_dict[(h, d, t)] += r
@@ -210,6 +210,6 @@ def prepare_data(data):
         if isinstance(red, bool):
             if red:
                 return raw_data['red']
-            else:
-                raise TypeError('reduced must be a boolean')
+        else:
+            raise TypeError('reduced must be a boolean')
     return raw_data['unred']

src/sage/rings/finite_rings/integer_mod_ring.py

@@ -1972,32 +1972,32 @@ def _roots_univariate_polynomial(self, f, ring=None, multiplicities=True, algori
         if deg < 0:
             # All residue classes are roots of the zero polynomial
             return [*map(self, range(self.cardinality()))]
-        elif deg == 0:
+        if deg == 0:
             return []
-        elif deg == 1:
+        if deg == 1:
             # assume form a*x + b
             b, a = f.list()
             if a.is_unit():
                 return [-b * (~a)]
-            else:
-                al, bl = a.lift(), b.lift()
-
-                N = self.order()
-                g = N.gcd(al)
-
-                if bl % g != 0:
-                    return []  # No solution
-                else:
-                    # whole eqn divided by g
-                    N_by_g = N.divide_knowing_divisible_by(g)
-                    a_by_g = al.divide_knowing_divisible_by(g)
-                    _R = Zmod(N_by_g)
-                    assert _R(a_by_g).is_unit()
-
-                    # single root
-                    _root = self(f.roots(_R, multiplicities=False)[0])
-                    inc = self(N_by_g)
-                    return [_root + k * inc for k in range(g)]
+
+            al, bl = a.lift(), b.lift()
+
+            N = self.order()
+            g = N.gcd(al)
+
+            if bl % g != 0:
+                return []  # No solution
+
+            # whole eqn divided by g
+            N_by_g = N.divide_knowing_divisible_by(g)
+            a_by_g = al.divide_knowing_divisible_by(g)
+            _R = Zmod(N_by_g)
+            assert _R(a_by_g).is_unit()
+
+            # single root
+            _root = self(f.roots(_R, multiplicities=False)[0])
+            inc = self(N_by_g)
+            return [_root + k * inc for k in range(g)]
 
         # Finite fields are a base case
         if self.is_field():