Prove that if a and b have a greatest common divisor, it is unique (i.e., they cannot have two greatest common divisors). 1. In Proposition 36.3, we did not require that c  0. Is Proposition 36.3 (and...

Prove that if a and b have a greatest common divisor, it is unique (i.e., they cannot have two greatest common divisors).

1. In Proposition 36.3, we did not require that c
 0. Is Proposition 36.3 (and its proof) correct even in the case c D 0?

2. Suppose a
 b and running Euclid’s Algorithm yields the numbers (in list form)