[/quote]
,
,
and 
be pairwise distinct nonnegative real numbers. Prove that![\[
(a + b + c) \left( \frac{a}{(b - c)^2} + \frac{b}{(c - a)^2} + \frac{c}{(a - b)^2} \right) > 4.
\]](http://latex.artofproblemsolving.com/2/0/9/209f9807481e7a1e97f023bf65a603cb462c62cb.png)
(Karl Czakler)
that can be written in the form![\[
n = \frac{a^2 - b^2}{b},
\]](http://latex.artofproblemsolving.com/f/9/0/f90a3ce2e1b51d6e1cb53a15cad6f36c2b30492a.png)
where 
are written on a board. In each move, two numbers are selected such that their difference is also present on the board. This difference is then erased from the board. (For example, if the numbers 
and 
are on the board, then 
can be erased as 
,
,
as 
.
be an acute triangle with 
.
be the centroid of triangle 
and let 
be the foot of the perpendicular from 
to side 
.
intersects the circumcircle 
of triangle 
.
be the point where 
intersects the circle 
,
and 
n
t
hats, numbered from 
hats. After that, each wise man (in turn: first the first, then the second, etc.) loudly calls a number, trying to guess the number of his hat. The numbers mentioned should not be repeated. When all the wise men have spoken, they take off their hats and check which one of them has guessed. Can the sages to act in such a way that at least three of them knowingly guessed?
.![\[\sqrt{2-a}+\sqrt{2-b}+\sqrt{2-c}\geqslant 2+\sqrt{(2-a)(2-b)(2-c)}.\]](http://latex.artofproblemsolving.com/3/e/4/3e4b336137b17e55bf172d45bd18fe6d5561a827.png)
be positive real numbers such that : 
. Prove that : 
be real numbers such that 
.![\[
3 + (2 - \sqrt{3}) \cdot \frac{(b-c)^2}{b+(\sqrt{3}-1)c} \leq a+b+c
\]](http://latex.artofproblemsolving.com/5/a/8/5a83eaa7470bcca6546599ff4e296e4efec69b16.png)
and determine all the cases when the equality occurs.
.
at point 
at 
.
is tangent to 
,
.
divides 
,
,
,
,
,
initially contains one coin. The following operations are allowed
,
,
;
,
,
and 
.
coins.
and 
.
,
is a subset of 
.
![\[ f(x)=x^n+a_{1}x^{n-1}+a_{2}x^{n-2}+\cdots+a_{n-1}x+a_n \]](http://latex.artofproblemsolving.com/0/9/d/09d80fe5c25c5c6ea57c545b68c7e11b319cbada.png)
with integer coefficients 
,
such that ![\[ f(a)=f(b)=f(c)=f(d)=5, \]](http://latex.artofproblemsolving.com/8/2/d/82d0c5d0c7a6dd48802ad8fbe04b211278c1fa58.png)
show that there is no integer 
such that 
.
be positive real numbers so that 
.![\[ \left( a - 1 + \frac 1b \right) \left( b - 1 + \frac 1c \right) \left( c - 1 + \frac 1a \right) \leq 1.
\]](http://latex.artofproblemsolving.com/7/6/e/76e794a62090c8c4b5f3a70ad4d036669418ca69.png)
Y by
In the plane, 
points are marked, no three of which are collinear. All possible segments between them are drawn. Grisha assigned to each drawn segment a real number with absolute value no greater than 
. For every group of 
marked points, he calculated the sum of the numbers on all 
connecting segments. It turned out that the absolute value of each such sum is at least 
, and there are both positive and negative such sums. What is the maximum possible value of ?
points are marked, no three of which are collinear. All possible segments between them are drawn. Grisha assigned to each drawn segment a real number with absolute value no greater than 
. For every group of 
marked points, he calculated the sum of the numbers on all 
connecting segments. It turned out that the absolute value of each such sum is at least 
, and there are both positive and negative such sums. What is the maximum possible value of ?This post has been edited 2 times. Last edited by egxa, Apr 21, 2025, 7:22 PM
points such that the sums corr. to 
,
be the sum corresponding to the subset of 
.
and 
.
be the sum over all segments 
with: 
,
,
By switching the roles of positive and negative, we also get 
we have 
.
or 
then 
.
then 
.
.
,
or 
to all remaining segments. In this construction, the sum over any 
.
.
