Let Then since By the Principle of Well-Ordering, contains a least element To show uniqueness, suppose that and for some By the division algorithm, there exist unique integers and such that where Since and divide both and it must be the case that and both divide Thus, by the minimality of Therefore,