The greatest common divisor of two integers 'a' and 'b' is 'd' if d divides a, d divides b, and any integer that divides a and b is less than or...

The greatest common divisor of two integers 'a' and 'b' is 'd' if d divides a, d divides b, and any integer that divides a and b is less than or equal to d. Express this as a three-place predicate GCD(a,b,d) using only quantifiers, binary connectives, the usual comparison symbols (=, <, etc.) and the divides symbol |.