Solve the following system of equations in real numbers:
VMO 2006
Vietnam Mathematical Olympiad 2006.
Other problems
Let be a convex quadrilateral. Take an arbitrary point on the line , and let be the point of intersection of the circumcircles of triangles and (different from ). Prove that:
a) The point lies on a fixed circle;
b) The line passes though a fixed point.
Let , be two positive integers greater than 3. Consider the table of size ( rows and 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) , ;
b) , .
Attachments:

Given is the function , where , are distinct given positive real numbers. Prove that for all real numbers there exist only one positive real number such that
Find all polynomyals with real coefficients which satisfy the following equality for all real numbers :
Let be a set of 2006 numbers. We call a subset of naughty if for any two arbitrary numbers , (not neccesary distinct) in , is not in . Prove that
-
If every naughty subset of has at most 1003 elements;
-
If is a set of 2006 arbitrary positive integers, there exists a naughty subset of which has 669 elements.