MathDB
Problems
Contests
National and Regional Contests
Poland Contests
Polish MO Finals
1981 Polish MO Finals
4
4
Part of
1981 Polish MO Finals
Problems
(1)
n markers on a table, each of which is denoted by an integer
Source: Polish MO Finals 1981 p4
8/24/2024
On a table are given
n
n
n
markers, each of which is denoted by an integer. At any time, if some two markers are denoted with the same number, say
k
k
k
, we can redenote one of them with
k
+
1
k +1
k
+
1
and the other one with
k
ā
1
k -1
k
ā
1
. Prove that after a finite number of moves all the markers will be denoted with different numbers.
combinatorics