Number theory explanation about GCD

50 Views Asked by At

" Note that if a and b are not both zero, then the set of common divisors of a and b is a set of integers taht is bounded above by the largest of a, b , -a, -b. Hence, from the greatest integer principle for the integers, the set has the largest element, so GCD of a and b exists and is unique "

I am not sure i understand this.