(related to Corollary: 7.02: Any Divisor Dividing Two Numbers Divides Their Greatest Common Divisor)
If \(\gcd(a,b\)) is the greatest common divisor of \(a\) and \(b\), then it is, by definition, the maximum of all possible common divisors $d\mid a\wedge d\mid b.$
