Let S be a set of three, not necessarily distinct, positive integers. Show that one can transform S into a set containing 0 by a finite number of applications of the following rule: Select two of the integers x and y, where x≤y and replace them with 2x and y−x. Putnaminvariantcombinatorics