Subcontests
(7)IMO ShortList 2008, Combinatorics problem 6
For n≥2, let S1, S2, …, S2n be 2n subsets of A \equal{} \{1, 2, 3, \ldots, 2^{n \plus{} 1}\} that satisfy the following property: There do not exist indices a and b with a<b and elements x, y, z∈A with x<y<z and y, z∈Sa, and x, z∈Sb. Prove that at least one of the sets S1, S2, …, S2n contains no more than 4n elements.
Proposed by Gerhard Woeginger, Netherlands IMO ShortList 2008, Algebra problem 4
For an integer m, denote by t(m) the unique number in {1,2,3} such that m \plus{} t(m) is a multiple of 3. A function f:Z→Z satisfies f( \minus{} 1) \equal{} 0, f(0) \equal{} 1, f(1) \equal{} \minus{} 1 and f\left(2^{n} \plus{} m\right) \equal{} f\left(2^n \minus{} t(m)\right) \minus{} f(m) for all integers m, n≥0 with 2n>m. Prove that f(3p)≥0 holds for all integers p≥0.
Proposed by Gerhard Woeginger, Austria IMO ShortList 2008, Number Theory problem 4
Let n be a positive integer. Show that the numbers
\binom{2^n \minus{} 1}{0},\; \binom{2^n \minus{} 1}{1},\; \binom{2^n \minus{} 1}{2},\; \ldots,\; \binom{2^n \minus{} 1}{2^{n \minus{} 1} \minus{} 1}
are congruent modulo 2n to 1, 3, 5, …, 2^n \minus{} 1 in some order.
Proposed by Duskan Dukic, Serbia Permutations and divisibility
Let n∈N and An set of all permutations (a1,…,an) of the set {1,2,…,n} for which
k∣2(a1+⋯+ak), for all 1≤k≤n.
Find the number of elements of the set An.Proposed by Vidan Govedarica, Serbia