extendedGcd
extendedGcd<
T>(a,b,domain):BezoutIdentity<T>
Defined in: gcd.ts:51
Extended Euclidean algorithm — computes gcd(a, b) together with the Bézout
coefficients x and y such that a · x + b · y = gcd(a, b).
Type Parameters
Section titled “Type Parameters”T
The carrier set of the domain.
Parameters
Section titled “Parameters”T
First operand.
T
Second operand.
domain
Section titled “domain”Evidence that T admits division with remainder.
Returns
Section titled “Returns”The GCD and its Bézout coefficients.