Numbers $1, 2,\ldots, n$ are written on the board. By one move, we replace some two numbers $ a, b$ with the number $a^2-b{}$. Find all $n{}$ such that after $n-1$ moves it is possible to obtain $0$.

Determine all real constants $t$ such that whenever $a$, $b$ and $c$ are the lengths of sides of a triangle, then so are $a^2+bct$, $b^2+cat$, $c^2+abt$.

Let $n\geq 2$ be a given integer. Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that \[f(x-f(y))=f(x+y^n)+f(f(y)+y^n), \qquad \forall x,y \in \mathbb R.\]

$(POL 3)$ Given a polynomial $f(x)$ with integer coefficients whose value is divisible by $3$ for three integers $k, k + 1,$ and $k + 2$. Prove that $f(m)$ is divisible by $3$ for all integers $m.$

A triangle with vertices $A(0, 2)$, $B(-3, 2)$, and $C(-3, 0)$ is reflected about the $x$-axis, then the image $\triangle A'B'C'$ is rotated counterclockwise about the origin by $90^{\circ}$ to produce $\triangle A''B''C''$. Which of the following transformations will return $\triangle A''B''C''$ to $\triangle ABC$? $\textbf{(A)}$ counterclockwise rotation about the origin by $90^{\circ}$. $\textbf{(B)}$ clockwise rotation about the origin by $90^{\circ}$. $\textbf{(C)}$ reflection about the $x$-axis $\textbf{(D)}$ reflection about the line $y = x$ $\textbf{(E)}$ reflection about the $y$-axis.

Three points inside a rectangle determine a triangle. A fourth point is taken inside the triangle. i) Prove at least one of the three concave quadrilaterals formed by these four points has perimeter lesser than that of the rectangle. ii) Assuming the three points inside the rectangle are three corners of it, prove at least two of the three concave quadrilaterals formed by these four points have perimeters lesser than that of the rectangle. [i](Dan Schwarz)[/i]

Three clever monkeys divide a pile of bananas. The first monkey takes some bananas from the pile, keeps three-fourths of them, and divides the rest equally between the other two. The second monkey takes some bananas from the pile, keeps one-fourth of them, and divides the rest equally between the other two. The third monkey takes the remaining bananas from the pile, keeps one-twelfth of them, and divides the rest equally between the other two. Given that each monkey receives a whole number of bananas whenever the bananas are divided, and the numbers of bananas the first, second, and third monkeys have at the end of the process are in the ratio $3: 2: 1$, what is the least possible total for the number of bananas?

Evaluate $ \lim_{n\to\infty} \int_0^1 \int_0^1 \cdots \int_0^1 \cos ^ 2 \left\{\frac{\pi}{2n}(x_1\plus{}x_2\plus{}\cdots \plus{}x_n)\right\} dx_1dx_2\cdots dx_n.$

Two distinct positive integers are called [i]close [/i] if their greatest common divisor equals their difference. Show that for any $n$, there exists a set $S$ of $n$ elements such that any two elements of $S$ are close.

Let $ ABCD$ a cuadrilateral inscribed in a circumference. Suppose that there is a semicircle with its center on $ AB$, that is tangent to the other three sides of the cuadrilateral. (i) Show that $ AB \equal{} AD \plus{} BC$. (ii) Calculate, in term of $ x \equal{} AB$ and $ y \equal{} CD$, the maximal area that can be reached for such quadrilateral.

A triangle is constructed with the lengths of the sides chosen from the set $\{2, 3, 5, 8, 13, 21, 34, 55, 89, 144\}$. Show that this triangle must be isosceles. (A triangle is isosceles if it has at least two sides the same length.)

There are $15$ magazines on a table, and they cover the surface of the table entirely. Prove that one can always take away $7$ magazines in such a way that the remaining ones cover at least $\dfrac{8}{15}$ of the area of the table surface

Each of the 12 edges of a cube is coloured either red or green. Every face of the cube has at least one red edge. What is the smallest number of red edges? $\textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 5 \qquad \textbf{(E)}\ 6$

Prove that for arbitrary real numbers $a$ and $b$ the following inequality is true $$a^2 +ab+b^2 \geq 3(a+b-1).$$

Let $E$ be an interior point of the convex quadrilateral $ABCD$. Construct triangles $\triangle ABF,\triangle BCG,\triangle CDH$ and $\triangle DAI$ on the outside of the quadrilateral such that the similarities $\triangle ABF\sim\triangle DCE,\triangle BCG\sim \triangle ADE,\triangle CDH\sim\triangle BAE$ and $ \triangle DAI\sim\triangle CBE$ hold. Let $P,Q,R$ and $S$ be the projections of $E$ on the lines $AB,BC,CD$ and $DA$, respectively. Prove that if the quadrilateral $PQRS$ is cyclic, then \[EF\cdot CD=EG\cdot DA=EH\cdot AB=EI\cdot BC.\]

A square is partitioned in $n^2\geq 4$ rectanles using $2(n-1)$ lines,$n-1$ of which,are parallel to the one side of the square,$n-1$ are parallel to the other side.Prove that we can choose $2n$ rectangles of the partition,such that,for each two of them,we can place the one inside the other (possibly with rotation).

Let $ G$ be a simple graph with $ 2 \cdot n$ vertices and $ n^{2}+1$ edges. Show that this graph $ G$ contains a $ K_{4}-\text{one edge}$, that is, two triangles with a common edge.

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

\[\begin{tabular}{ccccccccccccc} & & & & & & C & & & & & & \\ & & & & & C & O & C & & & & & \\ & & & & C & O & N & O & C & & & & \\ & & & C & O & N & T & N & O & C & & & \\ & & C & O & N & T & E & T & N & O & C & & \\ & C & O & N & T & E & S & E & T & N & O & C & \\ C & O & N & T & E & S & T & S & E & T & N & O & C \end{tabular}\] For how many paths consisting of a sequence of horizontal and/or vertical line segments, with each segment connecting a pair of adjacent letters in the diagram above, is the word CONTEST spelled out as the path is traversed from beginning to end? $\textbf{(A) }63\qquad\textbf{(B) }128\qquad\textbf{(C) }129\qquad\textbf{(D) }255\qquad \textbf{(E) }\text{none of these}$

Let $A$ and $B$ be real $n\times n $ matrices. Assume there exist $n+1$ different real numbers $t_{1},t_{2},\dots,t_{n+1}$ such that the matrices $$C_{i}=A+t_{i}B, \,\, i=1,2,\dots,n+1$$ are nilpotent. Show that both $A$ and $B$ are nilpotent.

Mr. Ramos gave a test to his class of $20$ students. The dot plot below shows the distribution of test scores. [asy] //diagram by pog . give me 1,000,000,000 dollars for this diagram size(5cm); defaultpen(0.7); dot((0.5,1)); dot((0.5,1.5)); dot((1.5,1)); dot((1.5,1.5)); dot((2.5,1)); dot((2.5,1.5)); dot((2.5,2)); dot((2.5,2.5)); dot((3.5,1)); dot((3.5,1.5)); dot((3.5,2)); dot((3.5,2.5)); dot((3.5,3)); dot((4.5,1)); dot((4.5,1.5)); dot((5.5,1)); dot((5.5,1.5)); dot((5.5,2)); dot((6.5,1)); dot((7.5,1)); draw((0,0.5)--(8,0.5),linewidth(0.7)); defaultpen(fontsize(10.5pt)); label("$65$", (0.5,-0.1)); label("$70$", (1.5,-0.1)); label("$75$", (2.5,-0.1)); label("$80$", (3.5,-0.1)); label("$85$", (4.5,-0.1)); label("$90$", (5.5,-0.1)); label("$95$", (6.5,-0.1)); label("$100$", (7.5,-0.1)); [/asy] Later Mr. Ramos discovered that there was a scoring error on one of the questions. He regraded the tests, awarding some of the students $5$ extra points, which increased the median test score to $85$. What is the minimum number of students who received extra points? (Note that the [i]median[/i] test score equals the average of the $2$ scores in the middle if the $20$ test scores are arranged in increasing order.) $\textbf{(A)} ~2\qquad\textbf{(B)} ~3\qquad\textbf{(C)} ~4\qquad\textbf{(D)} ~5\qquad\textbf{(E)} ~6\qquad$

Solve the group of equations: \[\begin{cases} (x + y)^3 = z \\ (y + z)^3 = x \\ (z + x)^3 = y \end{cases}\]

Let $ABC$ a triangle with $AB<AC$ and let $I$ it´s incenter. Let $\Gamma$ the circumcircle of $\triangle BIC$. $AI$ intersect $\Gamma$ again in $P$. Let $Q$ a point in side $AC$ such that $AB=AQ$ and let $R$ a point in $AB$ with $B$ between $A$ and $R$ such that $AR=AC$. Prove that $IQPR$ is cyclic.

A triangle $ ABC$ is given. Let $ B_1$ be the reflection of $ B$ across the line $ AC$, $ C_1$ the reflection of $ C$ across the line $ AB$, and $ O_1$ the reflection of the circumcentre of $ ABC$ across the line $ BC$. Prove that the circumcentre of $ AB_1C_1$ lies on the line $ AO_1$. [i]Proposed by A. Akopyan[/i]

For each positive integer $n$, let $S_n = \sum_{k=1}^nk^3$, and let $d(n)$ be the number of positive divisors of $n$. For how many positive integers $m$, where $m\leq 25$, is there a solution $n$ to the equation $d(S_n) = m$?