Apply suggestions from code review

fchapoton · Matthias Köppe · web-flow · commit 9da8cb26d8fe · 2024-06-02T20:14:38.000+02:00
Co-authored-by: Matthias Köppe &lt;mkoeppe@math.ucdavis.edu&gt;
diff --git a/src/sage/coding/code_bounds.py b/src/sage/coding/code_bounds.py
@@ -485,7 +485,7 @@ def elias_upper_bound(n,q,d,algorithm=None):
         def ff(n, d, w, q):
             return r*n*d*q**n/((w**2-2*r*n*w+r*n*d)*volume_hamming(n,q,w))
 
-    I = (i for i in range(1, int(r*n) + 1) if i**2-2*r*n*i+r*n*d > 0)
+    I = (i for i in range(1, int(r*n) + 1) if i**2 - 2*r*n*i + r*n*d > 0)
     bnd = min([ff(n, d, w, q) for w in I])
     return int(bnd)
 
diff --git a/src/sage/modular/cusps_nf.py b/src/sage/modular/cusps_nf.py
@@ -1202,7 +1202,7 @@ def NFCusps_ideal_reps_for_levelN(N, nlists=1):
     """
     k = N.number_field()
     G = k.class_group()
-    L = [[k.ideal(1)] for i in range(nlists)]
+    L = [[k.ideal(1)] for _ in range(nlists)]
     it = k.primes_of_degree_one_iter()
     for I in G.list():
         check = 0
diff --git a/src/sage/sat/converters/polybori.py b/src/sage/sat/converters/polybori.py
@@ -432,8 +432,8 @@ def permutations(length, equal_zero):
         for num_negated in range(length + 1):
             if ((num_negated % 2) ^ ((length + 1) % 2)) == equal_zero:
                 continue
-            start = [1 for i in range(num_negated)]
-            start.extend(-1 for i in range(length - num_negated))
+            start = [1 for _ in range(num_negated)]
+            start.extend(-1 for _ in range(length - num_negated))
             E.extend(Permutations(start))
         return E
 
