olymmath

CMO 2010

Chinese Mathematical Olympiad 2010.

Day 1

Problem 1

  • Day 1

Let m,n≥1m,n\ge 1 and a1<a2<…<ana_1 < a_2 < \ldots < a_n be integers. Prove that there exists a subset TT of N\mathbb{N} such that ∣T∣≤1+an−a12n+1|T| \leq 1+ \frac{a_n-a_1}{2n+1} and for every i∈{1,2,…,m}i \in \{1,2,\ldots , m\} , there exists t∈Tt \in T and s∈[−n,n]s \in [-n,n] , such that ai=t+sa_i=t+s .

Answer, solutions and source

Problem 3

  • Day 1

Suppose a1,a2,a3,b1,b2,b3a_1,a_2,a_3,b_1,b_2,b_3 are distinct positive integers such that (n+1)a1n+na2n+(n−1)a3n∣(n+1)b1n+nb2n+(n−1)b3n(n + 1)a_1^n + na_2^n + (n - 1)a_3^n|(n + 1)b_1^n + nb_2^n + (n - 1)b_3^n holds for all positive integers nn . Prove that there exists k∈Nk\in N such that bi=kaib_i = ka_i for i=1,2,3i = 1,2,3 .

Answer, solutions and source

Day 2