olymmath

CMO 2009

Chinese Mathematical Olympiad 2009.

Day 1

Problem 1

  • Day 1

Given an acute triangle PBCPBC with PB≠PC.PB\neq PC. Points A,DA,D lie on PB,PC,PB,PC, respectively. ACAC intersects BDBD at point O.O. Let E,FE,F be the feet of perpendiculars from OO to AB,CD,AB,CD, respectively. Denote by M,NM,N the midpoints of BC,AD.BC,AD. (1)(1) : If four points A,B,C,DA,B,C,D lie on one circle, then EM⋅FN=EN⋅FM.EM\cdot FN = EN\cdot FM. (2)(2) : Determine whether the converse of (1)(1) is true or not, justify your answer.

Answer, solutions and source

Problem 3

  • Day 1

Given two integers m,nm,n satisfying 4<m<n.4 < m < n. Let A1A2⋯A2n+1A_{1}A_{2}\cdots A_{2n + 1} be a regular 2n+12n+1 polygon. Denote by PP the set of its vertices. Find the number of convex mm polygon whose vertices belongs to PP and exactly has two acute angles.

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Given an integer n>3.n > 3. Let a1,a2,⋯ ,ana_{1},a_{2},\cdots,a_{n} be real numbers satisfying min∣ai−aj∣=1,1≤i≤j≤n.min |a_{i} - a_{j}| = 1, 1\le i\le j\le n. Find the minimum value of ∑k=1n∣ak∣3.\sum_{k = 1}^n|a_{k}|^3.

Answer, solutions and source

Problem 5

  • Day 2

Let PP be a convex nn polygon each of which sides and diagnoals is colored with one of nn distinct colors. For which nn does: there exists a coloring method such that for any three of nn colors, we can always find one triangle whose vertices is of PP ' and whose sides is colored by the three colors respectively.

Answer, solutions and source

Problem 6

  • Day 2

Given an integer n>3.n > 3. Prove that there exists a set SS consisting of nn pairwisely distinct positive integers such that for any two different non-empty subset of SS : A,B,∑x∈Ax∣A∣A,B, \frac {\sum_{x\in A}x}{|A|} and ∑x∈Bx∣B∣\frac {\sum_{x\in B}x}{|B|} are two composites which share no common divisors.

Answer, solutions and source