Function chinese_remainder 

pub fn chinese_remainder(residues: &[u64], moduli: &[u64]) -> Option<u64>

Chinese Remainder Theorem solver.

Given residues r and moduli m, find x such that x ≡ r_i (mod m_i). Returns None if moduli are not pairwise coprime.

Examples

use mathverse_core::integer::chinese_remainder;

let r = chinese_remainder(&[2, 3, 2], &[3, 5, 7]);
assert_eq!(r, Some(23));