Angle bisectors of angles by vertices $A$, $B$ and $C$ in triangle $ABC$ intersect opposing sides in points $A_1$, $B_1$ and $C_1$, respectively. Let $M$ be an arbitrary point on one of the lines $A_1B_1$, $B_1C_1$ and $C_1A_1$. Let $M_1$, $M_2$ and $M_3$ be orthogonal projections of point $M$ on lines $BC$, $CA$ and $AB$, respectively. Prove that one of the lines $MM_1$, $MM_2$ and $MM_3$ is equal to sum of other two

Find the largest integer $k$ such that $$k\leq\sqrt{2}+\sqrt[3]{\frac{3}{2}}+\sqrt[4]{\frac{4}{3}}+\sqrt[5]{\frac{5}{4}}+\cdots+\sqrt[2015]{\frac{2015}{2014}}.$$

The sets $A_1,A_2,...,A_n$ are finite. With $d$ we denote the number of elements in $\bigcup_{i=1}^n A_i$ which are in odd number of the sets $A_i$. Prove that the number: $D(k)=d-\sum_{i=1}^n|A_i|+2\sum_{i<j}|A_i\cap A_j |+...+(-1)^k2^{k-1}\sum_{i_1<i_2<...<i_k}|A_{i_1}\cap A_{i_2}\cap ...\cap A_{i_k}|$ is divisible by $2^k$.

Let $a, b, c$, and $d$ be real numbers. The six sums of two numbers $x$ and $y$, different from the previous four, are $117$, $510$, $411$, $252$, in no particular order. Determine the maximum possible value of $x + y$.

Mariana plays with an $8\times 8$ board with all its squares blank. She says that two houses are [i]neighbors [/i] if they have a common side or vertex, that is, two houses can be neighbors vertically, horizontally or diagonally. The game consists of filling the $64$ squares on the board, one after the other, each with a number according to the following rule: she always chooses a house blank and fill it with an integer equal to the number of neighboring houses that are still in White. Once this is done, the house is no longer considered blank. Show that the value of the sum of all $64$ numbers written on the board at the end of the game does not depend in the order of filling. Also, calculate the value of this sum. Note: A house is not neighbor to itself. [hide=original wording]Mariana brinca com um tabuleiro 8 x 8 com todas as suas casas em branco. Ela diz que duas casas s˜ao vizinhas se elas possu´ırem um lado ou um v´ertice em comum, ou seja, duas casas podem ser vizinhas verticalmente, horizontalmente ou diagonalmente. A brincadeira consiste em preencher as 64 casas do tabuleiro, uma ap´os a outra, cada uma com um n´umero de acordo com a seguinte regra: ela escolhe sempre uma casa em branco e a preenche com o n´umero inteiro igual `a quantidade de casas vizinhas desta que ainda estejam em branco. Feito isso, a casa n˜ao ´e mais considerada em branco. Demonstre que o valor da soma de todos os 64 n´umeros escritos no tabuleiro ao final da brincadeira n˜ao depende da ordem do preenchimento. Al´em disso, calcule o valor dessa soma. Observa¸c˜ao: Uma casa n˜ao ´e vizinha a si mesma[/hide]

In a geometric progression whose terms are positive, any term is equal to the sum of the next two following terms. then the common ratio is: $ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ \text{about }\frac{\sqrt{5}}{2} \qquad\textbf{(C)}\ \frac{\sqrt{5}\minus{}1}{2} \qquad\textbf{(D)}\ \frac{1\minus{}\sqrt{5}}{2} \qquad\textbf{(E)}\ \frac{2}{\sqrt{5}}$

The Fibonacci sequence is defined by $ F_0\equal{}0, F_1\equal{}1$ and $ F_{n\plus{}2}\equal{}F_n\plus{}F_{n\plus{}1}$ for $ n \ge 0$. Prove that: $ (a)$ The statement $ "F_{n\plus{}k}\minus{}F_n$ is divisible by $ 10$ for all $ n \in \mathbb{N}"$ is true if $ k\equal{}60$ but false for any positive integer $ k<60$. $ (b)$ The statement $ "F_{n\plus{}t}\minus{}F_n$ is divisible by $ 100$ for all $ n \in \mathbb{N}"$ is true if $ t\equal{}300$ but false for any positive integer $ t<300$.

Let $\Gamma$ is a circle with diameter $AB$. Let $\ell$ be the tangent of $\Gamma$ at $A$, and $m$ be the tangent of $\Gamma$ through $B$. Let $C$ be a point on $\ell$, $C \ne A$, and let $q_1$ and $q_2$ be two lines that passes through $C$. If $q_i$ cuts $\Gamma$ at $D_i$ and $E_i$ ($D_i$ is located between $C$ and $E_i$) for $i = 1, 2$. The lines $AD_1, AD_2, AE_1, AE_2$ intersects $m$ at $M_1, M_2, N_1, N_2$ respectively. Prove that $M_1M_2 = N_1N_2$.

In the Faculty of Cybernetics football championship, \( n \geq 3 \) teams participated. The competition was held in a round-robin format, meaning that each team played against every other team exactly once. For a win, a team earns 3 points, for a loss no points are awarded, and for a draw, both teams receive 1 point each. It turned out that the winning team scored strictly more points than any other team and had at most as many wins as losses. What is the smallest \( n \) for which this could happen? [i]Proposed by Bogdan Rublov[/i]

Determine all pairs $(x, y)$ of positive integers satisfying $x + y + 1 | 2xy$ and $ x + y - 1 | x^2 + y^2 - 1$.

Find positive reals $a, b, c$ which maximizes the value of $abc$ subject to the constraint that $b(a^2 + 2) + c(a + 2) = 12$.

Let $\ell$ be the perimeter of an acute-angled triangle $ABC$ which is not an equilateral triangle. Let $P$ be a variable points inside the triangle $ABC$, and let $D,E,F$ be the projections of $P$ on the sides $BC,CA,AB$ respectively. Prove that \[ 2(AF+BD+CE ) = \ell \] if and only if $P$ is collinear with the incenter and the circumcenter of the triangle $ABC$.

Given right triangle $ABC$ with legs $BC=3$, $AC=4$. Find the length of the shorter [i]angle trisector[/i] from $C$ to the hypotenuse: $ \textbf{(A)}\ \frac{32\sqrt{3}-24}{13}\qquad\textbf{(B)}\ \frac{12\sqrt{3}-9}{13}\qquad\textbf{(C)}\ 6\sqrt{3}-8\qquad\textbf{(D)}\ \frac{5\sqrt{10}}{6} \qquad$ $\textbf{(E)}\ \frac{25}{12}$

Let $ x$, $ y$, $ z$ be real numbers such that $ 0 < x,y,z < 1$ and $ xyz \equal{} (1 \minus{} x)(1 \minus{} y)(1 \minus{} z)$. Show that at least one of the numbers $ (1 \minus{} x)y,(1 \minus{} y)z,(1 \minus{} z)x$ is greater than or equal to $ \frac {1}{4}$

Let $\Gamma$ be the circumcircle of a fixed triangle $ABC$, and let $M$ and $N$ be the midpoints of the arcs $BC$ and $CA$, respectively. For any point $X$ on the arc $AB$, let $O_1$ and $O_2$ be the incenters of $\vartriangle XAC$ and $\vartriangle XBC$, and let the circumcircle of $\vartriangle XO_1O_2$ intersect $\Gamma$ at $X$ and $Q$. Prove that triangles $QNO_1$ and $QMO_2$ are similar, and find all possible locations of point $Q$.

Let $\tau(n)$ denote the number of positive divisors of the positive integer $n$. Prove that there exist infinitely many positive integers $a$ such that the equation $ \tau(an)=n $ does not have a positive integer solution $n$.

Integers $a$ and $b$ are randomly chosen without replacement from the set of integers with absolute value not exceeding $10$. What is the probability that the polynomial $x^3 + ax^2 + bx + 6$ has $3$ distinct integer roots? $\textbf{(A)} \frac{1}{240} \qquad \textbf{(B)} \frac{1}{221} \qquad \textbf{(C)} \frac{1}{105} \qquad \textbf{(D)} \frac{1}{84} \qquad \textbf{(E)} \frac{1}{63}$.

Ten test papers are to be prepared for the National Olympiad. Each paper has 4 problems, and no two papers have more than 1 problem in common. At least how many problems are needed?

The roots of $ Ax^2 \plus{} Bx \plus{} C \equal{} 0$ are $ r$ and $ s$. For the roots of \[ x^2 \plus{} px \plus{} q \equal{} 0 \] to be $ r^2$ and $ s^2$, $ p$ must equal: $ \textbf{(A)}\ \frac{B^2 \minus{} 4AC}{A^2}\qquad \textbf{(B)}\ \frac{B^2 \minus{} 2AC}{A^2}\qquad \textbf{(C)}\ \frac{2AC \minus{} B^2}{A^2}\qquad \\ \textbf{(D)}\ B^2 \minus{} 2C\qquad \textbf{(E)}\ 2C \minus{} B^2$

Let $a_1,a_2,a_3,\ldots$ and $b_1,b_2,b_3,\ldots$ be positive integers such that $a_{n+2} = a_n + a_{n+1}$ and $b_{n+2} = b_n + b_{n+1}$ for all $n \ge 1$. Assume that $a_n$ divides $b_n$ for infinitely many values of $n$. Prove that there exists an integer $c$ such that $b_n = c a_n$ for all $n \ge 1$.

Given a parallelogram with area $1$ and we will construct lines where this lines connect a vertex with a midpoint of the side no adjacent to this vertex; with the $8$ lines formed we have a octagon inside of the parallelogram. Determine the area of this octagon

Let the positive integers $ a,b,c$ chosen such that the quotients $ \frac{bc}{b\plus{}c},$ $ \frac{ca}{c\plus{}a}$ and $ \frac{ab}{a\plus{}b}$ are integers. Prove that $ a,b,c$ have a common divisor greater than 1.

Let \[X = \cos\frac{2\pi}7 + \cos\frac{4\pi}7 + \cos\frac{6\pi}7 + \cdots + \cos\frac{2006\pi}7 + \cos\frac{2008\pi}7.\] Compute $\Big|\lfloor 2008 X\rfloor\Big|$.

Find the maximum number of natural numbers $x_1,x_2, ... , x_m$ satisfying the conditions: a) No $x_i - x_j , 1 \le i < j \le m$ is divisible by $11$, and b) The sum $x_2x_3 ...x_m + x_1x_3 ... x_m + \cdot \cdot \cdot + x_1x_2... x_{m-1}$ is divisible by $11$.

For which positive integers $n$ do there exist two polynomials $f$ and $g$ with integer coefficients of $n$ variables $x_1, x_2, \ldots , x_n$ such that the following equality is satisfied: \[\sum_{i=1}^n x_i f(x_1, x_2, \ldots , x_n) = g(x_1^2, x_2^2, \ldots , x_n^2) \ ? \]