n markers on a table, each of which is denoted by an integer
Source: Polish MO Finals 1981 p4
August 24, 2024
combinatorics
Problem Statement
On a table are given markers, each of which is denoted by an integer. At any time, if some two markers are denoted with the same number, say , we can redenote one of them with and the other one with . Prove that after a finite number of moves all the markers will be denoted with different numbers.