Question

gcd of 1269x +132y ​

Answer 1

Every common divisor of a and b is a divisor of gcd(a, b). gcd(a, b), where a and b are not both zero, may be defined alternatively and equivalently as the smallest positive integer d which can be written in the form d = a·p + b·q where p and q are integers.