This theorem identifies the [greatest common divisor](/page/Greatest%20Common%20Divisor) of two integers with the smallest positive integer combination of them. It explains why Bezout identities certify divisibility information and underlies many tests for coprimality.