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.
?
, where the coefficients 
and 
are all irrational numbers.
and a minimum value of 
over the interval ![$[-1, 1]$](http://latex.artofproblemsolving.com/5/c/3/5c3818b9565a33fd3aadba10026d32c5e3eea90f.png)
?
be three positive reals such that 
. Prove that![\[ \frac { x^5-x^2 }{x^5+y^2+z^2} + \frac {y^5-y^2}{x^2+y^5+z^2} + \frac {z^5-z^2}{x^2+y^2+z^5} \geq 0 . \]](http://latex.artofproblemsolving.com/a/1/4/a14adf0f1e35df57c734c7df701d5a67da22dc3c.png)
and orthocenter 
. The foot from to 
is 
respectively. A point 
satisfies that 
and 
are both tangent to 
. A circle passing through 
and tangent to 
intesects at another point 
. 
is an arbitrary point on 
, and 
is the second intesection point of 
and 
.
are concyclic.
so that 
can be a perfect square
be an isosceles triangle with 
. Let 
be a point on 
. Let 
be a point inside the triangle such that 
and![\[
CL \cdot BD = BL \cdot CD.
\]](http://latex.artofproblemsolving.com/1/6/7/16771838c95f86e92f79b8d049e46ab473e6287d.png)
Prove that the circumcenter of triangle 
lies on line 
.
such that
for all real numbers 
such that 
.
such that for all 
,![\[f(x+yf(x))+y = xy + f(x+y).\]](http://latex.artofproblemsolving.com/c/f/3/cf3d20a041c27244e90876119b4568b7a3e13c03.png)
.
be an integer, let 
be a set of 
elements, and let 
, be distinct subsets of of size at least 
such that ![\[ A_i \cap A_j \not= \emptyset, A_i \cap A_k \not= \emptyset, A_j \cap A_k \not= \emptyset, \;\textrm{imply}\ \;A_i \cap A_j \cap A_k \not= \emptyset \ .\]](http://latex.artofproblemsolving.com/c/1/1/c113f5cdce00dfec6714c382a8e1bc74f188f025.png)
Show that 
.
such that 
or 
, there exist integers![\[
1 \leq a_1 < a_2 < \cdots < a_{(p-1)/2} < p
\]](http://latex.artofproblemsolving.com/6/8/e/68e3d73edec43b2cc480832adf23bbbb5f4c7bee.png)
such that![\[
\prod_{\substack{1 \leq i < j \leq (p-1)/2}} (a_i + a_j)^2 \equiv 1 \pmod{p}.
\]](http://latex.artofproblemsolving.com/2/9/e/29edf6ab8cee2a526e7753a140c5a291e987856a.png)
denote the maximum number of 
-tetrominoes that can be placed on an 
board such that each -tetromino covers at least one cell that is not covered by any other -tetromino.
such that![\[
f(N) \leq cN^2
\]](http://latex.artofproblemsolving.com/7/4/8/748109c3d63203f9a67a167434e10a909f38e83f.png)
for all positive integers 
.
of integers satisfying![\[x_0 = 0, |x_n| = |x_{n-1} + 1|\]](http://latex.artofproblemsolving.com/4/8/e/48e7b6f98f2062879377a9a2e507a63eac9269a8.png)
.
.
therefore u can use 1 and -1 alternating coming to the minimum of 0, because there is sequence is periodic with the period 4, and the first 4 
besides 
are 0 and they repeat themselves 250 times. also 0 is the smallest number possible, since 
when is positive. In other words, you can't go from 1 to -1.
. 24 more numbers. Then, you go
,
and 
and so forth.
.
and this means that 
or 
since we want the minimum. Then 
,
,
,
.