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.
. 
amount of people stand on coordinates 
where 
. Every person got a water cup and two people are considered to be neighbour if the distance between them is 
. At the first minute, the person standing on coordinates 
got litres of water, and the other 
people's water cup is empty. Every minute, two neighbouring people are chosen that does not have the same amount of water in their water cups, and they equalize the amount of water in their water cups. will not have more than 
litres of water.
be an integer. You have two 
boards. Each board contains the numbers to inclusive, one number per square, arbitrarily arranged on each board. A move consists of exchanging two rows or two columns on the first board (no moves can be made on the second board). Show that it is possible to make a sequence of moves such that for all 
and 
, the number that is in the 
row and 
column of the first board is different from the number that is in the row and column of the second board.
be a convex pentagon such that![\[ \angle BAC = \angle CAD = \angle DAE\qquad \text{and}\qquad \angle ABC = \angle ACD = \angle ADE.
\]](http://latex.artofproblemsolving.com/d/3/d/d3d9a82f4318190298a8f008d417a364e03f1fca.png)
The diagonals 
and 
meet at 
. Prove that the line 
bisects the side 
.
, with 
, 
is the incenter, 
is the intersection of 
-excircle and 
. Point 
lies on the external angle bisector of 
such that and lieas on the same side of the line 
and 
. Point 
lies on such that 
. Circle 
is tangent to 
and 
at 
, circle 
is tangent to and 
at 
and both circles pass through the inside of triangle . if 
is the Midpoint od the arc , which does not contain , prove that lies on the radical axis of and .
be a sequence of positive real numbers, and 
be a positive integer, such that![\[a_n = \max \{ a_k + a_{n-k} \mid 1 \leq k \leq n-1 \} \ \textrm{ for all } \ n > s.\]](http://latex.artofproblemsolving.com/f/1/2/f12c9c5e0f154549118a33a2f359329333f432a7.png)
and 
, such that![\[a_n = a_{\ell} + a_{n - \ell} \ \textrm{ for all } \ n \geq N.\]](http://latex.artofproblemsolving.com/b/0/b/b0b2bd4507621302eeee27ae50ed9c0afd72c6ef.png)
and on a given circle meet at point . Let be a point on segment and let 
meet the circle again at . The line through 
parallel to intersects at 
. Prove that 
is parallel to if and only if 
.
, and 
be positive real numbers, such that 
. Prove the inequality![\[\frac{x^3}{2 + x} + \frac{y^3}{2 + y} + \frac{z^3}{2 + z} \ge 1.\]](http://latex.artofproblemsolving.com/b/e/5/be5819a67c3cd78f2dea35fdccf48688c720ce3c.png)
When does the equality hold?
of positive integers such that ![\[ k!=(2^n-1)(2^n-2)(2^n-4)\cdots(2^n-2^{n-1}). \]](http://latex.artofproblemsolving.com/3/5/3/353bbb15bac205053c26208af8cac7c32a296f55.png)
Proposed by Gabriel Chicas Reyes, El Salvador
![\[\frac{\operatorname{lcm}(x, y) + \operatorname{lcm}(y, z)}{\operatorname{lcm}(x, z)}\]](http://latex.artofproblemsolving.com/1/e/8/1e8b3e2d9a4d0917ec622449b058702700542f22.png)
for positive integers 
, 
, ?
be prime, let be a positive integer, show that ![\[ \gcd\left({p - 1 \choose n - 1}, {p + 1 \choose n}, {p \choose n + 1}\right) = \gcd\left({p \choose n - 1}, {p - 1 \choose n}, {p + 1 \choose n + 1}\right). \]](http://latex.artofproblemsolving.com/9/d/4/9d409ce186320241eb358b5fbbb8a5a66120899c.png)
be a right triangle with a right angle in and a circumcenter 
. On the sides and , the points 
and lie in such a way that 
. Let and 
be the projection of and on , respectively. Prove that 
is half as long as .
,
,
.![\[\sum_{i=1}^{n}\frac{1}{1+x_{i}}\cdot \sum_{i=1}^{n}x_{i}\leq \sum_{i=1}^{n}\frac{x_{i}^{k+1}}{1+x_{i}}\cdot \sum_{i=1}^{n}\frac{1}{x_{i}^{k}}\]](http://latex.artofproblemsolving.com/2/6/4/264d110e2a40c7f787c650aa8b8dc30af5d28263.png)
and 
for 
.
.
for which 
is divisible by 
.
is divisible by 
