Prove that we can color every subset with $n$ element of a set with $3n$ elements with $8$ colors . In such a way that there are no $3$ subsets $A,B,C$ with the same color where : $$|A \cap B| \le 1,|A \cap C| \le 1,|B \cap C| \le 1$$ Proposed by [i]Morteza Saghafian[/i] and [i]Amir Jafari[/i]

In the rectangle $ABCD, BC = 5, EC = 1/3 CD$ and $F$ is the point where $AE$ and $BD$ are cut. The triangle $DFE$ has area $12$ and the triangle $ABF$ has area $27$. Find the area of the quadrilateral $BCEF$ . [img]https://1.bp.blogspot.com/-4w6e729AF9o/XNY9hqHaBaI/AAAAAAAAKL0/eCaNnWmgc7Yj9uV4z29JAvTcWCe21NIMgCK4BGAYYCw/s400/may%2B2011%2Bl1.png[/img]

A square region $ABCD$ is externally tangent to the circle with equation $x^2+y^2=1$ at the point $(0,1)$ on the side $CD$. Vertices $A$ and $B$ are on the circle with equation $x^2+y^2=4$. What is the side length of this square? $ \textbf{(A)}\ \frac{\sqrt{10}+5}{10}\qquad\textbf{(B)}\ \frac{2\sqrt{5}}{5}\qquad\textbf{(C)}\ \frac{2\sqrt{2}}{3}\qquad\textbf{(D)}\ \frac{2\sqrt{19}-4}{5}\qquad\textbf{(E)}\ \frac{9-\sqrt{17}}{5} $

$O$ is a point inside $\triangle ABC$, and $\overrightarrow{OA}+2\overrightarrow{OB}+3\overrightarrow{OC}=\overrightarrow{0}$, then the ratio of the area of $\triangle ABC$ to $\triangle AOC$ is $\text{(A)}2\qquad\text{(B)}\frac{3}{2}\qquad\text{(C)}3\qquad\text{(D)}\frac{5}{3}$

Establish the maximum and minimum values that the sum $|a| + |b| + |c|$ can have if $a, b, c$ are real numbers such that the maximum value of $|ax^2 + bx + c|$ is $1$ for $-1 \leq x \leq 1.$

Josanna's test scores to date are 90, 80, 70, 60, and 85. Her goal is to raise her test average at least 3 points with her next test. What is the minimum test score she would need to accomplish this goal? $ \textbf{(A)}\ 80 \qquad \textbf{(B)}\ 82 \qquad \textbf{(C)}\ 85 \qquad \textbf{(D)}\ 90 \qquad \textbf{(E)}\ 95 $

Big Al, the ape, ate 100 bananas from May 1 through May 5. Each day he ate six more bananas than on the previous day. How many bananas did Big Al eat on May 5? $ \textbf{(A)}\ 20\qquad\textbf{(B)}\ 22\qquad\textbf{(C)}\ 30\qquad\textbf{(D)}\ 32\qquad\textbf{(E)}\ 34 $

$ABCD$ is a cyclic quadrilateral in which $AB=3$, $BC=5$, $CD=6$, and $AD=10$. $M$, $I$, and $T$ are the feet of the perpendiculars from $D$ to lines $AB$, $AC$, and $BC$ respectively. Determine the value of $MI/IT$.

Find all functions $f:\mathbb{N} \to \mathbb{N}$ such that for any two positive integers $a$ and $b$ we have $$ f^a(b) + f^b(a) \mid 2(f(ab) +b^2 -1)$$ Where $f^n(m)$ is defined in the standard iterative manner.

Gourmet Jan compared $n$ restaurants ($n$ is a positive integer). Each pair of restaurants was compared in two categories: tastiness of food and quality of service. For some pairs Jan couldn't tell which restaurant was better in one category, but never in two categories. Moreover, if Jan thought restaurant $A$ was better than restaurant $B$ in one category and restaurant $B$ was better than restaurant $C$ in the same category, then $A$ is also better than $C$ in that category. Prove there exists a restaurant $R$ such that every other restaurant is worse than $R$ in at least one category.

Prove that for all the positive numbers $a,b,c$ the following inequality is valid: $$a^3+b^3+c^3+3abc>ab(a+b)+bc(b+c)+ac(a+c)$$

The addition below is incorrect. What is the largest digit that can be changed to make the addition correct? \[ \begin{array}{cccc} & 6 & 4 & 1 \\ & 8 & 5 & 2 \\ + & 9 & 7 & 3 \\ \hline 2 & 4 & 5 & 6 \end{array} \] $\textbf{(A)}\ 4 \qquad \textbf{(B)}\ 5 \qquad \textbf{(C)}\ 6 \qquad \textbf{(D)}\ 7 \qquad \textbf{(E)}\ 8$

A rook stands in one cell of an infinite square grid. A different cell was colored blue and mines were placed in $n$ additional cells: the rook cannot stand on or pass through them. It is known that the rook can reach the blue cell in finitely many moves. Can it do so (for every $n$ and such a choice of mines, starting point, and blue cell) in at most [b](a)[/b] $1.99n+100$ moves? [b](b)[/b] $2n-2\sqrt{3n}+100$ moves? [b]Remark.[/b] In each move, the rook goes in a vertical or horizontal line.

Let $x, y, z$ be positive real numbers whose sum is $2012$. Find the maximum value of $$ \frac{(x^2 + y^2 + z^2)(x^3 + y^3 + z^3)}{(x^4 + y^4 + z^4)}$$

For some positive integer $n$, the number $110n^3$ has $110$ positive integer divisors, including $1$ and the number $110n^3$. How many positive integer divisors does the number $81n^4$ have? $\textbf{(A) }110 \qquad \textbf{(B) } 191 \qquad \textbf{(C) } 261 \qquad \textbf{(D) } 325 \qquad \textbf{(E) } 425$

Suppose that $ B_1$ is the midpoint of the arc $ AC$, containing $ B$, in the circumcircle of $ \triangle ABC$, and let $ I_b$ be the $ B$-excircle's center. Assume that the external angle bisector of $ \angle ABC$ intersects $ AC$ at $ B_2$. Prove that $ B_2I$ is perpendicular to $ B_1I_B$, where $ I$ is the incenter of $ \triangle ABC$.

Find all triples $\left(x,y,z\right)$ of nonnegative integers such that $$5^x7^y+4=3^z.$$

In a convex quadrilateral $ABCD$ we are given that $\angle CAD=10^\circ$, $\angle DBC=20^\circ$, $\angle BAD=40^\circ$, $\angle ABC=50^\circ$. Compute angle $BDC$.

Let $r_1, r_2, \cdots, r_7$ be the distinct complex roots of the polynomial $P(x) = x^7 - 7$ Let \[K = \prod_{1 \leq i < j \leq 7} (r_i + r_j)\] that is, the product of all the numbers of the form $r_i + r_j$, where $i$ and $j$ are integers for which $1 \leq i < j \leq 7$. Determine the value of $K^2$.

A flower bouquet contains pink roses, red roses, pink carnations, and red carnations. One third of the pink flowers are roses, three fourths of the red flowers are carnations, and six tenths of the flowers are pink. What percent of the flowers are carnations? $ \textbf{(A)}\ 15\qquad\textbf{(B)}\ 30\qquad\textbf{(C)}\ 40\qquad\textbf{(D)}\ 60\qquad\textbf{(E)}\ 70 $

In Miskolc there are two tram lines: line $1$ runs between Tiszai railway station and UpperMajláth, while line $2$ runs between Tiszai railway station and the Ironworks. The timetable for trams leaving Tiszai railway station is as follows: tram $ 1$ leaves at every minute ending in a $0$ or $6$, and tram $2$ leaves at every minute ending in a $3$. There are three types of passengers waiting for the trams: those who will take tram $ 1$ only, those who will take tram $2$ only and those who will take any tram. Every minute there is a constant number of passengers of each type arriving at the station. (This number is not necessarily the same for the different types.) Also, every tram departs with an equal number of passengers from Tiszai railway station. How many passengers are there on a departing tram, if we know that every minute there are $3$ passengers arriving at the station who will take tram $2$ only?

Find all polynomials $Q(x)= ax^2+bx+c$ with integer coefficients for which there exist three different prime numbers $p_1, p_2, p_3$ such that $|Q(p_1)| = |Q(p_2)| = |Q(p_3)| = 11$.

Let $O$ be the circumcenter of triangle $ABC$ and let $A_1,B_1,C_1$ be the midpoints of arcs $BC, CA,AB$ respectively. If $I$ is the incenter of triangle $ABC$, prove that $$\overrightarrow{OI}= \overrightarrow{OA_1}+ \overrightarrow{OB_1}+ \overrightarrow{OC_1}.$$

Given a point $A$ that lies on circle $c(o,R)$ (with center $O$ and radius $R$). Let $(e)$ be the tangent of the circle $c$ at point $A$ and a line $(d)$ that passes through point $O$ and intersects $(e)$ at point $M$ and the circle at points $B,C$ (let $B$ lie between $O$ and $A$). If $AM = R\sqrt3$ , prove that a) triangle $AMC$ is isosceles. b) circumcenter of triangle $AMC$ lies on circle $c$ .

A torpedo set consists of $2$ pieces of $1 \times 4$, $4$ pieces of $1 \times 3$, $6$ pieces of $1 \times 2$ and $ 8$ pieces of $1 \times 1$ ships. a) Can one put the whole set to a $10 \times 10$ table so that the ships do not even touch with corners? (The ships can be placed both horizontally and vertically.) b) Can we solve this problem if we change $4$ pieces of $1 \times 1$ ships to $3$ pieces of $1 \times 2$ ships? c) Can we solve the problem if we change the remaining $4$ pieces of $1 \times 1$ ships to one piece of $1 \times 3$ ship and one piece of $1 \times 2$ ship? (So the number of pieces are $2, 5, 10, 0$.)