This characterization of the gcd has the following trivial (but important) corollary.
Integers a and b are relatively prime if and only if there exist integers x and y such that xa + yb = 1.
A consequence is the following useful result for deducing divisibility of one integer by another.