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.

The identifier of a book is an n-tuple of numbers 0, 1, .... , 9, followed by a checksum. The checksum is computed by a fixed rule that satisfies the following property: whenever one increases a single number in the n-tuple (without modifying the other numbers), the checksum also increases. Find the smallest possible number of required checksums if all possible n-tuples are in use.

Could the three-dimensional space be expressed as the union of disjoint circumferences?

Let $k>1$ be an integer, set $n=2^{k+1}$. Prove that for any positive integers $a_1<a_2<\cdots<a_n$, the number $\prod_{1\leq i<j\leq n}(a_i+a_j)$ has at least $k+1$ different prime divisors.

The width of a lane in a circular running track is $1.22$ meters. One loop in the first lane (shortest lane) is $400$ meters. Thus $12.5$ loops makes it a $5{,}000$ meter distance. Which lane should an athlete run in if they want to make $12$ loops as close to the $5{,}000$ meter distance as possible? \[\rm a. ~second\qquad \mathrm b. ~third \qquad \mathrm c. ~fourth \qquad\mathrm d. ~fifth \qquad\mathrm e. ~sixth\]

Find all pairs $(x,y)$ of positive integers that satisfy $$2^x+17=y^4$$.

Two walls and the ceiling of a room meet at right angles at point $P$. A fly is in the air one meter from one wall, eight meters from the other wall, and $9$ meters from point $P$. How many meters is the fly from the ceiling? $\textbf{(A) }\sqrt{13}\qquad\textbf{(B) }\sqrt{14}\qquad\textbf{(C) }\sqrt{15}\qquad\textbf{(D) }4\qquad\textbf{(E) }\sqrt{17}$

In a class of seven students, a poll is conducted. The poll asks $~$(a) Were you born after $2021$? $~$(b) Were you born after $2019$? $~$(c) Were you born in $2020$? Five students respond "yes" to question (a), and four students respond "no" to question (b). If everyone truthfully answers all questions, how many students responded "yes" to (c)? $\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }4\qquad\textbf{(E) }5$

Given are two disjoint sets $ A$ and $ B$ such that their union is $ \mathbb N$. Prove that for all positive integers $ n$ there exist different numbers $ a$ and $ b$, both greater than $ n$, such that either $ \{ a,b,a \plus{} b \}$ is contained in $ A$ or $ \{ a,b,a \plus{} b \}$ is contained in $ B$.

Let $x$, $y$, and $z$ be real numbers satisfying the system of equations \begin{align*} xy+4z&=60\\ yz+4x&=60\\ zx+4y&=60. \end{align*} Let $S$ be the set of possible values of $x$. Find the sum of the squares of the elements of $S$.

There are $n$ passengers in a line, waiting to board a plane with $n$ seats. For $1 \le k \le n$, the $k^{th}$ passenger in line has a ticket for the $k^{th}$ seat. However, the rst passenger ignores his ticket, and decides to sit in a seat at random. Thereafter, each passenger sits as follows: If his/her assigned is empty, then he/she sits in it. Otherwise, he/she sits in an empty seat at random. How many different ways can all $n$ passengers be seated?

The numbers from 1 to $ 2013^2 $ are written row by row into a table consisting of $ 2013 \times 2013 $ cells. Afterwards, all columns and all rows containing at least one of the perfect squares $ 1, 4, 9, \cdots, 2013^2 $ are simultaneously deleted. How many cells remain?

Let $p$ be a prime number, determine all positive integers $(x, y, z)$ such that: $x^p + y^p = p^z$

In a non-isosceles triangle $ABC$, let $I$ be its incenter. The incircle of $ABC$ touches $BC$, $CA$, and $AB$ at $D$, $E$, and $F$, respectively. A line passing through $D$ and perpendicular to $AD$ intersects $IB$ and $IC$ at $A_b$ and $A_c$, respectively. Define the points $B_c$, $B_a$, $C_a$, and $C_b$ similarly. Let $G$ be the intersection of the cevians $AD$, $BE$, and $CF$. The points $O_1$ and $O_2$ are the circumcenter of the triangles $A_bB_cC_a$ and $A_cB_aC_b$, respectively. Prove that $IG$ is the perpendicular bisector of $O_1O_2$.

The finite sequence $a_1, a_2, ... , a_n$ of ones and zeroes should satisfy a condition: [i]for every $k$ from $0$ to $(n-1)$ the sum a_1a_{k+1} + a_2a_{k+2} + ... + a_{n-k}a_n should be odd.[/i] a) Construct such a sequence for $n=25$. b) Prove that there exists such a sequence for some $n > 1000$.

For each positive integer $n$ let $A_n$ be the $n \times n$ matrix such that its $a_{ij}$ entry is equal to ${i+j-2 \choose j-1}$ for all $1\leq i,j \leq n.$ Find the determinant of $A_n$.