Integers and divisibility

Goal: every $n\ge2$ factors into primes in exactly one way.

Chain: division algorithm → Euclid's algorithm → Bézout ($\gcd = ax + by$) → coprime cancellation → Euclid's lemma → unique factorisation.

Bézout is the hinge: it turns "largest common divisor" into an equation you can calculate with.