Find all natural numbers $n$ for which every natural number whose decimal representation has $n-1$ digits $1$ and one digit $7$ is prime.

Call a natural number $n{}$ [i]interesting[/i] if any natural number not exceeding $n{}$ can be represented as the sum of several (possibly one) pairwise distinct positive divisors of $n{}$. [list=a] [*]Find the largest three-digit interesting number. [*]Prove that there are arbitrarily large interesting numbers other than the powers of two. [/list] [i]Proposed by N. Agakhanov[/i]

Let be two distinct natural numbers $ k_1 $ and $ k_2 $ and a sequence $ \left( x_n \right)_{n\ge 0} $ which satisfies $$ x_nx_m +k_1k_2\le k_1x_n +k_2x_m,\quad\forall m,n\in\{ 0\}\cup\mathbb{N}. $$ Calculate $ \lim_{n\to\infty}\frac{n!\cdot (-1)^{1+n}\cdot x_n^2}{n^n} . $

What is remainder when $2014^{2015}$ is divided by $121$? $ \textbf{(A)}\ 45 \qquad\textbf{(B)}\ 34 \qquad\textbf{(C)}\ 23 \qquad\textbf{(D)}\ 12 \qquad\textbf{(E)}\ 1 $

The number of inches in the perimeter of an equilateral triangle equals the number of square inches in the area of its circumscribed circle. What is the radius, in inches, of the circle? $ \textbf{(A)}\ \frac{3\sqrt2}{\pi} \qquad \textbf{(B)}\ \frac{3\sqrt3}{\pi} \qquad \textbf{(C)}\ \sqrt3 \qquad \textbf{(D)}\ \frac{6}{\pi} \qquad \textbf{(E)}\ \sqrt3\pi$

$(a)$ Let $a_1,a_2,a_3$ be three real numbers. Prove that $(a_1-a_2)(a_1-a_3)+(a_2-a_1)(a_2-a_3)+(a_3-a_1)(a_2-a_2)\geq 0$. $(b)$ Prove that the inequality above doesn't hold if we use four number instead of three.

Let $\varphi(k)$ denote the numbers of positive integers less than or equal to $k$ and relatively prime to $k$. Prove that for some positive integer $n$, \[ \varphi(2n-1) + \varphi(2n+1) < \frac{1}{1000} \varphi(2n). \][i]Proposed by Evan Chen[/i]

$n$ wrestlers participate in a tournament such that any two wrestlers wrestle exactly once. After a match, the winner gets $2$ points, the loser gets no point, and each wrestlers gets $1$ point if a tie occurs. After the tournament finishes, the wrestler with highest points is the wrestler with lowest number of wins. What is the least value of $n$? $ \textbf{(A)}\ 5 \qquad\textbf{(B)}\ 6 \qquad\textbf{(C)}\ 7 \qquad\textbf{(D)}\ 8 \qquad\textbf{(E)}\ 9 $

Consider a checkered $3m\times 3m$ square, where $m$ is an integer greater than $1.$ A frog sits on the lower left corner cell $S$ and wants to get to the upper right corner cell $F.$ The frog can hop from any cell to either the next cell to the right or the next cell upwards. Some cells can be [i]sticky[/i], and the frog gets trapped once it hops on such a cell. A set $X$ of cells is called [i]blocking[/i] if the frog cannot reach $F$ from $S$ when all the cells of $X$ are sticky. A blocking set is [i] minimal[/i] if it does not contain a smaller blocking set.[list=a][*]Prove that there exists a minimal blocking set containing at least $3m^2-3m$ cells. [*]Prove that every minimal blocking set containing at most $3m^2$ cells.

If $(3x-1)^7 = a_7x^7 + a_6x^6 + \cdots + a_0$, then $a_7 + a_6 + \cdots + a_0$ equals \[ \text{(A)}\ 0 \qquad \text{(B)}\ 1 \qquad \text{(C)}\ 64 \qquad \text{(D)}\ -64 \qquad \text{(E)}\ 128 \]

Let $ABC$ be a triangle, $G$ it`s centroid, $H$ it`s orthocenter, and $M$ the midpoint of the arc $\widehat{AC}$ (not containing $B$). It is known that $MG=R$, where $R$ is the radius of the circumcircle. Prove that $BG\geq BH$. [i]Proposed by F. Bakharev[/i]

Let $a$, $b$ and $c$ be real numbers such that $\mid a \mid >2$ and $a^2+b^2+c^2=abc+4$. Prove that numbers $x$ and $y$ exist such that $a=x+\frac{1}{x}$, $b=y+\frac{1}{y}$ and $c=xy+\frac{1}{xy}$.

Ryan chooses five subsets $S_1,S_2,S_3,S_4,S_5$ of $\{1, 2, 3, 4, 5, 6, 7\}$ such that $|S_1| = 1$, $|S_2| = 2$, $|S_3| = 3$, $|S_4| = 4$, and $|S_5| = 5$. Moreover, for all $1 \le i < j \le 5$, either $S_i \cap S_j = S_i$ or $S_i \cap S_j = \emptyset$ (in other words, the intersection of $S_i$ and $S_j$ is either $S_i$ or the empty set). In how many ways can Ryan select the sets?

Let $S$ denote $\{1, \dots , 100\}$, and let $f$ be a permutation of $S$ such that for all $x\in S$, $f(x)\ne x$. Over all such $f$, find the maximum number of elements $j$ that satisfy $\underbrace{f(\dots(f(j))\dots)}_{\text{j times}}=j$. [i]Proposed by Hari Desikan[/i]

An alarm clock runs 4 minutes slow every hour. It was set right $ 3 \frac{1}{2}$ hours ago. Now another clock which is correct shows noon. In how many minutes, to the nearest minute, will the alarm clock show noon?

Let $\Gamma_1$ and $\Gamma_2$ be circles internally tangent at point $A$, with $\Gamma_1$ inside $\Gamma_2$. Let $BC$ be a chord of $\Gamma_2$ which is tangent to $\Gamma_1$ at point $D$. Prove that line $AD$ is the angle bisector of $\angle BAC$.

For a given $\alpha >0$ let us consider the regular, non-vanishing $f(z)$ maps on the unit disc $\{ |z|<1 \}$ for which $f(0)=1$ and $\mathrm{Re}\, z\frac{f'(z)}{f(z)}>-\alpha$ ($|z|<1$). Show that the range of $$g(z)=\frac{1}{(1-z)^{2\alpha}}$$ contains the range of all other such functions. Here we consider that regular branch of $g(z)$ for which $g(0)=1$. (translated by Miklós Maróti)

Find all pairs of integers $ x $, $ y $ satisfying the equation $$ (xy-1)^2 = (x +1)^2 + (y +1)^2.$$

Given real numbers $x$ and $y$. Let $s_{1}=x+y, s_{2}=x^2+y^2, s_{3}=x^3+y^3, s_{4}=x^4+y^4$ and $t=xy$. [b]a)[/b] Prove, that number $t$ is rational, if $s_{2}, s_{3}$ and $s_{4}$ are rational numbers. [b]b)[/b] Prove, that number $s_{1}$ is rational, if $s_{2}, s_{3}$ and $s_{4}$ are rational numbers. [b]c)[/b] Can number $s_{1}$ be irrational, if $s_{2}$ and $s_{3}$ are rational numbers?

Denote by $d(n)$ the number of divisors of the positive integer $n$. A positive integer $n$ is called highly divisible if $d(n) > d(m)$ for all positive integers $m < n$. Two highly divisible integers $m$ and $n$ with $m < n$ are called consecutive if there exists no highly divisible integer $s$ satisfying $m < s < n$. (a) Show that there are only finitely many pairs of consecutive highly divisible integers of the form $(a, b)$ with $a\mid b$. (b) Show that for every prime number $p$ there exist infinitely many positive highly divisible integers $r$ such that $pr$ is also highly divisible.

A rhombus has vertices at $(0,0)$, $(6, 8)$, $(16, 8)$, and $(10, 0)$. A line with slope $m$ passes through the point $(3, 1)$ and splits the rhombus into $2$ regions of equal area. Find $m$.

Find all natural numbers $ n\ge 4 $ that satisfy the property that the affixes of any nonzero pairwise distinct complex numbers $ a,b,c $ that verify the equation $$ (a-b)^n+(b-c)^n+(c-a)^n=0, $$ represent the vertices of an equilateral triangle in the complex plane.

Two circles $k_1$ and $k_2$ with radii $r_1$ and $r_2$ have no common points. The line$ AB$ is a common internal tangent, and the line $CD$ is a common external tangent to these circles, where $A, C \in k_1$ and $B, D \in k_2$. Knowing that $AB=12$ and $CD =16$, find the value of the product $r_1r_2$.

Let $p{}$ be a fixed prime number. Determine the number of ordered $k$-tuples $(a_1,\ldots,a_k)$ of non-negative integers smaller than $p{}$ for which $p\mid a_1^2+\cdots+a_k^2$ where a) $k=3$ and b) $k$ is an arbitrary odd positive integer.

For a given natural number $n > 3$, the real numbers $x_1, x_2, \ldots, x_n, x_{n + 1}, x_{n + 2}$ satisfy the conditions $0 < x_1 < x_2 < \cdots < x_n < x_{n + 1} < x_{n + 2}$. Find the minimum possible value of \[\frac{(\sum _{i=1}^n \frac{x_{i + 1}}{x_i})(\sum _{j=1}^n \frac{x_{j + 2}}{x_{j + 1}})}{(\sum _{k=1}^n \frac{x_{k + 1} x_{k + 2}}{x_{k + 1}^2 + x_k x_{k + 2}})(\sum _{l=1}^n \frac{x_{l + 1}^2 + x_l x_{l + 2}}{x_l x_{l + 1}})}\] and find all $(n + 2)$-tuplets of real numbers $(x_1, x_2, \ldots, x_n, x_{n + 1}, x_{n + 2})$ which gives this value.