RosettaCodeData/Task/Chinese-remainder-theorem/FunL/chinese-remainder-theorem.funl
2016-12-05 23:44:36 +01:00

7 lines
198 B
Text

import integers.modinv
def crt( congruences ) =
N = product( n | (_, n) <- congruences )
sum( a*modinv(N/n, n)*N/n | (a, n) <- congruences ) mod N
println( crt([(2, 3), (3, 5), (2, 7)]) )