[/quote]
,
be defined on 
.
for any 
is 
.
,
,
,![\[ \frac {1}{a^3 + b^3 + abc} + \frac {1}{b^3 + c^3 + abc} + \frac {1}{c^3 + a^3 + abc} \leq \frac {1}{abc}
\]](http://latex.artofproblemsolving.com/f/a/9/fa964e29de91f0e2f3cb32e335a52d4521bc38fd.png)
w
.![\[ \frac {1}{a^{3}\left(b + c\right)} + \frac {1}{b^{3}\left(c + a\right)} + \frac {1}{c^{3}\left(a + b\right)}\geq \frac {3}{2}.
\]](http://latex.artofproblemsolving.com/b/2/9/b295b0b2a765e41a639657e13b724c60323fa208.png)
.
min
be a triangle. Let 
be the feet of the altitudes from 
respectively. Let 
be the projections of 
.
.
be real numbers such that ![\[ \frac{1}{x^2-1} + \frac{1}{y^2-1} + \frac{1}{z^2-1} = 1. \]](http://latex.artofproblemsolving.com/8/f/5/8f5d49c9b44e3db3cd85fea7b6521e1dc02d4269.png)
Prove that ![\[ \frac{1}{x+1} + \frac{1}{y+1} + \frac{1}{z+1} \le 1. \]](http://latex.artofproblemsolving.com/c/0/4/c0438d6eba686d0a11fd4decb4afa9a14aa50bac.png)
are non-negative integers.
satisfying the following equation:
.
and 
be two sequences defined by:![\[
a_{n+1} = \frac{1 + a_n + a_n b_n}{b_n} \quad \text{and} \quad b_{n+1} = \frac{1 + b_n + a_n b_n}{a_n}
\]](http://latex.artofproblemsolving.com/a/a/0/aa0a5c5acedc990eb345fb50a8395db05307a4e7.png)
for all 
,
and 
.![\[
a_{2024} < 5.
\]](http://latex.artofproblemsolving.com/f/c/a/fca6e6630f33429b5a7ea867d639a2e29ff881f2.png)
children, no two of the same height, lined up. Let us call a pair of different children 
good if between them there is no child whose height is greater than the height of one of 
and 
,
are considered the same pair.)
satisfy 
prove in equality.
, ∀x∈[0,1].
Y by
Let 
be a finite abelian group. There is a magic box 
. At any point, an element of may be added to the box and all elements belonging to the subgroup (of ) generated by the elements currently inside are moved from outside to inside (unless they are already inside). Initially 
contains only the group identity, 
. Alice and Bob take turns moving an element from outside to inside it. Alice moves first. Whoever cannot make a move loses. Find all for which Bob has a winning strategy.
be a finite abelian group. There is a magic box 
. At any point, an element of may be added to the box and all elements belonging to the subgroup (of ) generated by the elements currently inside are moved from outside to inside (unless they are already inside). Initially 
contains only the group identity, 
. Alice and Bob take turns moving an element from outside to inside it. Alice moves first. Whoever cannot make a move loses. Find all for which Bob has a winning strategy.
