Let $ABC$ be a triangle which it not right-angled. Define a sequence of triangles $A_iB_iC_i$, with $i \ge 0$, as follows: $A_0B_0C_0$ is the triangle $ABC$ and, for $i \ge 0$, $A_{i+1},B_{i+1},C_{i+1}$ are the reflections of the orthocentre of triangle $A_iB_iC_i$ in the sides $B_iC_i$,$C_iA_i$,$A_iB_i$, respectively. Assume that $\angle A_m = \angle A_n$ for some distinct natural numbers $m,n$. Prove that $\angle A = 60^{\circ}$.

Benji has a $2\times 2$ grid, which he proceeds to place chips on. One by one, he places a chip on one of the unit squares of the grid at random. However, if at any point there is more than one chip on the same square, Benji moves two chips on that square to the two adjacent squares, which he calls a chip-fire. He keeps adding chips until there is an infinite loop of chip-fires. What is the expected number of chips that will be added to the board?

Find maximal value of the function $f(x)=8-3\sin^2 (3x)+6 \sin (6x)$

A triangle $ABC$ is given. Let $M$ be the midpoint of the side $AC$ of the triangle and $Z$ the image of point $B$ along the line $BM$. The circle with center $M$ and radius $MB$ intersects the lines $BA$ and $BC$ at the points $E$ and $G$ respectively. Let $H$ be the point of intersection of $EG$ with the line $AC$, and $K$ the point of intersection of $HZ$ with the line $EB$. The perpendicular from point $K$ to the line $BH$ intersects the lines $BZ$ and $BH$ at the points $L$ and $N$, respectively. If $P$ is the second point of intersection of the circumscribed circles of the triangles $KZL$ and $BLN$, prove that, the lines $BZ, KN$ and $HP$ intersect at a common point.

Two players play the following game. At the outset there are two piles, containing $10,000$ and $20,000$ tokens,respectively . A move consists of removing any positive number of tokens from a single pile $or$ removing $x>0$ tokens from one pile and $y>0$ tokens from the other , where $x+y$ is divisible by $2015$. The player who can not make a move loses. Which player has a winning strategy

a) Points $A_1, A_2, A_3, A_4, A_5, A_6$ divide a circle of radius $1$ into six equal arcs. Ray $\ell_1$ from $A_1$ connects $A_1$ with $A_2$, ray $\ell_2$ from $A_2$ connects $A_2$ with $A_3$, and so on, ray $\ell_6$ from $A_6$ connects $A_6$ with $A_1$. From a point $B_1$ on $\ell_1$ the perpendicular is drawn on $\ell_6$, from the foot of this perpendicular another perpendicular is drawn on $\ell_5$, and so on. Let the foot of the $6$-th perpendicular coincide with $B_1$. Find the length of segment $A_1B_1$. b) Find points $B_1, B_2,... , B_n$ on the extensions of sides $A_1A_2, A_2A_3,... , A_nA_1$ of a regular $n$-gon $A_1A_2...A_n$ such that $B_1B_2 \perp A_1A_2$, $B_2B_3 \perp A_2A_3$,$ . . . $, $B_nB_1 \perp A_nA_1$.

Walter has exactly one penny, one nickel, one dime and one quarter in his pocket. What percent of one dollar is in his pocket? $\text{(A)}\ 4\% \qquad \text{(B)}\ 25\% \qquad \text{(C)}\ 40\% \qquad \text{(D)}\ 41\% \qquad \text{(E)}\ 59\%$

Players A and B play a game. They are given a box with $n=>1$ candies. A starts first. On a move, if in the box there are $k$ candies, the player chooses positive integer $l$ so that $l<=k$ and $(l, k) =1$, and eats $l$ candies from the box. The player who eats the last candy wins. Who has winning strategy, in terms of $n$.

Let $f:\mathbb R\to(0,\infty)$ be a differentiabe function, and suppose that there exists a constant $L>0$ such that $$|f'(x)-f'(y)|\leq L|x-y|$$ for all $x,y$. Prove that $$(f'(x))^2<2Lf(x)$$ holds for all $x$.

Let $a_{1}$, $a_{2}$, …, $a_{6}$; $b_{1}$, $b_{2}$, …, $b_{6}$ and $c_{1}$, $c_{2}$, …, $c_{6}$ are all permutations of $1$, $2$, …, $6$, respectively. Find the minimum value of $\sum_{i=1}^{6}a_{i}b_{i}c_{i}$.

For each natural number $n$ we denote $a_n$ as the greatest perfect square less than or equal to $n$ and $b_n$ as the least perfect square greater than $n$. For example $a_9=3^2$, $b_9=4^2$ and $a_{20}=4^2$, $b_{20}=5^2$. Calculate: $$\frac{1}{a_1b_1}+\frac{1}{a_2b_2}+\frac{1}{a_3b_3}+\ldots +\frac{1}{a_{600}b_{600}}$$

Find all polynomials $P(x)$ with real coefficients which satisfies \\ $P(2015)=2025$ and $P(x)-10=\sqrt{P(x^{2}+3)-13}$ for every $x\ge 0$ .

Let $ABC$ be an acute-angled triangle with the circumcenter $O$. Let $D$ be the foot of the altitude from $A$. If $OD\parallel AB$, show that $\sin 2B = \cot C$. [i]Mădălin Mitrofan[/i]

Let $n>3$ be a positive integer. Consider $n$ sets, each having two elements, such that the intersection of any two of them is a set with one element. Prove that the intersection of all sets is non-empty. [i]Sever Moldoveanu[/i]

How many integers from $1$ to $2016$ are divisible by $3$ or $7$, but not $21$?

In the reality show [i]Big Sister Brasil[/i], it is said that there is a [i]treta[/i] if two people are friends with each other and enemies with a third one. For audience purposes, the broadcaster wants a lot of [i]tretas[/i]. If friendship and enmity are reciprocal relationships, given $n$ people, what is the maximum number of [i]tretas[/i]?