Method Bezout
extension System.Numerics.BigInteger.Bezout: bigint * bigint -> bigint * bigint * bigint
Computes the GCD of a and b and the coefficients of Bezout's identity using
the extended Euclidean algorithm.
Returns a tuple of (gcd, x, y) so that: ax + by = gcd(a,b).
The returned GCD is always non-negative and gcd(0, 0)=0.
Declaration
extension System.Numerics.BigInteger.Bezout: a:bigint * b:bigint -> bigint * bigint * bigint
Parameters
| Type |
Name |
Description |
| bigint |
a |
|
| bigint |
b |
|
Returns
| Type |
Description |
| bigint * bigint * bigint |
|