The proof demonstrates this by showing that d is a linear combination of a and b. Since any common divisor divides both a and b, it must also divide any integer linear combination of them, including d.
Conditions: d is the least positive linear combination of a and b.; c is a common divisor of a and b.
The proof demonstrates this by showing that d is a linear combination of a and b. Since any common divisor divides both a and b, it must also divide any integer linear combination of them, including d.
Conditions: d is the least positive linear combination of a and b.; c is a common divisor of a and b.