The chrem(a, u) calling sequence computes the unique integer e such that $e\mathbf{mod}{u}_0=a_0\mathbf{mod}{u}_0,e\mathbf{mod}{u}_1=a_1\mathbf{mod}{u}_1$, ..., $e\mathbf{mod}{u}_n=a_n\mathbf{mod}{u}_n$. The moduli $u_0,u_1,...,u_n$ must be pairwise relatively prime.

For a definition, see Chinese remainder theorem.

$\mathrm{with}\left(\mathrm{GaussInt}\right)\:$

$\mathrm{GIchrem}\left(\left[5+13\mathrm{I}\,15-9\mathrm{I}\right]\,\left[3+4\mathrm{I}\,7-11\mathrm{I}\right]\right)$

$\mathrm{-17}+17\mathrm{I}$