AoPS Academy
[/quote]
, do not answer with "
is a solution" only. Either you post any kind of proof or at least something unexpected (like "
is the smallest solution). Someone that does not see that is a solution of the above without your post is completely wrong here, this is an IMO-level forum.
be a positive integer. Consider the following equation: ![\[ \{x\}+\{2x\}+ \dots + \{nx\} = \lfloor x \rfloor + \lfloor 2x \rfloor + \dots + \lfloor 2nx \rfloor\]](http://latex.artofproblemsolving.com/8/2/9/8299b3ceb1650418c0a373536cb1d2931900efd9.png)
a) For 
, solve the given equation in 
., the equation has at most 
real solutions.
, where 
is a real number. Prove that for all positive , 
be a parallelogram. Let line 
externally bisect 
and let 
be the line passing through 
which is parallel to line 
. Suppose that meets line 
at point 
and at point 
, and that meets the internal bisector of 
at point 
. Further let circle 
meet line 
at point 
and the internal bisector of meet circle 
at point 
., , 
, and 
are concyclic.
be an acute-angled triangle, with circumcenter 
, circumradius 
and orthocenter 
. Let 
be a point on 
such that 
. Define 
and 
similarly.
, prove that is equilateral.
be a positive integer. There are two numbers written on a blackboard, one red and one blue. Initially, both are 0. We define the following procedure: at each step, we choose a nonnegative integer 
(not necessarily distinct from the previously chosen ones), and, if the red and blue numbers are 
and 
respectively, we replace them with 
and 
, which we color blue and red (in this order). We keep doing this procedure until the blue number is at least 
.
be the set of all positive integers. Determine all subsets 
of 
such that
then prove \frac{1}{a+b}+\frac{1}{b+c}+\frac{1}{c+a}+\frac{1}{2}\cdot\frac{abc}{ab+bc+ca}\ge \frac{5}{3}.$$
and 
.
