olymmath

CMO 2006

Chinese Mathematical Olympiad 2006.

Day 1

Problem 2

  • Day 1

For positive integers a1,a2,…,a2006a_1,a_2 ,\ldots,a_{2006} such that a1a2,a2a3,…,a2005a2006\frac{a_1}{a_2},\frac{a_2}{a_3},\ldots,\frac{a_{2005}}{a_{2006}} are pairwise distinct, find the minimum possible amount of distinct positive integers in the set {a1,a2,...,a2006}\{a_1,a_2,...,a_{2006}\} .

Answer, solutions and source

Problem 3

  • Day 1

Positive integers k,m,nk, m, n satisfy mn=k2+k+3mn=k^2+k+3 , prove that at least one of the equations x2+11y2=4mx^2+11y^2=4m and x2+11y2=4nx^2+11y^2=4n has an odd solution.

Answer, solutions and source

Day 2

Problem 4

  • Day 2

In a right angled-triangle ABCABC , ∠ACB=90o\angle{ACB} = 90^o . Its incircle OO meets BCBC , ACAC , ABAB at DD , EE , FF respectively. ADAD cuts OO at PP . If ∠BPC=90o\angle{BPC} = 90^o , prove AE+AP=PDAE + AP = PD .

Answer, solutions and source

Problem 6

  • Day 2

Suppose XX is a set with ∣X∣=56|X| = 56 . Find the minimum value of nn , so that for any 15 subsets of XX , if the cardinality of the union of any 7 of them is greater or equal to nn , then there exists 3 of them whose intersection is nonempty.

Answer, solutions and source