Fix another bug in the modular inverse

2024-10-07 20:54:07 -07:00
parent f154ef9b35
commit e8f351b7b3
2 changed files with 2 additions and 2 deletions
@@ -146,7 +146,7 @@ return a cons of (x . y) such char x * N1 + y * N2 = GCD."
 integer i such that (N * i) mod M = 1."
  (destructuring-bind (gcd (x . y))
      (multiple-value-list (extended-gcd (if (minusp n)
-                                             (+ 26 n)
+                                             (+ m n)
                                             n)
                                         m))
    (declare (ignorable y))