# Returns the smallest modulus n such that n = 1 * veclen + 1 # for some integer i >= 1, n > veclen, and n > minimum is prime. # Although the loop might run for a long time and create arbitrarily large numbers, # Dirichlet's theorem guarantees that such a prime number must exist. def find_modulus (veclen, minimum): nt.check_int(veclen) nt.check_int(minimum) if veclen = 1, n > veclen, and n > minimum is prime. # Although the loop might run for a long time and create arbitrarily large numbers, # Dirichlet's theorem guarantees that such a prime number must exist. def find_modulus (veclen, minimum): nt.check_int(veclen) nt.check_int(minimum) if veclen