https://en.wikipedia.org/wiki/Chinese_remainder_theorem

chinese_remainder_theorem.py

from operator import mul, add
from functools import reduce
def chinese_remainder_theorem(tuple):
    transpose = list(zip(*tuple))
    product = reduce(mul, transpose[0])
    min_result = reduce(add, [
        j * l *(l%i) for i,j in tuple for l in [reduce(mul, [k for k in transpose[0] if k != i])]
    ]) % product
    print("The value is: %s + n * %s which n = 0..inf" % (min_result, product))
    return min_result, product

Q: one number modulo 3 is 2, modulo 5 is 1, modulo 7 is 4, then what's the value of the number?

> print(chinese_remainder_theorem(((3,2),(5,1),(7,4))))
The value is: 11 + n * 105 which n = 0..inf
(11, 105)

cool~