Let $(x_n), n\in\mathbb{N}$ be a sequence such that $x_{n+1}=3x_n^3+x_n, \forall n\in\mathbb{N}$ and $x_1=\frac{a}{b}$ where $a,b$ are positive integers such that $3\not|b$. If $x_m$ is a square of a rational number for some positive integer $m$, prove that $x_1$ is also a square of a rational number.

An L-shape is one of the following four pieces, each consisting of three unit squares: [asy] size(300); defaultpen(linewidth(0.8)); path P=(1,2)--(0,2)--origin--(1,0)--(1,2)--(2,2)--(2,1)--(0,1); draw(P); draw(shift((2.7,0))*rotate(90,(1,1))*P); draw(shift((5.4,0))*rotate(180,(1,1))*P); draw(shift((8.1,0))*rotate(270,(1,1))*P); [/asy] A $5\times 5$ board, consisting of $25$ unit squares, a positive integer $k\leq 25$ and an unlimited supply of L-shapes are given. Two players A and B, play the following game: starting with A they play alternatively mark a previously unmarked unit square until they marked a total of $k$ unit squares. We say that a placement of L-shapes on unmarked unit squares is called $\textit{good}$ if the L-shapes do not overlap and each of them covers exactly three unmarked unit squares of the board. B wins if every $\textit{good}$ placement of L-shapes leaves uncovered at least three unmarked unit squares. Determine the minimum value of $k$ for which B has a winning strategy.

For a finite set $A$ of positive integers, a partition of $A$ into two disjoint nonempty subsets $A_1$ and $A_2$ is $\textit{good}$ if the least common multiple of the elements in $A_1$ is equal to the greatest common divisor of the elements in $A_2$. Determine the minimum value of $n$ such that there exists a set of $n$ positive integers with exactly $2015$ good partitions.

Find all triplets $(x, y, z)$ of real numbers for which $$\begin{cases}x^2- yz = |y-z| +1 \\ y^2 - zx = |z-x| +1 \\ z^2 -xy = |x-y| + 1 \end{cases}$$

Let $x$ be a real number selected uniformly at random between 100 and 200. If $\lfloor {\sqrt{x}} \rfloor = 12$, find the probability that $\lfloor {\sqrt{100x}} \rfloor = 120$. ($\lfloor {v} \rfloor$ means the greatest integer less than or equal to $v$.) $\text{(A)} \ \frac{2}{25} \qquad \text{(B)} \ \frac{241}{2500} \qquad \text{(C)} \ \frac{1}{10} \qquad \text{(D)} \ \frac{96}{625} \qquad \text{(E)} \ 1$

Each square of an $n \times n$ grid is coloured either blue or red, where $n$ is a positive integer. There are $k$ blue cells in the grid. Pat adds the sum of the squares of the numbers of blue cells in each row to the sum of the squares of the numbers of blue cells in each column to form $S_B$. He then performs the same calculation on the red cells to compute $S_R$. If $S_B- S_R = 50$, determine (with proof) all possible values of $k$.

The incircle of the triangle ABC touches the sides BC, AC, and AB at points A', B', and C', respectively. It is known that AA'=BB'=CC'. Does the triangle ABC have to be equilateral? (I am very interested in ingenious solution of this problem, because I found an ugly one using Stewart's theorem and tons of algebra during the contest).

Given real numbers $b \geq a>0$, find all solutions of the system \begin{align*} &x_1^2+2ax_1+b^2=x_2,\\ &x_2^2+2ax_2+b^2=x_3,\\ &\qquad\cdots\cdots\cdots\\ &x_n^2+2ax_n+b^2=x_1. \end{align*}

p1. One day, a researcher placed two groups of species that were different, namely amoeba and bacteria in the same medium, each in a certain amount (in unit cells). The researcher observed that on the next day, which is the second day, it turns out that every cell species divide into two cells. On the same day every cell amoeba prey on exactly one bacterial cell. The next observation carried out every day shows the same pattern, that is, each cell species divides into two cells and then each cell amoeba prey on exactly one bacterial cell. Observation on day $100$ shows that after each species divides and then each amoeba cell preys on exactly one bacterial cell, it turns out kill bacteria. Determine the ratio of the number of amoeba to the number of bacteria on the first day. p2. It is known that $n$ is a positive integer. Let $f(n)=\frac{4n+\sqrt{4n^2-1}}{\sqrt{2n+1}+\sqrt{2n-1}}$. Find $f(13) + f(14) + f(15) + ...+ f(112).$ p3. Budi arranges fourteen balls, each with a radius of $10$ cm. The first nine balls are placed on the table so that form a square and touch each other. The next four balls placed on top of the first nine balls so that they touch each other. The fourteenth ball is placed on top of the four balls, so that it touches the four balls. If Bambang has fifty five balls each also has a radius of $10$ cm and all the balls are arranged following the pattern of the arrangement of the balls made by Budi, calculate the height of the center of the topmost ball is measured from the table surface in the arrangement of the balls done by Bambang. p4. Given a triangle $ABC$ whose sides are $5$ cm, $ 8$ cm, and $\sqrt{41}$ cm. Find the maximum possible area of ​​the rectangle can be made in the triangle $ABC$. p5. There are $12$ people waiting in line to buy tickets to a show with the price of one ticket is $5,000.00$ Rp.. Known $5$ of them they only have $10,000$ Rp. in banknotes and the rest is only has a banknote of $5,000.00$ Rp. If the ticket seller initially only has $5,000.00$ Rp., what is the probability that the ticket seller have enough change to serve everyone according to their order in the queue?

A box contains 900 cards numbered from 100 to 999. Cards are drawn randomly, one at a time, without replacement, and the sum of their digits is recorded. What is the minimum number of cards that must be drawn to guarantee that at least three of these sums are the same?

In next year's finals in Schools Mathematics competition, $20$ finalists will participate. The final exam contains six problems. Emil claims that regardless of results, there must be five contestants and two problems such that either all the five contestants solve both problems, or neither of them solve any of the two problems. Is he right?

Given positive integers $m$ and $n$, prove that there is a positive integer $c$ such that the numbers $cm$ and $cn$ have the same number of occurrences of each non-zero digit when written in base ten.

Show that the number $r(n)$ of representations of $n$ as a sum of two squares has $\pi$ as arithmetic mean, that is \[\lim_{n \to \infty}\frac{1}{n}\sum^{n}_{m=1}r(m) = \pi.\]

There are $27$ boxes located in a row; each contains at least $12$ marbles. The allowed operation is transfer a ball from a box to its neighbor on the right, as long as said neighbor contains more pellets than the box from which the transfer will be made. We will say that a distribution initial of the balls is [i]happy [/i] if it is possible to achieve, by means of a succession of permitted operations, that all the balls are in the same box. Determine what is the smallest total number of marbles with the that you can have a happy initial layout.

Find all positive integers $a,b$ with $a>1$ such that, $b$ is a divisor of $a-1$ and $2a+1$ is a divisor of $5b-3$.

Let $ ABC$ be an equilateral triangle with side length 2, and let $ \Gamma$ be a circle with radius $ \frac {1}{2}$ centered at the center of the equilateral triangle. Determine the length of the shortest path that starts somewhere on $ \Gamma$, visits all three sides of $ ABC$, and ends somewhere on $ \Gamma$ (not necessarily at the starting point). Express your answer in the form of $ \sqrt p \minus{} q$, where $ p$ and $ q$ are rational numbers written as reduced fractions.

given that p,q are two polynomials such that each one has at least one root and \[p(1+x+q(x)^2)=q(1+x+p(x)^2)\] then prove that p=q

Let $\triangle ABC$ and $A'$,$B'$,$C'$ the symmetrics of vertex over opposite sides.The intersection of the circumcircles of $\triangle ABB'$ and $\triangle ACC'$ is $A_1$.$B_1$ and $C_1$ are defined similarly.Prove that lines $AA_1$,$BB_1$ and $CC_1$ are concurent.

In the tetrahedron $SABC $ at the height $SH$ the following point $O$ is chosen, such that: $$\angle AOS + \alpha = \angle BOS + \beta = \angle COS + \gamma = 180^o, $$ where $\alpha, \beta, \gamma$ are dihedral angles at the edges $BC, AC, AB $, respectively, at this point $H$ lies inside the base $ABC$. Let ${{A} _ {1}}, \, {{B} _ {1}}, \, {{C} _ {1}} $be the points of intersection of lines and planes: ${{A} _ {1}} = AO \cap SBC $, ${{B} _ {1}} = BO \cap SAC $, ${{C} _ {1}} = CO \cap SBA$ . Prove that if the planes $ABC $ and ${{A} _ {1}} {{B} _ {1}} {{C} _ {1}} $ are parallel, then $SA = SB = SC $. (Alexey Klurman)

Let $x$ be an angle between $0^o$ and $90^o$ so that $$\frac{\sin^4 x}{9}+\frac{\cos^4 x}{16 }=\frac{1}{25} .$$ Then what is $\tan x$?

Let $n$ be a fixed positive integer and consider an $n\times n$ grid of real numbers. Determine the greatest possible number of cells $c$ in the grid such that the entry in $c$ is both strictly greater than the average of $c$'s column and strictly less than the average of $c$'s row. [i]Proposed by Holden Mui[/i]

Find all numbers that can be expressed in exactly $2010$ different ways as the sum of powers of two with non-negative exponents, each power appearing as a summand at most three times. A sum can also be made from just one summand.

Find the maximal value of \[S = \sqrt[3]{\frac{a}{b+7}} + \sqrt[3]{\frac{b}{c+7}} + \sqrt[3]{\frac{c}{d+7}} + \sqrt[3]{\frac{d}{a+7}},\] where $a$, $b$, $c$, $d$ are nonnegative real numbers which satisfy $a+b+c+d = 100$. [i]Proposed by Evan Chen, Taiwan[/i]

We are given $30$ non-zero vectors in $3$ dimensional space. Prove that among these there are two such that the angle between them is less than $45^o$.

An integer $n > 1$ has the following property: for every (positive) divisor $d$ of $n, d + 1$ is a divisor of $n + 1$. Prove that $n$ is prime.