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.
black and 
red cards. You pull out 
cards, one after another, and check their colour. If both cards are the same colour, then a black card is added to the deck. However, if the cards are of different colours, then a red card is used to replace them. Once the cards are taken out of the deck, they are not returned to the deck, and thus the number of cards keeps reducing. What is the likelihood the last card left in the deck is black?
be positive real numbers such that 
Prove that we have![\[(a+b)(b+c)(c+a)\geq 8.\]](http://latex.artofproblemsolving.com/2/a/6/2a63f19de634fce70ff4ebc02ad13d442a20c378.png)
such that the equality 
holds for all pairs of real numbers 
.
such that 
and 
.
be a given positive real and 
be the set of all positive reals. Find all functions 
such that ![\[f((c+1)x+f(y))=f(x+2y)+2cx \quad \textrm{for all } x,y \in \mathbb{R}_{>0}.\]](http://latex.artofproblemsolving.com/b/0/6/b069e7b7ec1e277f4a4ce85a99434fdb54eb02f3.png)
of the vertices of the regular polygon 
we write the number 
and in the remaining ones we write the number 
Let 
be the number written on the vertex 
A vertex is good if ![\[x_i+x_{i+1}+\cdots+x_j>0\quad\text{and}\quad x_i+x_{i-1}+\cdots+x_k>0,\]](http://latex.artofproblemsolving.com/b/f/4/bf4cf984af7f310c1eb90b6b37126bfca9181305.png)
for any integers 
and 
such that 
Note that the indices are taken modulo 
Determine the greatest possible value of such that, regardless of numbering, there always exists a good vertex.
satisfying ![$$(ab+bc+ca)\left[\frac{1}{(a+b)^{2}}+\frac{1}{(b+c)^{2}}+\frac{1}{(c+a)^{2}}\right]\ge \frac{9}{4}+k\cdot\frac{a(a-b)(a-c)+b(b-a)(b-c)+c(c-a)(c-b)}{(a+b+c)^{3}}$$](http://latex.artofproblemsolving.com/f/6/e/f6ed10f7fff1cc94edd8f451e75718a0916a8bfa.png)
holds for all 
be a scalene triangle, 
be the median through 
, and 
be the incircle. Let touch 
at point 
and segment 
meet for the second time at point 
. Let 
be the triangle formed by lines and and the tangent to at . Prove that the incircle of triangle is tangent to the circumcircle of triangle .
be real numbers such that 
Prove that
Where 
Where 
are are the lengths of the sides of a 
gon such that
then![$$(n-2)\left[\sum_{i=1}^{n}{\frac{a_i^2}{(1-a_i)^2}}-\frac n{(n-1)^2}\right]\geq(2n-1)\left(\sum_{i=1}^{n}{\frac{a_i}{1-a_i}}-\frac n{n-1}\right)^2.$$](http://latex.artofproblemsolving.com/9/3/e/93e5529518807b92cd9e0382f5fb07a293128b04.png)
be a rectangle such that 
. Let 
be the orthogonal project of 
on 
the circle passing through and and whose center is on 
. Let 
be the point of intersection of 
and ![$[CD]$](http://latex.artofproblemsolving.com/e/7/0/e70960e9e5738a46ad23f794e796ef3cb4ad7e2c.png)
. Prove that 
is the bisector of 
.
be a rectangle such that . Let be the orthogonal project of on the circle passing through and and whose center is on . Let be the point of intersection of and . Prove that is the bisector of .
is an obvious solution. Now, let 
.
or 
.
.
