Assume that every root of polynomial $P(x) = x^d - a_1x^{d-1} + ... + (-1)^{d-k}a_d$ is in $[0,1]$. Show that for every $k = 1,2,...,d$ the following inequality holds: $ a_k - a_{k+1} + ... + (-1)^{d-k}a_d \geq 0 $

What is the shortest distance between the plane $Ax + By + Cz + 1 = 0$ and the ellipsoid $\frac{x^2}{a^2} + \frac{y^2}{b^2} + \frac{z^2}{c^2} = 1.$ You may find it convenient to use the notation $h = (A^2 + B^2 + C^2)^{\frac{-1}{2}}, m = (a^2A^2 + b^2B^2 + c^2C^2)^{\frac{1}{2}}.$ What is the algebraic condition for the plane not to intersect the ellipsoid?

Compute all real values of $b$ such that, for $f(x) = x^2+bx-17, f(4)=f'(4)$.

Viktor and Natalia play a colouring game with a 3-dimensional cube taking turns alternatingly. Viktor goes first, and on each of his turns, he selects an unpainted edge, and paints it violet. On each of Natalia's turns, she selects an unpainted edge, or at most once during the game a face diagonal, and paints it neon green. If the player on turn cannot make a legal move, then the turn switches to the other player. The game ends when nobody can make any more legal moves. Natalia wins if at the end of the game every vertex of the cube can be reached from every other vertex by traveling only along neon green segments (edges or diagonal), otherwise Viktor wins. Who has a winning strategy? (Prove your answer.) [i]Authored by Viktor Simjanoski[/i]

From a point $C$, tangents $CA$ and $CB$ are drawn to a circle $O$. From an arbitrary point $N$ on the circle, perpendiculars $ND, NE, NF$ are drawn on $AB, CA$ and $CB$, respectively. Prove that the length of $ND$ is the mean proportional of the lengths of $NE$ and $NF$.

$6k+2$ people play in odd or even championship. In each odd or even match they participate exactly two people. Six rounds have been arranged so that in each round there are $3k + 1$ simultaneous matches, and no player participates in two games of the same round. It is known that two people do not play with each other more than one turn. Prove that there are $k + 1$ people where any two of them have not played each other. [hide=original wording] 6k+2 pessoas jogam em campeonato de par ou impar. Em cada partida de par ou impar participam exatamente duas pessoas. Seis rodadas foram organizadas, de modo que, em cada rodada, ha 3k + 1 partidas simultaneas, e nenhum jogador participa de dois jogos da mesma rodada. Sabe-se que duas pessoas nao jogam entre si mais de uma vez. Prove que existem k + 1 pessoas em que quaisquer duas delas nao jogaram entre si. [/quote]

Let $ABC$ be an equilateral triangle. From the vertex $A$ we draw a ray towards the interior of the triangle such that the ray reaches one of the sides of the triangle. When the ray reaches a side, it then bounces off following the law of reflection, that is, if it arrives with a directed angle $\alpha$, it leaves with a directed angle $180^{\circ}-\alpha$. After $n$ bounces, the ray returns to $A$ without ever landing on any of the other two vertices. Find all possible values of $n$.

Let $a,b$ be positive integers satisfying $$\sqrt{\dfrac{ab}{2b^2-a}}=\dfrac{a+2b}{4b}$$. Find $|10(a-5)(b-15)|+8$.

At each vertex of a $13$-sided polygon we write one of the numbers $1,2,3,…, 12,13$, without repeating. Then, on each side of the polygon we write the difference of the numbers of the vertices of its ends (the largest minus the smallest). For example, if two consecutive vertices of the polygon have the numbers $2$ and $11$, the number $9$ is written on the side they determine. a) Is it possible to number the vertices of the polygon so that only the numbers $3, 4$ and $5$ are written on the sides? b) Is it possible to number the vertices of the polygon so that only the numbers $3, 4$ and $6$ are written on the sides?

Find the greatest integer $n < 1000$ for which $4n^3 - 3n$ is the product of two consecutive odd integers.

We say that the real numbers $a$ and $b$ have property $P$ if: $a^2+b \in Q$ and $b^2 + a \in Q$.Prove that: a) The numbers $a= \frac{1+\sqrt2}{2}$ and $b= \frac{1-\sqrt2}{2}$ are irrational and have property $P$ b) If $a, b$ have property $P$ and $a+b \in Q -\{1\}$, then $a$ and $b$ are rational numbers c) If $a, b$ have property $P$ and $\frac{a}{b} \in Q$, then $a$ and $b$ are rational numbers.

Incircle of $ABC$ tangent $AB,AC,BC$ in $C_1,B_1,A_1$. $AA_1$ intersect incircle in $E$. $N$ is midpoint $B_1A_1$. $M$ is symmetric to $N$ relatively $AA_1$. Prove that $\angle EMC= 90$

Let $ k$ and $ n$ be integers with $ 0\le k\le n \minus{} 2$. Consider a set $ L$ of $ n$ lines in the plane such that no two of them are parallel and no three have a common point. Denote by $ I$ the set of intersections of lines in $ L$. Let $ O$ be a point in the plane not lying on any line of $ L$. A point $ X\in I$ is colored red if the open line segment $ OX$ intersects at most $ k$ lines in $ L$. Prove that $ I$ contains at least $ \dfrac{1}{2}(k \plus{} 1)(k \plus{} 2)$ red points. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

In an acute $ABC$ triangle which has a circumcircle center called $O$, there is a line that perpendiculars to $AO$ line cuts $[AB]$ and $[AC]$ respectively on $D$ and $E$ points. There is a point called $K$ that is different from $AO$ and $BC$'s junction point on $[BC]$. $AK$ line cuts the circumcircle of $ADE$ on $L$ that is different from $A$. $M$ is the symmetry point of $A$ according to $DE$ line. Prove that $K$,$L$,$M$,$O$ are circular.

There are $32$ boxers in a tournament. Each boxer can fight no more often than once per day. It is known that the boxers are of different strength, and the stronger man always wins. Prove that a $15$ day tournament can be organised so as to determine their classification (put them in the order of strength). The schedule of fights for each day is fixed on the evening before and cannot be changed during the day. (A. Andjans, Riga)

Let $ X$ be a set containing $ 2k$ elements, $ F$ is a set of subsets of $ X$ consisting of certain $ k$ elements such that any one subset of $ X$ consisting of $ k \minus{} 1$ elements is exactly contained in an element of $ F.$ Show that $ k \plus{} 1$ is a prime number.

Each piece of candy in a store costs a whole number of cents. Casper has exactly enough money to buy either 12 pieces of red candy, 14 pieces of green candy, 15 pieces of blue candy, or $n$ pieces of purple candy. A piece of purple candy costs 20 cents. What is the smallest possible value of $n$? $\textbf{(A) } 18 \qquad \textbf{(B) } 21 \qquad \textbf{(C) } 24\qquad \textbf{(D) } 25 \qquad \textbf{(E) } 28$

Determine the minimum value of $f (x)$ where f (x) = (3 sin x - 4 cos x - 10)(3 sin x + 4 cos x - 10).

We consider the graph with vertices $A_1,A_2,\dots A_{2015}$ , $B_1,B_2,\dots B_{2015}$ and edges $A_iA _{i+1}, A_iB_i, B_iB_{i+17} $, taken cyclicaly. Is it true that 4 cops can catch a robber on this graph for every initial position?( First the 4 cops make a move, then the robber makes a move, then the cops make a move etc. A move consists of jumping from the vertex you stay on an adiacent vertex or by staying on your current vertex. Everyone knows the position of everyone everytime. The cops can coordinate their moves. The robber is caught when he shares the same vertex with a cop.) Tuymaada 2017 Q8 Juniors

Today is Barbara's birthday, and Alberto wants to give her a gift playing the following game. The numbers 0,1,2,...,1024 are written on a blackboard. First Barbara erases $2^{9}$ numbers, then Alberto erases $2^{8}$ numbers, then Barbara $2^{7}$ and so on, until there are only two numbers a,b left. Now Barbara earns $|a-b|$ euro. Find the maximum number of euro that Barbara can always win, independently of Alberto's strategy.

A sequence $\{ u_n \}$ of integers is defined by \[u_1 = 2, u_2 = u_3 = 7,\] \[u_{n+1} = u_nu_{n-1} - u_{n-2}, \text{ for }n \geq 3\] Prove that for each $n \geq 1$, $u_n$ differs by $2$ from an integral square.

Let $P=[a_{ij}]_{3\times 9}$ be a $3\times 9$ matrix where $a_{ij}\ge 0$ for all $i,j$. The following conditions are given: [list][*]Every row consists of distinct numbers; [*]$\sum_{i=1}^{3}x_{ij}=1$ for $1\le j\le 6$; [*]$x_{17}=x_{28}=x_{39}=0$; [*]$x_{ij}>1$ for all $1\le i\le 3$ and $7\le j\le 9$ such that $j-i\not= 6$. [*]The first three columns of $P$ satisfy the following property $(R)$: for an arbitrary column $[x_{1k},x_{2k},x_{3k}]^T$, $1\le k\le 9$, there exists an $i\in\{1,2,3\}$ such that $x_{ik}\le u_i=\min (x_{i1},x_{i2},x_{i3})$.[/list] Prove that: a) the elements $u_1,u_2,u_3$ come from three different columns; b) if a column $[x_{1l},x_{2l},x_{3l}]^T$ of $P$, where $l\ge 4$, satisfies the condition that after replacing the third column of $P$ by it, the first three columns of the newly obtained matrix $P'$ still have property $(R)$, then this column uniquely exists.

Suppose that circles $C_1$ and $C_2$ intersect at $X$ and $Y$ . Let $A, B$ be on $C_1$, $C_2$, respectively, such that $A, X, B$ lie on a line in that order. Let $A, C$ be on $C_1$, $C_2$, respectively, such that $A, Y, C$ lie on a line in that order. Let $A', B', C'$ be another similarly defined triangle with $A \ne A'$. Prove that $BB' = CC'$.

A positive integer $N$ is called [i]northern[/i] if for each digit $d > 0$, there exists a divisor of $N$ whose last digit is $d$. How many [i]northern [/i] numbers less than $2016$ are there with the fewest number of divisors as possible?

If $b$, $c$ are the legs, and $a$ is the hypotenuse of a right triangle, prove that$$\left(a+b+c\right)\left(\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\right)\geq 5+3\sqrt{2}$$