Share via

ExtendedGreatestCommonDivisorL function

  • Article

Fully qualified name: Std.Math.ExtendedGreatestCommonDivisorL

function ExtendedGreatestCommonDivisorL(a : BigInt, b : BigInt) : (BigInt, BigInt)

Summary

Returns a tuple (u,v) such that ua+vb=GCD(a,b) Note: GCD is always positive except that GCD(0,0)=0.