olymmath

CWMO 2006

China Western Mathematical Olympiad 2006.

Other problems

Problem 1

Let nn be a positive integer with n≥2n \geq 2 , and 0<a1,a2,...,an<10<a_{1}, a_{2},...,a_{n}< 1 . Find the maximum value of the sum ∑i=1n(ai(1−ai+1))16\sum_{i=1}^{n}(a_{i}(1-a_{i+1}))^{\frac{1}{6}} where an+1=a1a_{n+1}=a_{1}

Problem 2

Find the smallest positive real kk satisfying the following condition: for any given four DIFFERENT real numbers a,b,c,da,b,c,d , which are not less than kk , there exists a permutation (p,q,r,s)(p,q,r,s) of (a,b,c,d)(a,b,c,d) , such that the equation (x2+px+q)(x2+rx+s)=0(x^{2}+px+q)(x^{2}+rx+s)=0 has four different real roots.

Problem 3

In △PBC\triangle PBC , ∠PBC=60o\angle PBC=60^{o} , the tangent at point PP to the circumcircle gg of △PBC\triangle PBC intersects with line CBCB at AA . Points DD and EE lie on the line segment PAPA and gg respectively, satisfying ∠DBE=90o\angle DBE=90^{o} , PD=PEPD=PE . BEBE and PCPC meet at FF . It is known that lines AF,BP,CDAF,BP,CD are concurrent. a) Prove that BFBF bisect ∠PBC\angle PBC b) Find tan⁡∠PCB\tan \angle PCB

Problem 4

Assuming that the positive integer aa is not a perfect square, prove that for any positive integer n, the sum Sn=∑i=1n{a12}i{S_{n}=\sum_{i=1}^{n}\{a^{\frac{1}{2}}\}^{i}} is irrational.

Problem 5

Let S={n∣n−1,n,n+1S=\{n|n-1,n,n+1 can be expressed as the sum of the square of two positive integers. }\} . Prove that if nn in SS , n2n^{2} is also in SS .

Problem 6

ABAB is a diameter of the circle OO , the point CC lies on the line ABAB produced. A line passing though CC intersects with the circle OO at the point DD and EE . OFOF is a diameter of circumcircle O1O_{1} of △BOD\triangle BOD . Join CFCF and produce, cutting the circle O1O_{1} at GG . Prove that points O,A,E,GO,A,E,G are concyclic.

Problem 7

Let kk be a positive integer not less than 3 and xx a real number. Prove that if cos⁡(k−1)x\cos (k-1)x and cos⁡kx\cos kx are rational, then there exists a positive integer n>kn>k , such that both cos⁡(n−1)x\cos (n-1)x and cos⁡nx\cos nx are rational.

Problem 8

Given a positive integer n≥2n\geq 2 , let B1B_{1} , B2B_{2} , ..., BnB_{n} denote nn subsets of a set XX such that each BiB_{i} contains exactly two elements. Find the minimum value of ∣X∣\left|X\right| such that for any such choice of subsets B1B_{1} , B2B_{2} , ..., BnB_{n} , there exists a subset YY of XX such that: (1) ∣Y∣=n\left|Y\right| = n ; (2) ∣Y∩Bi∣≤1\left|Y \cap B_{i}\right|\leq 1 for every i∈{1,2,...,n}i\in\left\{1,2,...,n\right\} .