Formula: a x + b y = gcd(a, b)
Arguments
- a
See Usage.
- b
See Usage.
Value
List with gcd, x, y, check (a x + b y), a, b.
References
Bezout (1779), Theorie generale des equations algebriques. Not held
locally; the extended Euclidean algorithm and the identity a x + b y = gcd(a, b) are
standard published results.
Examples
Bezout(240, 46)
#> $gcd
#> [1] 2
#>
#> $x
#> [1] -9
#>
#> $y
#> [1] 47
#>
#> $check
#> [1] 2
#>
#> $a
#> [1] 240
#>
#> $b
#> [1] 46
#>
#> $method
#> [1] "Bezout coefficients (extended Euclid)"
#>
#> attr(,"class")
#> [1] "morie_rich_result" "list"
