There are infinitely many people registered on the social network Mugbook. Some pairs of (different) users are registered as friends, but each person has only finitely many friends. Every user has at least one friend. (Friendship is symmetric; that is, if $A$ is a friend of $B$, then $B$ is a friend of $A$.) Each person is required to designate one of their friends as their best friend. If $A$ designates $B$ as her best friend, then (unfortunately) it does not follow that $B$ necessarily designates $A$ as her best friend. Someone designated as a best friend is called a $1$-best friend. More generally, if $n> 1$ is a positive integer, then a user is an $n$-best friend provided that they have been designated the best friend of someone who is an $(n-1)$-best friend. Someone who is a $k$-best friend for every positive integer $k$ is called popular. (a) Prove that every popular person is the best friend of a popular person. (b) Show that if people can have infinitely many friends, then it is possible that a popular person is not the best friend of a popular person. [i]Romania (Dan Schwarz)[/i]

Let $k\geqslant 2$ be an integer. Consider the sequence $(x_n)_{n\geqslant 1}$ defined by $x_1=a>0$ and $x_{n+1}=x_n+\lfloor k/x_n\rfloor$ for $n\geqslant 1.$ Prove that the sequence is convergent and determine its limit.

Two equal circles $S_1$ and $S_2$ meet at two different points. The line $\ell$ intersects $S_1$ at points $A,C$ and $S_2$ at points $B,D$ respectively (the order on $\ell$: $A,B,C,D$) . Define circles $\Gamma_1$ and $\Gamma_2$ as follows: both $\Gamma_1$ and $\Gamma_2$ touch $S_1$ internally and $S_2$ externally, both $\Gamma_1$ and $\Gamma_2$ line $\ell$, $\Gamma_1$ and $\Gamma_2$ lie in the different halfplanes relatively to line $\ell$. Suppose that $\Gamma_1$ and $\Gamma_2$ touch each other. Prove that $AB=CD$. I. Voronovich

Let $P$ be a convex polygon. Prove that there exists a convex hexagon that is contained in $P$ and whose area is at least $\frac34$ of the area of the polygon $P$. [i]Alternative version.[/i] Let $P$ be a convex polygon with $n\geq 6$ vertices. Prove that there exists a convex hexagon with [b]a)[/b] vertices on the sides of the polygon (or) [b]b)[/b] vertices among the vertices of the polygon such that the area of the hexagon is at least $\frac{3}{4}$ of the area of the polygon. [i]Proposed by Ben Green and Edward Crane, United Kingdom[/i]

Six line segments of lengths $17, 18, 19, 20, 21$ and $23$ form the side edges of a triangular pyramid (also called a tetrahedron). Can there exist a sphere tangent to all six lines?

Find all the real numbers $x$ such that $\frac{1}{[x]}+\frac{1}{[2x]}=\{x\}+\frac{1}{3}$ where $[x]$ denotes the integer part of $x$ and $\{x\}=x-[x]$. For example, $[2.5]=2, \{2.5\} = 0.5$ and $[-1.7]= -2, \{-1.7\} = 0.3$

The triangle $ABC$ is given. Let $A', B'$ and $C'$ be the midpoints of the sides $BC, CA$ and $AB$ and $O_a,O_b$ and $O_c$ be the circumcenters of the triangles $CAC', ABA'$ and $BCB'$ respectively. Prove that the triangles $ABC$ and $O_aO_bO_c$ are similar. [i]Proposed by Don Luu (Vietnam)[/i]

Find the number of all $ 6$-digit natural numbers such that the sum of their digits is $ 10$ and each of the digits $ 0,1,2,3$ occurs at least once in them. [14 points out of 100 for the 6 problems]

Find all natural numbers \( n \) for which it is possible to construct an \( n \times n \) square using only tetrominoes like the one below:

Circles with radii $R$ and $r$ ($R > r$) are externally tangent. Another common tangent of the circles in drawn. This tangent and the circles bound a region inside which a circle as large as possible is drawn. What is the radius of this circle?

Which of the following could not be the unit's digit [one's digit] of the square of a whole number? $ \text{(A)}\ 1\qquad\text{(B)}\ 4\qquad\text{(C)}\ 5\qquad\text{(D)}\ 6\qquad\text{(E)}\ 8 $

Does there exist a finite set $A$ of positive integers of at least two elements and an infinite set $B$ of positive integers, such that any two distinct elements in $A+B$ are coprime, and for any coprime positive integers $m,n$, there exists an element $x$ in $A+B$ satisfying $x\equiv n \pmod m$ ? Here $A+B=\{a+b|a\in A, b\in B\}$.

For how many integers $k$ such that $0 \le k \le 2014$ is it true that the binomial coefficient $\binom{2014}{k}$ is a multiple of 4?

Find the number of ways to arrange the letters in $LE X I NGTON$ such that the string $LE X$ does not appear.

On a blackboard, there are $10$ numbers written: $1, 2, \dots, 10$. Nahyun repeatedly performs the following operations. [b](Operation)[/b] Nahyun chooses two numbers from the 10 numbers on the blackboard that are not in a divisor-multiple relationship, erases them, and writes their GCD and LCM on the blackboard. If every two numbers on the blackboard form a divisor-multiple relationship, Nahyun stops the process. What is the maximum number of operations Nahyun can perform? (Note: $a, b$ are in a divisor-multiple relationship iff $a \mid b$ or $b \mid a$.)

Find all pairs $(p,q)$ of prime numbers which $p>q$ and $$\frac{(p+q)^{p+q}(p-q)^{p-q}-1}{(p+q)^{p-q}(p-q)^{p+q}-1}$$ is an integer.

$22$ light bulbs are given. Each light bulb is connected to exactly one switch, but a switch can be connected to one or more light bulbs. Find the least number of switches we should have such that we can turn on whatever number of light bulbs.

The roots of the equation $x^2+4x-5 = 0$ are also the roots of the equation $2x^3+9x^2-6x-5 = 0$. What is the third root of the second equation?

Find all integers $x,y,z$ such that \[x^3+y^3+z^3=x+y+z=8\]

The square $ PQRS$ is placed inside the square $ABCD$ in such a way that the segments $AP$, $BQ$, $CR$ and $DS$ intersect neither each other nor the square $PQRS$. Prove that the sum of areas of quadrilaterals $ABQP$ and $CDSR$ is equal to the sum of the areas of quadrilaterals $BCRQ$ and $DAPS$. (Folklore)

For each positive integer n, let $ f(n) \equal{} \sum_{k \equal{} 1}^{100} \lfloor \log_{10} (kn) \rfloor$. Find the largest value of n for which $ f(n) \le 300$. [b]Note:[/b] $ \lfloor x \rfloor$ is the greatest integer less than or equal to $ x$.

There is a white table with a pile of $2008$ coins and there are two empty black tables. At each move, the uppermost coin on a table is transferred to an empty table or to the top of the pile on a non-empty table. What is the least number of moves required to reverse the pile at the beginning on the white table? $ \textbf{(A)}\ 6016 \qquad\textbf{(B)}\ 6017 \qquad\textbf{(C)}\ 6022 \qquad\textbf{(D)}\ 6023 \qquad\textbf{(E)}\ 6024 $

We consider the equation $x^2 + (a + b - 1)x + ab - a - b = 0$, where $a$ and $b$ are positive integers with $a \leq b$. a) Show that the equation has $2$ distinct real solutions. b) Prove that if one of the solutions is an integer, then both solutions are non-positive integers and $b < 2a.$

In this problem, we consider only polynomials with integer coeffients. Call two polynomials $p$ and $q$ [i]really close[/i] if $p(2k + 1) \equiv q(2k + 1)$ (mod $210$) for all $k \in Z^+$. Call a polynomial $p$ [i]partial credit[/i] if no polynomial of lesser degree is [i]really close[/i] to it. What is the maximum possible degree of [i]partial credit[/i]?

Prove that $ n $ must be prime in order to have only one solution to the equation $\frac{1}{x}-\frac{1}{y}=\frac{1}{n}$, $x,y\in\mathbb{N}$.