Introduction to proof and discrete mathematics

The Euclidean algorithm and Bezout's identity

Replacing a pair by a smaller pair with the same common divisors, why that terminates, and how running the lines backwards writes the answer as a combination.

About 25 minutes6 activities Paper packet