greatest common divisor of Gaussian integers - Maple Help

Online Help

All Products    Maple    MapleSim


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

GaussInt[GIgcd] - greatest common divisor of Gaussian integers

Calling Sequence

GIgcd(x[1], x[2], ..., x[n])

Parameters

x[1], x[2], ..., x[n]

-

Gaussian integers

Description

• 

The GIgcd function computes and returns the first quadrant associate of a gcd of the Gaussian integers x1=a1+Ib1, ..., xn=an+Ibn where the ai's and the bi's are integers.  The first quadrant associate of a Gaussian integer is defined as I5jx where x is a Gaussian integer and j (1..4) is the quadrant containing x (see GInormal).

Examples

withGaussInt:

GIgcd24,12

12

(1)

GIgcd345+515I,1574+368I

41+117I

(2)

See Also

GaussInt[GIgcdex], GaussInt[GIlcm], GaussInt[GInormal]


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