olymmath

CMO 2015

Chinese Mathematical Olympiad 2015.

Day 1

Problem 1

  • Day 1

Let z1,z2,...,znz_1,z_2,...,z_n be complex numbers satisfying ∣zi−1∣≤r|z_i - 1| \leq r for some rr in (0,1)(0,1) . Show that

∣∑i=1nzi∣⋅∣∑i=1n1zi∣≥n2(1−r2).\left | \sum_{i=1}^n z_i \right | \cdot \left | \sum_{i=1}^n \frac{1}{z_i} \right | \geq n^2(1-r^2).

Answer, solutions and source

Problem 2

  • Day 1

Let A,B,D,E,F,CA, B, D, E, F, C be six points lie on a circle (in order) satisfy AB=ACAB=AC . Let P=AD∩BE,R=AF∩CE,Q=BF∩CD,S=AD∩BF,T=AF∩CDP=AD \cap BE, R=AF \cap CE, Q=BF \cap CD, S=AD \cap BF, T=AF \cap CD . Let KK be a point lie on STST satisfy ∠QKS=∠ECA\angle QKS=\angle ECA .

Prove that SKKT=PQQR\frac{SK}{KT}=\frac{PQ}{QR}

Answer, solutions and source

Problem 3

  • Day 1

Let n≥5n \geq 5 be a positive integer and let AA and BB be sets of integers satisfying the following conditions:

i) ∣A∣=n|A| = n , ∣B∣=m|B| = m and AA is a subset of BB ii) For any distinct x,y∈Bx,y \in B , x+y∈Bx+y \in B iff x,y∈Ax,y \in A Determine the minimum value of mm .

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Determine all integers kk such that there exists infinitely many positive integers nn not satisfying n+k∣(2nn)n+k |\binom{2n}{n}

Answer, solutions and source

Problem 5

  • Day 2

Given 3030 students such that each student has at most 55 friends and for every 55 students there is a pair of students that are not friends, determine the maximum kk such that for all such possible configurations, there exists kk students who are all not friends.

Answer, solutions and source

Problem 6

  • Day 2

Let a1,a2,...a_1,a_2,... be a sequence of non-negative integers such that for any m,nm,n ∑i=12main≤m.\sum_{i=1}^{2m} a_{in} \leq m. Show that there exist k,dk,d such that ∑i=12kaid=k−2014.\sum_{i=1}^{2k} a_{id} = k-2014.

Answer, solutions and source