Given a tuple or list of integers, there are intimate connections between their greatest common divisor or GCD, their collection of common divisors, and their linear combinations. In particular, the smallest positive linear combination is in fact the GCD, the common divisors are the divisors of the GCD, and the linear combinations are the multiples of the GCD. We call this Bézout’s lemma.