Replaced lcm with LCM_list. Changed test to see if solution is correct to make sure it works in every case.

Author: Noel Roemmele

src/sage/arith/misc.py

@@ -3757,10 +3757,10 @@ def CRT_vectors(X, moduli):
         raise ValueError("number of moduli must equal length of X")
     res = CRT_basis(moduli, require_coprime_moduli=False)
     a = res[0]
-    modulus = lcm(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] 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