This a consequence of gcd(ka,kb) = |k|gcd(a,b); after applying the euclidean algorithm to gcd(a,b), multiply each of the lines by |k|, and check that this is a valid sequence of divisions (that is, |k|ri is a valid remainder for each of the divisions). The result follows immediately.