Can anybody help with this statement: "Accordingly consider the set of all natural numbers of the form ax + by
with x, y in Z. The set is not empty since, for instance, it contains a and b;
hence there is a least member d, say. Now d = ax + by for some integers x, y,
whence every common divisor of a and b certainly divides d. Further, by the
division algorithm, we have a = dq + r for some q, r in Z with 0 ≤ r < d; this
gives r = ax' + by' , where x' = 1 − q x and y' = −qy. Thus, from the minimal