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.
that, for all 
and positive real numbers 
, there is![\[\sum_{i=1}^n \frac{x_i^2}{\sum_{j=1}^i x_j}\geq C \ln n\left(\prod_{i=1}^n x_i\right)^{\frac{1}{n}}\]](http://latex.artofproblemsolving.com/4/8/b/48b9fc4af5a20de7fd9dfc45a74d5aa27e615e46.png)
that satisfy the condition![\[
\frac{1}{x} + \frac{1}{y} + \frac{1}{z} = 3.
\]](http://latex.artofproblemsolving.com/2/7/d/27d266570e3a105a4b416bb7c55904ffabf7a07c.png)
Find the maximum value of the expression![\[
P = \dfrac{yz}{\sqrt[3]{3y^2z^2+ 3x^2y^2z^2+ x^2z^2 + x^2y^2}}
+ \frac{xz}{\sqrt[3]{3x^2z^2 + 3x^2y^2z^2 + x^2y^2 + y^2z^2}}
+ \frac{xy}{\sqrt[3]{3x^2y^2 + 3x^2y^2z^2 +y^2z^2 + x^2z^2}}.
\]](http://latex.artofproblemsolving.com/b/a/f/bafc95e59d2f28dbb4e02771db38ce736e3fd45c.png)
-sequence is a sequence of 
numbers 
each equal to either 
or 
. Determine the largest 
so that, for any -sequence, there exists an integer 
and indices 
so that 
for all 
, and 
and 
such that
be reals such that 
and 
Find the value of 
players take part. Every two play exactly one match. The schedule is such that no two matches are played at the same time, and each player, after taking part in a match, is free in at least 
next (consecutive) matches. Prove that one of the players who play in the opening match will also play in the closing match.
and 
Find the value of 
" in threads
, which is 
.
is written as the sum of not necessarily distinct two-digit numbers. What is the least number of two-digit numbers needed to write this sum?
.
.
s
,
.
.
,
