e-integer-gcd
▸ function eGcdInt
(a: number[], b: number[]): number[]
Defined in gcd/expansion/e-integer-gcd.ts:19
Computes the greatest common divisor of two integers a and b, using the Euclidean Algorithm.
precondition a, b must be integers given as Shewchuk expansions
Parameters:
| Name | Type |
|---|---|
a | number[] |
b | number[] |
Returns: number[]