Number Theory GCD and the Euclidean Algorithm Suppose we have two integers a and b. We say that the number d is the greatest common divisor of a and b if and only if, d \mid a and d \mid b and if c \mid a and c \mid b, then c \leq d. Condition 1 says that d is a common July 13, 2019January 26, 2020