olymmath

VMO 2006

Vietnam Mathematical Olympiad 2006.

Other problems

Problem 1

Solve the following system of equations in real numbers: {x2−2x+6⋅log⁡3(6−y)=xy2−2y+6⋅log⁡3(6−z)=yz2−2z+6⋅log⁡3(6−x)=z.\begin{cases} \sqrt{x^2-2x+6}\cdot \log_{3}(6-y) =x \sqrt{y^2-2y+6}\cdot \log_{3}(6-z)=y \sqrt{z^2-2z+6}\cdot\log_{3}(6-x)=z \end{cases}.

Problem 2

Let ABCDABCD be a convex quadrilateral. Take an arbitrary point MM on the line ABAB , and let NN be the point of intersection of the circumcircles of triangles MACMAC and MBCMBC (different from MM ). Prove that:

a) The point NN lies on a fixed circle;

b) The line MNMN passes though a fixed point.

Problem 3

Let mm , nn be two positive integers greater than 3. Consider the table of size m×nm\times n ( mm rows and nn columns) formed with unit squares. We are putting marbles into unit squares of the table following the instructions:

−- each time put 4 marbles into 4 unit squares (1 marble per square) such that the 4 unit squares formes one of the followings 4 pictures (click here to view the pictures).

In each of the following cases, answer with justification to the following question: Is it possible that after a finite number of steps we can set the marbles into all of the unit squares such that the numbers of marbles in each unit square is the same?

a) m=2004m=2004 , n=2006n=2006 ;

b) m=2005m=2005 , n=2006n=2006 .

Attachments:

De thi quoc gia.JPG

Problem 4

Given is the function f(x)=−x+(x+a)(x+b)f(x)=-x+\sqrt{(x+a)(x+b)} , where aa , bb are distinct given positive real numbers. Prove that for all real numbers s∈(0,1)s\in (0,1) there exist only one positive real number α\alpha such that f(α)=as+bs2s.f(\alpha)=\sqrt [s]{\frac{a^s+b^s}{2}} .

Problem 5

Find all polynomyals P(x)P(x) with real coefficients which satisfy the following equality for all real numbers xx : P(x2)+x(3P(x)+P(−x))=(P(x))2+2x2.P(x^2)+x(3P(x)+P(-x))=(P(x))^2+2x^2 .

Problem 6

Let SS be a set of 2006 numbers. We call a subset TT of SS naughty if for any two arbitrary numbers uu , vv (not neccesary distinct) in TT , u+vu+v is not in TT . Prove that

  1. If S={1,2,…,2006}S=\{1,2,\ldots,2006\} every naughty subset of SS has at most 1003 elements;

  2. If SS is a set of 2006 arbitrary positive integers, there exists a naughty subset of SS which has 669 elements.