Problem 5
Let and be positive integers. Show that if divides , then .
Step 3 of 3: Eliminate bad pairs by minimizing 2x + y
In plain words
Whichever of is larger, either Step 1 shrinks to or Step 2 swaps to , strictly decreasing in both cases.
Detailed analysis
Suppose for contradiction that a bad pair exists, and choose a bad pair minimizing the positive integer . If , Step 1 gives a bad pair with , so , contradicting minimality. If , Step 2 gives the bad pair , for which , again contradicting minimality. Hence no bad pair exists, so forces .