Chapter 3 - Greatest Common Divisor
The command gcd(a,b) computes the greatest common divisor of a and b:
6
The command xgcd(a,b) will compute the extended greatest common divisor of a and b as in Example 3.17:
(1, -137, 182)
The command gcd(a,b) computes the greatest common divisor of a and b:
The command xgcd(a,b) will compute the extended greatest common divisor of a and b as in Example 3.17: