Given two positive integers a and b with greatest common divisor h, there exist integers u and v such that ua + vb = h. The integers u and v can be constructed using the Euclidean algorithm. Bézout’s lemma has significance for the Chinese remainder theorem and for linear Diophantine equations.