Let $m$ and $n$ be fixed distinct positive integers. A wren is on an infinite board indexed by $\mathbb Z^2$, and from a square $(x,y)$ may move to any of the eight squares $(x\pm m, y\pm n)$ or $(x\pm n, y \pm m)$. For each $\{m,n\}$, determine the smallest number $k$ of moves required to travel from $(0,0)$ to $(1,0)$, or prove that no such $k$ exists. [i]Proposed by Michael Ren

Let $M = \{1, 2, 3, 4, 6, 8,12,16, 24, 48\} .$ Find out which of four-element subsets of $M$ are more: those with product of all elements greater than $2009$ or those with product of all elements less than $2009.$

Determine the integers $x$ such that $2^x + x^2 + 25$ is the cube of a prime number

Consider the triangle $ABC$, where $\angle B= 30^o, \angle C = 15^o$, and $M$ is the midpoint of the side $[BC]$. Let point $N \in (BC)$ be such that $[NC] = [AB]$. Show that $[AN$ is the angle bisector of $MAC$

Let $a_1\in(0,1)$ and define recursively the sequence $(a_n)_{n\geq 1}$ by $a_{n+1}=3a_n-4a_n^3$ for all $n\geq 1$. a) Prove that for all $n$ we have $|a_n|<1$. b) Prove that for any $k\geq 2$ we can choose $a_1\in(0,1)$ adequately such that $a_{n+k}=a_n$ for all $n\geq 1$. [i]Sergiu Moroianu[/i]

When simplified $ \sqrt{1\plus{} \left (\frac{x^4\minus{}1}{2x^2} \right )^2}$ equals: $ \textbf{(A)}\ \frac{x^4\plus{}2x^2\minus{}1}{2x^2} \qquad \textbf{(B)}\ \frac{x^4\minus{}1}{2x^2} \qquad \textbf{(C)}\ \frac{\sqrt{x^2\plus{}1}}{2} \\ \textbf{(D)}\ \frac{x^2}{\sqrt{2}} \qquad \textbf{(E)}\ \frac{x^2}{2}\plus{}\frac{1}{2x^2}$

For a prime $p$, let $\mathbb{F}_p$ denote the integers modulo $p$, and let $\mathbb{F}_p[x]$ be the set of polynomials with coefficients in $\mathbb{F}_p$. Find all $p$ for which there exists a quartic polynomial $P(x) \in \mathbb{F}_p[x]$ such that for all integers $k$, there exists some integer $\ell$ such that $P(\ell) \equiv k \pmod p$. (Note that there are $p^4(p-1)$ quartic polynomials in $\mathbb{F}_p[x]$ in total.) [i]Aprameya Tripathy[/i]

Let $a$ be a positive integer such that $5^{1994}-1\mid a$. Prove that the expression of $a$ in base $5$ contains at least $1994$ nonzero digits.

In a room, there are $n$ lights numbered with positive integers $1, 2, \ldots, n$. At the beginning of the game subsets $S_1, S_2,\ldots,S_k$ of $\{1,\ldots, n\}$ can be chosen. For every integer $1\le i\le k$, there is a button that turns on the lights corresponding to the elements of $S_i$ and also a button that turns off all the lights corresponding to the elements of $S_i$. For any positive integer $n$, determine the smallest $k$ for which it is possible to choose the sets $S_1, S_2, \ldots, S_n$ in such a way that allows any combination of the $n$ lights to be turned on, starting from the state where all the lights are off. [i]Proposed by Kristóf Zólomy, Budapest[/i]

Assume that $M \subset N$ has the property that every two numbers $m,n$ of $M$ satisfy $|m-n| \ge mn/25$. Prove that the set $M$ contains no more than $9$ elements. Decide whether there exists such set M.

Let $a,b$ be two positive integers and $a>b$.We know that $\gcd(a-b,ab+1)=1$ and $\gcd(a+b,ab-1)=1$. Prove that $(a-b)^2+(ab+1)^2$ is not a perfect square.

Three equally spaced parallel lines intersect a circle, creating three chords of lengths $38, 38,$ and $34.$ What is the distance between two adjacent parallel lines? $\textbf{(A)}\ 5\frac{1}{2} \qquad\textbf{(B)}\ 6 \qquad\textbf{(C)}\ 6\frac{1}{2} \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 7\frac{1}{2}$

In a certain language there are only two letters, $A$ and $B$. We know that (i) There are no words of length $1$, and the only words of length $2$ are $AB$ and $BB$. (ii) A segment of length $n > 2$ is a word if and only if it can be obtained from a word of length less than $n$ by replacing each letter $B$ by some (not necessarily the same) word. Prove that the number of words of length $n$ is equal to $\frac{2^n +2\cdot (-1)^n}{3}$

Let $n$ and $z$ be integers greater than $1$ and $(n,z)=1$. Prove: (a) At least one of the numbers $z_i=1+z+z^2+\cdots +z^i,\ i=0,1,\ldots ,n-1,$ is divisible by $n$. (b) If $(z-1,n)=1$, then at least one of the numbers $z_i$ is divisible by $n$.

Let $ABC$ be an equilateral triangle of side $1$. There are three grasshoppers sitting in $A$, $B$, $C$. At any point of time for any two grasshoppers separated by a distance $d$ one of them can jump over other one so that distance between them becomes $2kd$, $k,d$ are nonfixed positive integers. Let $M$, $N$ be points on rays $AB$, $AC$ such that $AM=AN=l$, $l$ is fixed positive integer. In a finite number of jumps all of grasshoppers end up sitting inside the triangle $AMN$. Find, in terms of $l$, the number of final positions of the grasshoppers. (Grasshoppers can leave the triangle $AMN$ during their jumps.)

We are given a triangle $ABC$ and two circles ($k_1$ and $k_2$) so the diameter of $k_1$ is $AB$ and the diameter of $k_2$ is $AC$. Let the intersection of $BC$ line segment and $k_1$ (that isn’t $B$) be $P,$ and the intersection of $BC$ line segment and $k_2$ (that isn’t $B$) be $Q$. We know, that $AB = 3003$ and $AC = 4004$ and $BC = 5005$. What is the distance between $P$ and $Q$?

We define two types of operation on polynomial of third degree: a) switch places of the coefficients of polynomial(including zero coefficients), ex: $ x^3+x^2+3x-2 $ => $ -2x^3+3x^2+x+1$ b) replace the polynomial $P(x)$ with $P(x+1)$ If limitless amount of operations is allowed, is it possible from $x^3-2$ to get $x^3-3x^2+3x-3$ ?

The points of this lattice $4\times 4 = 16$ points can be vertices of squares. [asy] unitsize(1 cm); int i, j; for (i = 0; i <= 3; ++i) { draw((i,0)--(i,3)); draw((0,i)--(3,i)); } draw((1,1)--(2,2)--(1,3)--(0,2)--cycle); for (i = 0; i <= 3; ++i) { for (j = 0; j <= 3; ++j) { dot((i,j)); }} [/asy] Calculate the number of different squares that can be formed in a lattice of $100\times 100$ points.

On a circle, Alina draws $2019$ chords, the endpoints of which are all different. A point is considered [i]marked[/i] if it is either $\text{(i)}$ one of the $4038$ endpoints of a chord; or $\text{(ii)}$ an intersection point of at least two chords. Alina labels each marked point. Of the $4038$ points meeting criterion $\text{(i)}$, Alina labels $2019$ points with a $0$ and the other $2019$ points with a $1$. She labels each point meeting criterion $\text{(ii)}$ with an arbitrary integer (not necessarily positive). Along each chord, Alina considers the segments connecting two consecutive marked points. (A chord with $k$ marked points has $k-1$ such segments.) She labels each such segment in yellow with the sum of the labels of its two endpoints and in blue with the absolute value of their difference. Alina finds that the $N + 1$ yellow labels take each value $0, 1, . . . , N$ exactly once. Show that at least one blue label is a multiple of $3$. (A chord is a line segment joining two different points on a circle.)

About pentagon $ABCDE$ is known that angle $A$ and angle $C$ are right and that the sides $| AB | = 4$, $| BC | = 5$, $| CD | = 10$, $| DE | = 6$. Furthermore, the point $C'$ that appears by mirroring $C$ in the line $BD$, lies on the line segment $AE$. Find angle $E$.

Let $n$ be a positive integer. $S$ is the set of nonnegative integers $a$ such that $1<a<n$ and $a^{a-1}-1$ is divisible by $n$. Prove that if $S=\{ n-1 \}$ then $n=2p$ where $p$ is a prime number. [i]Mihai Cipu and Nicolae Ciprian Bonciocat[/i]

A honeybug crawls along the honeycombs with the unite length of their hexagons. He has moved from the node $A$ to the node $B$ along the shortest possible trajectory. Prove that the half of his way he moved in one direction.

Let $Oxy$ be a fixed rectangular coordinate system in the plane. Each ordered pair of points $A_1, A_2$ from the same plane which are different from O and have coordinates $x_1, y_1$ and $x_2, y_2$ respectively is associated with real number $f(A_1,A_2)$ in such a way that the following conditions are satisfied: (a) If $OA_1 = OB_1$, $OA_2 = OB_2$ and $A_1A_2 = B_1B_2$ then $f(A_1,A_2) = f(B_1,B_2)$. (b) There exists a polynomial of second degree $F(u,v,w,z)$ such that $f(A_1,A_2)=F(x_1,y_1,x_2,y_2)$. (c) There exists such a number $\phi \in (0,\pi)$ that for every two points $A_1, A_2$ for which $\angle A_1OA_2 = \phi$ is satisfied $f(A_1,A_2) = 0$. (d) If the points $A_1, A_2$ are such that the triangle $OA_1A_2$ is equilateral with side $1$ then$ f(A_1,A_2) = \frac12$. Prove that $f(A_1,A_2) = \overrightarrow{OA_1} \cdot \overrightarrow{OA_2}$ for each ordered pair of points $A_1, A_2$.

Determine all functions $f:[0,\infty)\rightarrow\mathbb{R}$ such that $f(0)=0$ and \[f(x)=1+5f\left(\left\lfloor{\frac{x}{2}\right\rfloor}\right)-6f\left(\left\lfloor{\frac{x}{4}\right\rfloor}\right)\] for all $x>0$.

A 2 meter long bookshelf is filled end-to-end with 46 books. Some of the books are 3 centimeters thick while all the others are 5 centimeters thick. Find the number of books on the shelf that are 3 centimeters thick.