Chinese remainder algorithm for Gaussian integers - Maple Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Group Theory : Numbers : Integer Functions : Gaussian Integers : GaussInt/GIchrem

GaussInt[GIchrem] - Chinese remainder algorithm for Gaussian integers

Calling Sequence

GIchrem(a, u)

Parameters

a

-

list [a_0,a_1,...,a_n] of Gaussian integers

u

-

list of Gaussian moduli [u_0,u_1,...,u_n]

Description

• 

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 .

Examples

withGaussInt:

GIchrem5+13I,159I,3+4I,711I

17+17I

(1)

See Also

chrem, GaussInt[GImcmbine]


Download Help Document

Was this information helpful?



Please add your Comment (Optional)
E-mail Address (Optional)
What is ? This question helps us to combat spam