gh-40085: fix the pycodestyle-minimal linter
    
as this is not longer checked, this breaks at every release, sigh

### 📝 Checklist

- [x] The title is concise and informative.
- [x] The description explains in detail what this PR is about.
    
URL: #40085
Reported by: Frédéric Chapoton
Reviewer(s):

Author: Release Manager

src/sage/arith/misc.py

@@ -3760,11 +3760,13 @@ def CRT_vectors(X, moduli):
     modulus = LCM_list(moduli)
     candidate = [sum(a[i] * X[i][j] for i in range(n)) % modulus
                  for j in range(len(X[0]))]
-    if not res[1] and any((X[i][j] - candidate[j]) % moduli[i] != 0 for i in range(n)
+    if not res[1] and any((X[i][j] - candidate[j]) % moduli[i] != 0
+                          for i in range(n)
         for j in range(len(X[i]))):
             raise ValueError("solution does not exist")
     return candidate
 
+
 def binomial(x, m, **kwds):
     r"""
     Return the binomial coefficient.

src/sage/calculus/calculus.py

@@ -1208,16 +1208,16 @@ def limit(ex, *args, dir=None, taylor=False, algorithm='maxima', **kwargs):
         sage: f = (1 + 1/x)^x
         sage: limit(f, x=oo)
         e
-        sage: limit(f, x, oo) 
+        sage: limit(f, x, oo)
         e
         sage: f.limit(x=5)
         7776/3125
         sage: f.limit(x, 5)
         7776/3125
 
-    The positional ``limit(expr, v, a)`` syntax is particularly useful 
-    when the limit variable ``v`` is an indexed variable or another 
-    expression that cannot be used as a keyword argument 
+    The positional ``limit(expr, v, a)`` syntax is particularly useful
+    when the limit variable ``v`` is an indexed variable or another
+    expression that cannot be used as a keyword argument
     (fixes :issue:`38761`)::
 
         sage: y = var('y', n=3)
@@ -1280,7 +1280,7 @@ def limit(ex, *args, dir=None, taylor=False, algorithm='maxima', **kwargs):
 
         sage: maxima_calculus.eval("domain:real")
         ...
-        sage: f = (1 + 1/x)^x 
+        sage: f = (1 + 1/x)^x
         sage: f.limit(x=1.2).n()
         2.06961575467...
         sage: maxima_calculus.eval("domain:complex");
@@ -1550,19 +1550,19 @@ def limit(ex, *args, dir=None, taylor=False, algorithm='maxima', **kwargs):
         v = args[0]
         a = args[1]
     elif len(args) == 1:
-        if kwargs: 
-             raise ValueError("cannot mix positional specification of limit variable and point with keyword variable arguments")
+        if kwargs:
+            raise ValueError("cannot mix positional specification of limit variable and point with keyword variable arguments")
         else:
-             raise ValueError("three positional arguments (expr, v, a) or one positional and one keyword argument (expr, v=a) required")
-    elif len(args) == 0: # Potential syntax: limit(ex, v=a, ...) or limit(ex)
-        if len(kwargs) == 1: 
+            raise ValueError("three positional arguments (expr, v, a) or one positional and one keyword argument (expr, v=a) required")
+    elif len(args) == 0:  # Potential syntax: limit(ex, v=a, ...) or limit(ex)
+        if len(kwargs) == 1:
             k, = kwargs.keys()
             v = var(k)
             a = kwargs[k]
-        elif len(kwargs) == 0: # For No variable specified at all
-             raise ValueError("invalid limit specification")
-        else: # For Multiple keyword arguments like x=1, y=2
-             raise ValueError("multiple keyword arguments specified")
+        elif len(kwargs) == 0:  # For No variable specified at all
+            raise ValueError("invalid limit specification")
+        else:  # For Multiple keyword arguments like x=1, y=2
+            raise ValueError("multiple keyword arguments specified")
 
     # Ensuring v is a symbolic expression and a valid limit variable
     if not isinstance(v, Expression):
@@ -1586,7 +1586,7 @@ def limit(ex, *args, dir=None, taylor=False, algorithm='maxima', **kwargs):
         raise ValueError("dir must be one of " + ", ".join(map(repr, dir_both)))
 
     # Calling the appropriate backend based on effective_algorithm
-    l = None 
+    l = None
     if effective_algorithm == 'maxima':
         if dir is None:
             l = maxima.sr_limit(ex, v, a)
@@ -1603,7 +1603,7 @@ def limit(ex, *args, dir=None, taylor=False, algorithm='maxima', **kwargs):
             l = maxima.sr_tlimit(ex, v, a, 'minus')
     elif effective_algorithm == 'sympy':
         import sympy
-        sympy_dir = '+-'  
+        sympy_dir = '+-'
         if dir in dir_plus:
             sympy_dir = '+'
         elif dir in dir_minus:
@@ -1620,25 +1620,25 @@ def limit(ex, *args, dir=None, taylor=False, algorithm='maxima', **kwargs):
             fricas_dir_arg = '"left"'
 
         if fricas_dir_arg:
-             l = fricas.limit(f, eq, fricas_dir_arg).sage()
+            l = fricas.limit(f, eq, fricas_dir_arg).sage()
         else:
-             l_raw = fricas.limit(f, eq).sage()
-             if isinstance(l_raw, dict):
-                 l = SR('und')
-             else:
-                 l = l_raw
+            l_raw = fricas.limit(f, eq).sage()
+            if isinstance(l_raw, dict):
+                l = SR('und')
+            else:
+                l = l_raw
     elif effective_algorithm == 'giac':
         from sage.libs.giac.giac import libgiac
         giac_v = v._giac_init_()
         giac_a = a._giac_init_()
-        giac_dir_arg = 0 # Default for two-sided 
+        giac_dir_arg = 0  # Default for two-sided
         if dir in dir_plus:
             giac_dir_arg = 1
         elif dir in dir_minus:
             giac_dir_arg = -1
         l = libgiac.limit(ex, giac_v, giac_a, giac_dir_arg).sage()
     elif effective_algorithm == 'mathematica_free':
-        # Ensuring mma_free_limit exists 
+        # Ensuring mma_free_limit exists
         l = mma_free_limit(ex, v, a, dir)
     else:
         raise ValueError("Unknown algorithm: %s" % effective_algorithm)
@@ -1647,6 +1647,7 @@ def limit(ex, *args, dir=None, taylor=False, algorithm='maxima', **kwargs):
 
     return original_parent(l)
 
+
 # lim is alias for limit
 lim = limit
 

src/sage/combinat/posets/poset_examples.py

@@ -464,7 +464,7 @@ def Crown(n, facade=None):
 
     @staticmethod
     def DivisorLattice(n, facade=None):
-        """
+        r"""
         Return the divisor lattice of an integer.
 
         Elements of the lattice are divisors of `n`, and we have
@@ -539,7 +539,7 @@ def HessenbergPoset(H):
 
     @staticmethod
     def IntegerCompositions(n):
-        """
+        r"""
         Return the poset of integer compositions of the integer ``n``.
 
         A composition of a positive integer `n` is a list of positive