gcdCoefficients(a, b)
This returns a sequence of the form (d, r, s)
, where $d=\gcd(a, b)$ and $r$ and $s$ are the minimal Bézout coefficients satisfying the equation $d = ar + bs$.
It works for integers or elements of polynomial rings in one variable.
|
|
|
|
|
|
|
|
|
The object gcdCoefficients is a method function.
The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/Macaulay2Doc/doc_arithmetic.m2:149:0.