In a company of $n$ persons, each person has no more than $d$ acquaintances, and in that company there exists a group of $k$ persons, $k\ge d$, who are not acquainted with each other. Prove that the number of acquainted pairs is not greater than $\left[ \frac{n^2}{4}\right]$.

Let $A', B' , C'$ be the projections of a point $M$ inside a triangle $ABC$ onto the sides $BC, CA, AB$, respectively. Define $p(M ) = \frac{MA'\cdot MB'\cdot MC'}{MA \cdot MB \cdot MC}$ . Find the position of point $M$ that maximizes $p(M )$.

A sphere is inscribed into a quadrangular pyramid. The point of contact of the sphere with the base of the pyramid is projected to the edges of the base. Prove that these projections are concyclic.

(a) Let $k$ be an natural number so that the equation $ab + (a + 1) (b + 1) = 2^k$ does not have a positive integer solution $(a, b)$. Show that $k + 1$ is a prime number. (b) Show that there are natural numbers $k$ so that $k + 1$ is prime numbers and equation $ab + (a + 1) (b + 1) = 2^k$ has a positive integer solution $(a, b)$.

Bela and Jenn play the following game on the closed interval $[0, n]$ of the real number line, where $n$ is a fixed integer greater than $4$. They take turns playing, with Bela going first. At his first turn, Bela chooses any real number in the interval $[0, n]$. Thereafter, the player whose turn it is chooses a real number that is more than one unit away from all numbers previously chosen by either player. A player unable to choose such a number loses. Using optimal strategy, which player will win the game? $\textbf{(A) } \text{Bela will always win.}$ $\textbf{(B) } \text{Jenn will always win.} $ $\textbf{(C) } \text{Bela will win if and only if }n \text{ is odd.}$ $\textbf{(D) } \text{Jenn will win if and only if }n \text{ is odd.} $ $\textbf{(E) } \text{Jenn will win if and only if }n > 8.$

Let $\mathbb N_0$ be the set of non-negative integers. There is a triple $(f,a,b)$, where $f$ is a function from $\mathbb N_0$ to $\mathbb N_0$ and $a,b\in\mathbb N_0$ that satisfies the following conditions: [list] [*]$f(1)=2$ [*]$f(a)+f(b)\leq 2\sqrt{f(a)}$ [*]For all $n>0$, we have $f(n)=f(n-1)f(b)+2n-f(b)$ [/list] Find the sum of all possible values of $f(b+100)$.

Prove that for all positive integers $ n$: $ \frac{2n}{3n\plus{}1} \le \displaystyle\sum_{k\equal{}n\plus{}1}^{2n}\frac{1}{k} \le \frac{3n\plus{}1}{4(n\plus{}1)}$.

Given is a convex polyhedron with $ k $ faces $ S_1, \ldots, S_k $. Let us denote the vector of length 1 perpendicular to the wall $ S_i $ ($ i = 1, \ldots, k $) directed outside the given polyhedron by $ \overrightarrow{n_i} $, and the surface area of this wall by $ P_i $. Prove that $$ \sum_{i=1}^k P_i \cdot \overrightarrow{n_i} = \overrightarrow{0}.$$

For a positive integer $n$, denote $A_n=\{(x,y)\in\mathbb Z^2|x^2+xy+y^2=n\}$. (a) Prove that the set $A_n$ is always finite. (b) Prove that the number of elements of $A_n$ is divisible by $6$ for all $n$. (c) For which $n$ is the number of elements of $A_n$ divisible by $12$?

Let $p, u, m, a, c$ be positive real numbers satisfying $5p^5+4u^5+3m^5+2a^5+c^5=91$. What is the maximum possible value of: \[18pumac + 2(2 + p)^2 + 23(1 + ua)^2 + 15(3 + mc)^2?\]

Let $c(O, R)$ be a circle, $AB$ a diameter and $C$ an arbitrary point on the circle different than $A$ and $B$ such that $\angle AOC > 90^o$. On the radius $OC$ we consider point $K$ and the circle $c_1(K, KC)$. The extension of the segment $KB$ meets the circle $(c)$ at point $E$. From $E$ we consider the tangents $ES$ and $ET$ to the circle $(c_1)$. Prove that the lines $BE, ST$ and $AC$ are concurrent.

In each unit square of square $100*100$ write any natural number. Called rectangle with sides parallel sides of square $good$ if sum of number inside rectangle divided by $17$. We can painted all unit squares in $good$ rectangle. One unit square cannot painted twice or more. Find maximum $d$ for which we can guaranteed paint at least $d$ points.

Given $15$ coins of the same appearance. It is known that one of them weighs $1$g, two coins weigh $2$g each, three coins weigh $3$g each, four coins weigh $4$g each, and five coins weigh $5$g each. There are inscriptions on the coins, indicating their weight. It is allowed to perform two weighings on a balance without additional weights. Find a way to check that there are no wrong inscriptions. (It is not required to check which inscriptions are wrong and which ones are correct.) (8 marks)

On an international conference there are 4 official languages. Each two of the attendees can have a conversation on one of the languages. Prove that at least 60% of the attendees can speak the same language.

Let $k$ be a positive integer. A natural number $m$ is called [i]$k$-typical[/i] if each divisor of $m$ leaves the remainder $1$ when being divided by $k$. Prove: [b]a)[/b] If the number of all divisors of a positive integer $n$ (including the divisors $1$ and $n$) is $k$-typical, then $n$ is the $k$-th power of an integer. [b]b)[/b] If $k > 2$, then the converse of the assertion [b]a)[/b] is not true.

Find an arithmetic progression of $2016$ natural numbers such that neither is a perfect power but its multiplication is a perfect power. Clarification: A perfect power is a number of the form $n^k$ where $n$ and $k$ are both natural numbers greater than or equal to $2$.

We call a positive integer [i]interesting [/i] if the number and the number with its digits written in reverse order both leave remainder $2$ in division by $4$. a) Determine if $2018$ is an interesting number. b) For every positive integer $n$, find how many interesting $n$-digit numbers there are.

Given any integer $ n \geq 2,$ assume that the integers $ a_1, a_2, \ldots, a_n$ are not divisible by $ n$ and, moreover, that $ n$ does not divide $ \sum^n_{i\equal{}1} a_i.$ Prove that there exist at least $ n$ different sequences $ (e_1, e_2, \ldots, e_n)$ consisting of zeros or ones such $ \sum^n_{i\equal{}1} e_i \cdot a_i$ is divisible by $ n.$

Prove that the application $ \mathbb{R}\ni x\mapsto 2x+ \{ x\} $ and its inverse are bijective and continuous.

If $xy = a, xz =b,$ and $yz = c$, and none of these quantities is zero, then $x^2+y^2+z^2$ equals: $ \textbf{(A)}\ \frac{ab+ac+bc}{abc}\qquad\textbf{(B)}\ \frac{a^2+b^2+c^2}{abc}\qquad\textbf{(C)}\ \frac{(a+b+c)^2}{abc}\qquad\textbf{(D)}\ \frac{(ab+ac+bc)^2}{abc}\qquad\textbf{(E)}\ \frac{(ab)^2+(ac)^2+(bc)^2}{abc} $

A strategical video game consists of a map of finitely many towns. In each town there are $k$ directions, labelled from $1$ through $k$. One of the towns is designated as initial, and one – as terminal. Starting from the initial town the hero of the game makes a finite sequence of moves. At each move the hero selects a direction from the current town. This determines the next town he visits and a certain positive amount of points he receives. Two strategical video games are equivalent if for every sequence of directions the hero can reach the terminal town from the initial in one game, he can do so in the other game, and, in addition, he accumulates the same amount of points in both games. For his birthday John receives two strategical video games – one with $N$ towns and one with $M$ towns. He claims they are equivalent. Marry is convinced they are not. Marry is right. Prove that she can provide a sequence of at most $N +M$ directions that shows the two games are indeed not equivalent. [i]Stefan Gerdjikov, Bulgaria[/i]

Let $AC$ be a line segment in the plane and $B$ a points between $A$ and $C$. Construct isosceles triangles $PAB$ and $QAC$ on one side of the segment $AC$ such that $\angle APB = \angle BQC = 120^{\circ}$ and an isosceles triangle $RAC$ on the other side of $AC$ such that $\angle ARC = 120^{\circ}.$ Show that $PQR$ is an equilateral triangle.

A function $ f:\mathbb{R}^2\longrightarrow\mathbb{R} $ is [i]olympic[/i] if, any finite number of pairwise distinct elements of $ \mathbb{R}^2 $ at which the function takes the same value represent in the plane the vertices of a convex polygon. Prove that if $ p $ if a complex polynom of degree at least $ 1, $ then the function $ \mathbb{R}^2\ni (x,y)\mapsto |p(x+iy)| $ is olympic if and only if the roots of $ p $ are all equal.

Let $(I_b)$, $(I_c)$ are excircles of a triangle $ABC$. Given a circle $ \omega $ passes through $A$ and externally tangents to the circles $(I_b)$ and $(I_c)$ such that it intersects with $BC$ at points $M$, $N$. Prove that $ \angle BAM=\angle CAN $. A. Smirnov

At a conference, six people place their name badges in a hat, which is shaken up; one badge is then distributed to each person such that each distribution is equally likely. Each turn, every person who does not yet have their own badge finds the person whose badge they have and takes that person's badge. For example, if Alice has Bob's badge and Bob has Charlie's badge, Alice would have Charlie's badge after a turn. Compute the probability that everyone will eventually end up with their own badge.