numlib::igcdmult -- the
extended Euclidean algorithm for integers
IntroductionFor 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...)
Parameterspar1 |
- | integer |
par2,... |
- | integers |
Returnsa list of integers, or the function call with evaluated arguments if some argument is not a number.
Related
Functions
Detailsnumlib::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
1Computing the greatest common divisor of and integers such that :
>> numlib::igcdmult(455,385,165,273)
[1, -7630, 9156, -327, 2]