GaussInt
GIchrem
Chinese remainder algorithm for Gaussian integers
Calling Sequence
Parameters
Description
Examples
GIchrem(a, u)
a
-
list [a_0,a_1,...,a_n] of Gaussian integers
u
list of Gaussian moduli [u_0,u_1,...,u_n]
The chrem(a, u) calling sequence computes the unique integer e such that emodu0=a0modu0,emodu1=a1modu1, ..., emodun=anmodun. The moduli u0,u1,...,un must be pairwise relatively prime.
For a definition, see Chinese remainder theorem.
withGaussInt:
GIchrem5+13I,15−9I,3+4I,7−11I
−17+17I
See Also
chrem
GaussInt[GImcmbine]
Download Help Document