[/quote]
,
be a right triangle with a right angle in 
and a circumcenter 
.
and 
,
and 
lie in such a way that 
.
and 
be the projection of 
,
is half as long as 
be an isosceles triangle with 
and circumcircle 
.
perpendicular to 
.
be any point on 
with center 
intersects 
and the circumcircle 
.
and 
,
,
,
.
such that for every 
![\[
f_n(x) = \frac{x}{1 + nx}, \quad \text{if and only if } f(x) = \frac{x}{1 + x}, \quad \forall x \geq 0.
\]](http://latex.artofproblemsolving.com/0/f/c/0fc36d9264eb7e103128c489aeae521a859c1fd4.png)
(For 
represents 
.
be the incentre of a non-equilateral triangle 
be the 
-
be the reflection of 
be the reflection of line 
in 
.
,
and line 
analogously. Let 
where 
is the circumcentre of triangle 
and 
.
.
such that 
is a perfect square and 
is a prime number.
,
,
,![\[ \frac{a^3}{bc} + \frac{b^3}{ca} + \frac{c^3}{ab} \geq a+b+c \]](http://latex.artofproblemsolving.com/9/f/a/9fa6cca20b3620fbb32ee782196e96f6fffa0063.png)
such that for any real value of 
we have:
,
,![\[ f(x)f(yf(x))=f(x+y). \]](http://latex.artofproblemsolving.com/5/6/0/560049dd70944cafa0423e5f1229d215f78215a0.png)
ones are written on a blackboard. Grisha and Gleb are playing game, by taking turns; Grisha goes first. On one move Grisha squares some 
numbers on the board. On his move, Gleb picks a few (perhaps none) numbers on the board and increases each of them by 
.
moves on the board a number divisible by 
appears, Gleb wins, otherwise Grisha wins. Which of the players has a winning strategy?
be a nonempty subset of the points in the Cartesian plane such that for each 
exactly one of 
or 
also belongs to 
there is a line in the plane (possibly different lines for different 
Y by
I found some questions hard to solve by myself, so I went on AoPS
I know that ZetaX said that do not repost questions(https://artofproblemsolving.com/community/c6h135914_zero_tolerance), so I searched on the "Advanced Search". I didn't found it, so I posted it.
However, somebody always founded that I reposted, so I am very...well, upset?
Can anyone tell me how to search problems better on AoPS?
I know that ZetaX said that do not repost questions(https://artofproblemsolving.com/community/c6h135914_zero_tolerance), so I searched on the "Advanced Search". I didn't found it, so I posted it.
However, somebody always founded that I reposted, so I am very...well, upset?
Can anyone tell me how to search problems better on AoPS?
