MathDB
Problems
Contests
National and Regional Contests
Turkey Contests
Turkey EGMO TST
2015 Turkey EGMO TST
3
3
Part of
2015 Turkey EGMO TST
Problems
(1)
Permutations of (1,2,...,2015)
Source: Turkey EGMO TST 2015 P3
8/7/2016
Given a
2015
2015
2015
-tuple
(
a
1
,
a
2
,
…
,
a
2015
)
(a_1,a_2,\ldots,a_{2015})
(
a
1
,
a
2
,
…
,
a
2015
)
in each step we choose two indices
1
≤
k
,
l
≤
2015
1\le k,l\le 2015
1
≤
k
,
l
≤
2015
with
a
k
a_k
a
k
even and transform the
2015
2015
2015
-tuple into
(
a
1
,
…
,
a
k
2
,
…
,
a
l
+
a
k
2
,
…
,
a
2015
)
(a_1,\ldots,\dfrac{a_k}{2},\ldots,a_l+\dfrac{a_k}{2},\ldots,a_{2015})
(
a
1
,
…
,
2
a
k
,
…
,
a
l
+
2
a
k
,
…
,
a
2015
)
. Prove that starting from
(
1
,
2
,
…
,
2015
)
(1,2,\ldots,2015)
(
1
,
2
,
…
,
2015
)
in finite number of steps one can reach any permutation of
(
1
,
2
,
…
,
2015
)
(1,2,\ldots,2015)
(
1
,
2
,
…
,
2015
)
.
combinatorics