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.
such that 
and 
.
be a given positive real and 
be the set of all positive reals. Find all functions 
such that ![\[f((c+1)x+f(y))=f(x+2y)+2cx \quad \textrm{for all } x,y \in \mathbb{R}_{>0}.\]](http://latex.artofproblemsolving.com/b/0/6/b069e7b7ec1e277f4a4ce85a99434fdb54eb02f3.png)
. Find the minimum and maximum values of 
+ 
+ 
of the vertices of the regular polygon 
we write the number 
and in the remaining ones we write the number 
Let 
be the number written on the vertex 
A vertex is good if ![\[x_i+x_{i+1}+\cdots+x_j>0\quad\text{and}\quad x_i+x_{i-1}+\cdots+x_k>0,\]](http://latex.artofproblemsolving.com/b/f/4/bf4cf984af7f310c1eb90b6b37126bfca9181305.png)
for any integers 
and 
such that 
Note that the indices are taken modulo 
Determine the greatest possible value of such that, regardless of numbering, there always exists a good vertex.
satisfying ![$$(ab+bc+ca)\left[\frac{1}{(a+b)^{2}}+\frac{1}{(b+c)^{2}}+\frac{1}{(c+a)^{2}}\right]\ge \frac{9}{4}+k\cdot\frac{a(a-b)(a-c)+b(b-a)(b-c)+c(c-a)(c-b)}{(a+b+c)^{3}}$$](http://latex.artofproblemsolving.com/f/6/e/f6ed10f7fff1cc94edd8f451e75718a0916a8bfa.png)
holds for all 
be a scalene triangle, 
be the median through 
, and 
be the incircle. Let touch 
at point 
and segment 
meet for the second time at point 
. Let 
be the triangle formed by lines and and the tangent to at . Prove that the incircle of triangle is tangent to the circumcircle of triangle .
be real numbers such that 
Prove that
Where 
Where 
are are the lengths of the sides of a 
gon such that
then![$$(n-2)\left[\sum_{i=1}^{n}{\frac{a_i^2}{(1-a_i)^2}}-\frac n{(n-1)^2}\right]\geq(2n-1)\left(\sum_{i=1}^{n}{\frac{a_i}{1-a_i}}-\frac n{n-1}\right)^2.$$](http://latex.artofproblemsolving.com/9/3/e/93e5529518807b92cd9e0382f5fb07a293128b04.png)
be an acute triangle. Tangents on the circumscribed circle of triangle at points 
and 
intersect at point . Let 
and 
be a foot of the altitudes from onto 
and 
and let 
be the midpoint of . Prove: is the orthocenter of the triangle 
.
cuts 
in half.
moves.
. Then suppose 
and 
correspond to the same state (some distinct values of 
and 
must satisfy this by PHP). Therefore, applying the algorithm 
times to a state returns that state back to itself. This is true no matter what state we are currently at, since every piece is unique on the cube. This means that after algorithms at the beginning, we will return to the solved state.
moves.
and then 
then trivially the puzzle gets resolved after applying this finite sequence of legal moves.
