Real numbers $x$ and $y$ are chosen independently and uniformly at random from the interval $(0,1)$. What is the probability that $\lfloor \log_2{x} \rfloor=\lfloor \log_2{y} \rfloor$, where $\lfloor r \rfloor$ denotes the greatest integer less than or equal to the real number $r$? $\textbf{(A)}\ \frac{1}{8}\qquad\textbf{(B)}\ \frac{1}{6}\qquad\textbf{(C)}\ \frac{1}{4}\qquad\textbf{(D)}\ \frac{1}{3}\qquad\textbf{(E)}\ \frac{1}{2}$

Let $f$ be a quadratic polynomial with integer coefficients. Also $f (k)$ is divisible by $5$ for every integer $k$. Show that coefficients of the polynomial $f$ are all divisible by $5$.

A polynomial with rational coefficients is called [i]integer[/i], if it takes integer values ​​for all integer values ​​of the variable. For an integer polynomial $P$, consider the sequence $(-1)^{P(1)},(-1)^{P(2)},(-1)^{P(3)},...$ a) Prove that this sequence is periodic, the period of which is some power of two (i.e. for some integer $k$ and for all natural $i$, the $i$-th and ($i+2^k$)th members of the sequence are equal). b) Prove that for any periodic sequence consisting of $(- 1)$ and $ 1$ and with a period of some power of two, there exists a integer, polynomial P for which this sequence is $(-1)^{P(1)},(-1)^{P(2)},(-1)^{P(3)},...$

It is given triangle $ABC$. Let internal and external angle bisector of angle $\angle BAC$ intersect line $BC$ in points $D$ and $E$, respectively, and circumcircle of triangle $ADE$ intersects line $AC$ in point $F$. Prove that $FD$ is angle bisector of $\angle BFC$

Find all polynomials of degree $3$ with integer coeffcients such that $f(2014) = 2015, f(2015) = 2016$ and $f(2013) - f(2016)$ is a prime number.

[b]Version 1.[/b] Find all primes $p$ satisfying the following conditions: (i) $\frac{p+1}{2}$ is a prime number. (ii) There are at least three distinct positive integers $n$ for which $\frac{p^2+n}{p+n^2}$ is an integer. [b]Version 2.[/b] Let $p \neq 5$ be a prime number such that $\frac{p+1}{2}$ is also a prime. Suppose there exist positive integers $a <b$ such that $\frac{p^2+a}{p+a^2}$ and $\frac{p^2+b}{p+b^2}$ are integers. Show that $b=(a-1)^2+1$.

$ABC$ is triangle. Point $L$ is inside $ABC$ and lies on bisector of $\angle B$. $K$ is on $BL$. $\angle KAB=\angle LCB= \alpha$. Point $P$ inside triangle is such, that $AP=PC$ and $\angle APC=2\angle AKL$. Prove that $\angle KPL=2\alpha$

Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies \[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\] for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.

In a triangle $ABC$, with $\widehat{A} > 90^\circ$, let $O$ and $H$ denote its circumcenter and orthocenter, respectively. Let $K$ be the reflection of $H$ with respect to $A$. Prove that $K, O$ and $C$ are collinear if and only if $\widehat{A} - \widehat{B} = 90^\circ$.

Let $x,y,z$ be positive numebrs such that $x+y+z\le x^3+y^3+z^3$. Is it true that a) $x^2+y^2+z^2 \le x^3+y^3+z^3$ ? b) $x+y+z\le x^2+y^2+z^2$ ?

Let $p$ be an odd prime. Find all positive integers $n$ for which $\sqrt{n^2-np}$ is a positive integer.

Compute the sum of all real numbers $x$ such that \[2x^6-3x^5+3x^4+x^3-3x^2+3x-1=0.\]

The members of a distinguished committee were choosing a president, and each member gave one vote to one of the $27$ candidates. For each candidate, the exact percentage of votes the candidate got was smaller by at least $1$ than the number of votes for that candidate. What is the smallest possible number of members of the committee?

Let $n$ be an integer, $n \ge 2$. For each number $k = 1, 2, ....., n,$ denote by $a _ k$ the number of multiples of $k$ in the set $\{1, 2,. .., n \}$ and let $x _ k = \frac {1} {1} + \frac {1} {2} + \frac {1} {3} _... + \frac {1} {a _ k}$ . Show that: $$\frac {x _ 1 + x _ 2 + ... + x _ n} {n} \le \frac {1} {1 ^ 2} + \frac {1} {2 ^ 2} + ... + \frac {1} {n ^ 2} $$.

There are $N\ge3$ letters arranged in a circle, and each letter is one of $L$, $T$ and $F$. For a letter, we can do the following operation: if its neighbors are the same, then change it to the same letter too; otherwise, change it so that it is different from both its neighbors. Show that for any initial state, one can perform finitely many operations to achieve a stable state. Here, a stable state means that any operation does not change any of the $N$ letters. (ltf0501)

There are a family of $5$ siblings. They have a pile of at least $2$ candies and are trying to split them up amongst themselves. If the $2$ oldest siblings share the candy equally, they will have $1$ piece of candy left over. If the $3$ oldest siblings share the candy equally, they will also have $1$ piece of candy left over. If all $5$ siblings share the candy equally, they will also have $1$ piece left over. What is the minimum amount of candy required for this to be true?

$ ABC$ is an acute-angled triangle. $ M$ is the midpoint of $ BC$ and $ P$ is the point on $ AM$ such that $ MB \equal{} MP$. $ H$ is the foot of the perpendicular from $ P$ to $ BC$. The lines through $ H$ perpendicular to $ PB$, $ PC$ meet $ AB, AC$ respectively at $ Q, R$. Show that $ BC$ is tangent to the circle through $ Q, H, R$ at $ H$. [i]Original Formulation: [/i] For an acute triangle $ ABC, M$ is the midpoint of the segment $ BC, P$ is a point on the segment $ AM$ such that $ PM \equal{} BM, H$ is the foot of the perpendicular line from $ P$ to $ BC, Q$ is the point of intersection of segment $ AB$ and the line passing through $ H$ that is perpendicular to $ PB,$ and finally, $ R$ is the point of intersection of the segment $ AC$ and the line passing through $ H$ that is perpendicular to $ PC.$ Show that the circumcircle of $ QHR$ is tangent to the side $ BC$ at point $ H.$

Find all positive integers $n \ge 3$ such that there exists an $n$-gon with vertices on lattice points of the coordinate plane and all sides of equal length.

For every positive integer $n$, $s(n)$ denotes the sum of the digits in the decimal representation of $n$. Prove that for every integer $n \ge 5$, we have $$S(1)S(3)...S(2n-1) \ge S(2)S(4)...S(2n)$$

Two circles $w_{1}$ and $w_{2}$ of different radii touch externally at $L$. A line touches $w_{1}$ at $A$ and $w_{2}$ at $B$ (the points $A$ and $B$ are different from $L$). A point $X$ is chosen in the plane. $Y$ and $Z$ are the second points of intersection of the lines $XA$ and $XB$ with $w_{1}$ and $w_{2}$ respectively. Prove that all $X$ such that $AB||Y Z$ belong to one circle.

Two players in turn put two or three coins into their own hats (before the game starts, the hats are empty). Each time, after the second player duplicated the move of the first player, they exchange hats. The player wins, if after his move his hat contains one hundred or more coins. Which player has a winning strategy?

Given are $50$ points in the plane, no three of them belonging to a same line. Each of these points is colored using one of four given colors. Prove that there is a color and at least $130$ scalene triangles with vertices of that color.

Consider a function $f:\mathbb N\rightarrow \mathbb N$ such that for any two positive integers $x,y$, the equation $f(xf(y))=yf(x)$ holds. Find the smallest possible value of $f(2007)$.

$S_{1},S_{2},S_{3}$ are three spheres in $\mathbb R^{3}$ that their centers are not collinear. $k\leq8$ is the number of planes that touch three spheres. $A_{i},B_{i},C_{i}$ is the point that $i$-th plane touch the spheres $S_{1},S_{2},S_{3}$. Let $O_{i}$ be circumcenter of $A_{i}B_{i}C_{i}$. Prove that $O_{i}$ are collinear.

The numbers $1$ and $2$ are written on an empty blackboard. Whenever the numbers $m$ and $n$ appear on the blackboard the number $m + n + mn$ may be written. Can we obtain : (1) $13121$, (2) $12131$?