## `numlib::igcdmult` -- the extended Euclidean algorithm for integers

#### Introduction

For integers `a_1,a_2,...,a_n` `numlib::igcdmult``(a_1,a_2,...,a_n)` returns a list `[d,v_1,...,v_n]` of integers such that `d` is the nonnegative greatest common divisor of `a_1,a_2,...,a_n` and `d = a_1*v_1 + a_2*v_2 + ...+ a_n*v_n`.

#### Call(s)

`numlib::igcdmult(par1,par2...)`

#### Parameters

`par1` | - | integer
`par2,...` | - | integers

#### Returns

a list of integers, or the function call with evaluated arguments if some argument is not a number.

#### Related Functions

`igcd`, `igcdex`

#### Details

- `numlib::igcdmult` is an extension of the kernel function `igcdex`.
- `numlib::igcdmult` returns an error if the arguments evaluate to numbers which are not all of the correct type.

#### Example 1

Computing the greatest common divisor of and integers such that :

    >> numlib::igcdmult(455,385,165,273)

                             [1, -7630, 9156, -327, 2]

#### Changes

- no changes

Do you have questions or comments?
Copyright © SciFace Software GmbH & Co. KG 2000