On a $999\times 999$ board a [i]limp rook[/i] can move in the following way: From any square it can move to any of its adjacent squares, i.e. a square having a common side with it, and every move must be a turn, i.e. the directions of any two consecutive moves must be perpendicular. A [i]non-intersecting route[/i] of the limp rook consists of a sequence of pairwise different squares that the limp rook can visit in that order by an admissible sequence of moves. Such a non-intersecting route is called [i]cyclic[/i], if the limp rook can, after reaching the last square of the route, move directly to the first square of the route and start over. How many squares does the longest possible cyclic, non-intersecting route of a limp rook visit? [i]Proposed by Nikolay Beluhov, Bulgaria[/i]

In the space $n \geq 3$ points are given. Every pair of points determines some distance. Suppose all distances are different. Connect every point with the nearest point. Prove that it is impossible to obtain (closed) polygonal line in such a way.

Let $AB$ be a segment of length $26$, and let points $C$ and $D$ be located on $AB$ such that $AC=1$ and $AD=8$. Let $E$ and $F$ be points on one of the semicircles with diameter $AB$ for which $EC$ and $FD$ are perpendicular to $AB$. Find $EF$. $\textbf{(A) }5\qquad\textbf{(B) }5\sqrt2\qquad\textbf{(C) }7\qquad\textbf{(D) }7\sqrt2\qquad\textbf{(E) }12$

Let $ABC$ be an equilateral triangle with each side of length 1. Let $X$ be a point chosen uniformly at random on side $\overline{AB}$. Let $Y$ be a point chosen uniformly at random on side $\overline{AC}$. (Points $X$ and $Y$ are chosen independently.) Let $p$ be the probability that the distance $XY$ is at most $\dfrac{1}{\sqrt[4]{3}}\,$. What is the value of $900p$, rounded to the nearest integer?

One afternoon at the park there were twice as many dogs as there were people, and there were twice as many people as there were snakes. The sum of the number of eyes plus the number of legs on all of these dogs, people, and snakes was $510$. Find the number of dogs that were at the park.

Consider the function $ f(x) \equal{} \frac {2x^3 \minus{} 3}{3x^2 \minus{} 1}$. $ 1.$ Prove that there is a continuous function $ g(x)$ on $ \mathbb{R}$ satisfying $ f(g(x)) \equal{} x$ and $ g(x) > x$ for all real $ x$. $ 2.$ Show that there exists a real number $ a > 1$ such that the sequence $ \{a_n\}$, $ n \equal{} 1, 2, \ldots$, defined as follows $ a_0 \equal{} a$, $ a_{n \plus{} 1} \equal{} f(a_n)$, $ \forall n\in\mathbb{N}$ is periodic with the smallest period $ 1995$.

We say that a set $A \subset \mathbb Z$ is irregular if, for any different elements $x, y \in A$, there is no element of the form $x + k(y -x)$ different from $x$ and $y$ (where $k$ is an integer). Is there an infinite irregular set?

In the below picture, $T$ is an equilateral triangle with a side length of $5$ and $\omega$ is a circle with a radius of $2$. The triangle and the circle have the same center. Let $X$ be the area of the shaded region, and let $Y$ be the area of the starred region. What is $X - Y$?

Let $k > 1$ be a fixed natural number. Find all polynomials $P(x)$ satisfying the condition $P(x^k) = (P(x))^k$ for all real numbers $x$.

At a party, $25$ elves give each other presents. No elf gives a present to herself. Each elf gives a present to at least one other elf, but no elf gives a present to all other elves. Show that it is possible to choose a group of three elves including at least two elves who give a present to exactly one of the other two elves in the group.

When $12{}^1{}^8$ is divided by $18{}^1{}^2$, the result is $(\tfrac{m}{n})^3$, where $m$ and $n$ are relatively prime integers. Find $m-n$.

Does there exist a pair $(g,h)$ of functions $g,h:\mathbb{R}\rightarrow\mathbb{R}$ such that the only function $f:\mathbb{R}\rightarrow\mathbb{R}$ satisfying $f(g(x))=g(f(x))$ and $f(h(x))=h(f(x))$ for all $x\in\mathbb{R}$ is identity function $f(x)\equiv x$?

Let p be an odd prime, A be a non-empty subset of residue classes modulo p, $f:A\to\mathbb R$. Suppose that f is not constant and satisfies $f(x) \leq \frac{f(x + h) + f(x-h)}{2}$ whenever $x,x+h,x-h\in A$. Prove that $|A| \leq \frac{p + 1}{2}$.

If $p$ is a prime and $n$ an integer such that $1<n \le p$, then \[\phi \left( \sum_{k=0}^{p-1}n^{k}\right) \equiv 0 \; \pmod{p}.\]

For positive integers $k,m$, where $1\le k\le 5$, define the function $f(m,k)$ as \[f(m,k)=\sum_{i=1}^{5}\left[m\sqrt{\frac{k+1}{i+1}}\right]\] where $[x]$ denotes the greatest integer not exceeding $x$. Prove that for any positive integer $n$, there exist positive integers $k,m$, where $1\le k\le 5$, such that $f(m,k)=n$.

Octagon $ABCDEFGH$ with side lengths $AB = CD = EF = GH = 10$ and $BC= DE = FG = HA = 11$ is formed by removing four $6-8-10$ triangles from the corners of a $23\times 27$ rectangle with side $\overline{AH}$ on a short side of the rectangle, as shown. Let $J$ be the midpoint of $\overline{HA}$, and partition the octagon into $7$ triangles by drawing segments $\overline{JB}$, $\overline{JC}$, $\overline{JD}$, $\overline{JE}$, $\overline{JF}$, and $\overline{JG}$. Find the area of the convex polygon whose vertices are the centroids of these $7$ triangles. [asy] unitsize(6); pair P = (0, 0), Q = (0, 23), R = (27, 23), SS = (27, 0); pair A = (0, 6), B = (8, 0), C = (19, 0), D = (27, 6), EE = (27, 17), F = (19, 23), G = (8, 23), J = (0, 23/2), H = (0, 17); draw(P--Q--R--SS--cycle); draw(J--B); draw(J--C); draw(J--D); draw(J--EE); draw(J--F); draw(J--G); draw(A--B); draw(H--G); real dark = 0.6; filldraw(A--B--P--cycle, gray(dark)); filldraw(H--G--Q--cycle, gray(dark)); filldraw(F--EE--R--cycle, gray(dark)); filldraw(D--C--SS--cycle, gray(dark)); dot(A); dot(B); dot(C); dot(D); dot(EE); dot(F); dot(G); dot(H); dot(J); dot(H); defaultpen(fontsize(10pt)); real r = 1.3; label("$A$", A, W*r); label("$B$", B, S*r); label("$C$", C, S*r); label("$D$", D, E*r); label("$E$", EE, E*r); label("$F$", F, N*r); label("$G$", G, N*r); label("$H$", H, W*r); label("$J$", J, W*r); [/asy]

Original in Hungarian; translated with Google translate; polished by myself. Prove that, the signs $\varepsilon_n = \pm 1$ can be chosen such that the function $f(s) = \sum_{n = 1}^\infty\frac{\varepsilon_n}{n^s}\colon \{s\in\Bbb C:\operatorname{Re}s > 1\}\to \Bbb C$ converges to every complex value at every point $\xi \in \{s\in\Bbb C:\operatorname{Re}s = 1\}$ (i.e. for every $\xi \in \{s\in\Bbb C:\operatorname{Re}s = 1\}$ and every $z \in \Bbb C$, there exists a sequence $s_n \to \xi$, $\operatorname{Re}s_n > 1$, for which $f(s_n) \to z$).

There are $18$ students in a class. Each student is asked two questions: how many other students have the same first name as you and how many other students have the same surname as you. The answers $0, 1, 2, . . ., 7$ all occur. Prove that there are two students with the same first name and last name.

Let $a$, $b$ be positive integers such that $b^n+n$ is a multiple of $a^n+n$ for all positive integers $n$. Prove that $a=b$. [i]Proposed by Mohsen Jamali, Iran[/i]

For every nonempty set of real numbers $S{}$ denote $\sigma(S)$ the sum of its elements. Let $A{}$ be a set of $n{}$ positive integers. Show that the set of all sums $\sigma{}$ of all nonempty sets of $A{}$ can be partitioned in $n{}$ groups such that the ratio between the greatest number and the smallest number from each group is less than $2$.

$24$ students attend a mathematical circle. For any team consisting of $6$ students, the teacher considers it to be either [b]GOOD [/b] or [b]OK[/b]. For the tournament of mathematical battles, the teacher wants to partition all the students into $4$ teams of $6$ students each. May it happen that every such partition contains either $3$ [b]GOOD[/b] teams or exactly one [b]GOOD[/b] team and both options are present?

Let $M$ and $N$ be points on the side $BC$ of a triangle $ABC$ such that $BM = CN$ ($M$ lies between $B$ and $N$). Points $P$ and $Q$ lie on $AN$ and $AM$ respectively, so that $\angle PMC =\angle MAB$ and $\angle QNB = \angle NAC$. Prove that $\angle QBC = \angle PCB$.

In the array of $13$ squares shown below, $8$ squares are colored red, and the remaining $5$ squares are colored blue. If one of all possible such colorings is chosen at random, the probability that the chosen colored array appears the same when rotated $90^{\circ}$ around the central square is $\tfrac{1}{n}$, where $n$ is a positive integer. Find $n$. [asy] draw((0,0)--(1,0)--(1,1)--(0,1)--(0,0)); draw((2,0)--(2,2)--(3,2)--(3,0)--(3,1)--(2,1)--(4,1)--(4,0)--(2,0)); draw((1,2)--(1,4)--(0,4)--(0,2)--(0,3)--(1,3)--(-1,3)--(-1,2)--(1,2)); draw((-1,1)--(-3,1)--(-3,0)--(-1,0)--(-2,0)--(-2,1)--(-2,-1)--(-1,-1)--(-1,1)); draw((0,-1)--(0,-3)--(1,-3)--(1,-1)--(1,-2)--(0,-2)--(2,-2)--(2,-1)--(0,-1)); size(100); [/asy]

The state income tax where Kristin lives is levied at the rate of $ p\%$ of the first $ \$28000$ of annual income plus $ (p \plus{} 2)\%$ of any amount above $ \$28000$. Kristin noticed that the state income tax she paid amounted to $ (p \plus{} 0.25)\%$ of her annual income. What was her annual income? $ \textbf{(A) }\$28000\qquad\textbf{(B) }\$32000\qquad\textbf{(C) }\$35000\qquad\textbf{(D) }\$42,000\qquad\textbf{(E) }\$56000$

Let $ABC$ be a triangle inscribed in the circle $\mathcal{C}(O,1)$. Denote by $s(M)=OH_1^2+OH_2^2+OH_3^2,$ $(\forall) M \in\mathcal{C}\setminus \left\{A,B,C\right\},$ where $H_1,H_2,H_3,$ are the orthocenters of the triangles $MAB,~MBC$ and $MCA.$ $a)$ Prove that if $ABC$ is equilateral$,$ then $s(M)=6,(\forall) M \in\mathcal{C}\setminus \left\{A,B,C\right\},$ $b)$ Prove that if there exist three distinct points $M_1,M_2,M_3\in\mathcal{C}\setminus \left\{A,B,C\right\}$ such that $s(M_1)=$$s(M_2)$$=s(M_3),$ then $ABC$ is equilateral$.$