Let $ f$ be an entire function on $ \mathbb C$ and $ \omega_1,\omega_2$ are complex numbers such that $ \frac {\omega_1}{\omega_2}\in{\mathbb C}\backslash{\mathbb Q}$. Prove that if for each $ z\in \mathbb C$, $ f(z) \equal{} f(z \plus{} \omega_1) \equal{} f(z \plus{} \omega_2)$ then $ f$ is constant.

Five guys are eating hamburgers. Each one puts a top half and a bottom half of a hamburger bun on the grill. When the buns are toasted, each guy randomly takes two pieces of bread off of the grill. What is the probability that each guy gets a top half and a bottom half?

If $x$ is a real and $4y^2+4xy+x+6=0$, then the complete set of values of $x$ for which $y$ is real, is: $\text{(A)} \ x\le -2~\text{or}~x\ge3 \qquad \text{(B)} \ x\le 2~\text{or}~x\ge3 \qquad \text{(C)} \ x\le -3 ~\text{or}~x\ge 2$ $\text{(D)} \ -3\le x \le 2\qquad \text{(E)} \ \-2\le x \le 3$

$N$ cards are arranged in a circle, with exactly one card face up and the rest face-down. In a turn, choose a proper divisor $k$ of $N$. You may begin at any card on the circle and flip every $k$-th card, counting clockwise, if and only if every $k$-th card begins the turn in the same orientation (either all face-up or all face-down). For example, with $15$ cards, you may start at any position and flip the $3$rd, $6$th, $9$th, $12$th, and $15$th cards around the circle if they all begin the turn face up (or all face-down). For what values of $N$ can all of the cards be flipped face-up in a finite number of turns?

Robot "Mag-o-matic" manipulates $101$ glasses, displaced in a row whose positions are numbered from $1$ to $101$. In each glass you can find a ball or not. Mag-o-matic only accepts elementary instructions of the form $(a;b,c)$, which it interprets as "consider the glass in position $a$: if it contains a ball, then switch the glasses in positions $b$ and $c$ (together with their own content), otherwise move on to the following instruction" (it means that $a,\,b,\,c$ are integers between $1$ and $101$, with $b$ and $c$ different from each other but not necessarily different from $a$). A $\emph{programme}$ is a finite sequence of elementary instructions, assigned at the beginning, that Mag-o-matic does one by one. A subset $S\subseteq \{0,\,1,\,2,\dots,\,101\}$ is said to be $\emph{identifiable}$ if there exists a programme which, starting from any initial configuration, produces a final configuration in which the glass in position $1$ contains a ball if and only if the number of glasses containing a ball is an element of $S$. (a) Prove that the subset $S$ of the odd numbers is identifiable. (b) Determine all subsets $S$ that are identifiable.

A mysterious machine contains a secret combination of $2016$ integer numbers $x_1,x_2,\ldots,x_{2016}$. It is known that all the numbers in the combination are equal but one. One may ask questions to the machine by giving to it a sequence of $2016$ integer numbers $y_1,\ldots,y_{2016}$, and the machine answers by telling the value of the sum \[ x_1y_1+\dots+x_{2016}y_{2016}. \] After answering the first question, the machine accepts a second question and then a third one, and so on. Determine how many questions are necessary to determine the combination: (a) knowing that the number which is different from the others is equal to zero; (b) not knowing what the number different from the others is.

Prove that the family of curves $$\frac{x^2}{a^2+\lambda}+\frac{y^2}{b^2+\lambda}=1$$ satisfies $$\frac{dy}{dx}(a^2-b^2)=\left(x+y\frac{dy}{dx}\right)\left(x\frac{dy}{dx}-y\right)$$

Find all integers $n \geq 3$ for which there exist real numbers $a_1, a_2, \dots a_{n + 2}$ satisfying $a_{n + 1} = a_1$, $a_{n + 2} = a_2$ and $$a_ia_{i + 1} + 1 = a_{i + 2},$$ for $i = 1, 2, \dots, n$. [i]Proposed by Patrik Bak, Slovakia[/i]

Bernado and Silvia play the following game. An integer between 0 and 999, inclusive, is selected and given to Bernado. Whenever Bernado receives a number, he doubles it and passes the result to Silvia. Whenever Silvia receives a number, she adds 50 to it and passes the result to Bernado. The winner is the last person who produces a number less than 1000. Let $N$ be the smallest initial number that results in a win for Bernado. What is the sum of the digits of $N$? $\textbf{(A)}\ 7 \qquad\textbf{(B)}\ 8 \qquad\textbf{(C)}\ 9 \qquad\textbf{(D)}\ 10 \qquad\textbf{(E)}\ 11$

In a rectangle with vertices $(0, 0), (0, 2), (n,0),(n, 2)$, ($n$ is a positive integer) find the number of longest paths starting from $(0, 0)$ and arriving at $(n, 2)$ which satisfy the following: $\bullet$ At each movement, you can move right, up, left, down by $1$. $\bullet$ You cannot visit a point you visited before. $\bullet$ You cannot move outside the rectangle.

Let $ABCD$ be a square with side length $100$. A circle with centre $C$ and radius $CD$ is drawn. Another circle of radius $r$, lying inside $ABCD$, is drawn to touch this circle externally and such that the circle also touches $AB$ and $AD$. If $r=m+n\sqrt{k}$, where $m,n$ are integers and $k$ is a prime number, find the value of $\frac{m+n}k$.

Which fractions $ \dfrac{p}{q},$ where $p,q$ are positive integers $< 100$, is closest to $\sqrt{2} ?$ Find all digits after the point in decimal representation of that fraction which coincide with digits in decimal representation of $\sqrt{2}$ (without using any table).

Let $ n$ be a positive integer and let $ a_1,a_2,\ldots,a_n$ be positive real numbers such that: \[ \sum^n_{i \equal{} 1} a_i \equal{} \sum^n_{i \equal{} 1} \frac {1}{a_i^2}. \] Prove that for every $ i \equal{} 1,2,\ldots,n$ we can find $ i$ numbers with sum at least $ i$.

Find all triples $(x,y,z)$ of real numbers that satisfy \[ \begin{aligned} & x\left(1 - y^2\right)\left(1 - z^2\right) + y\left(1 - z^2\right)\left(1 - x^2\right) + z\left(1 - x^2\right)\left(1 - y^2\right) \\ & = 4xyz \\ & = 4(x + y + z). \end{aligned} \]

When a bucket is two-thirds full of water, the bucket and water weigh $ a$ kilograms. When the bucket is one-half full of water the total weight is $ b$ kilograms. In terms of $ a$ and $ b$, what is the total weight in kilograms when the bucket is full of water? $ \textbf{(A)}\ \frac23a\plus{}\frac13b\qquad \textbf{(B)}\ \frac32a\minus{}\frac12b\qquad \textbf{(C)}\ \frac32a\plus{}b$ $ \textbf{(D)}\ \frac32a\plus{}2b\qquad \textbf{(E)}\ 3a\minus{}2b$

In each $ 2007^{2}$ unit squares on chess board whose size is $ 2007\times 2007$, there lies one coin each square such that their "heads" face upward. Consider the process that flips four consecutive coins on the same row, or flips four consecutive coins on the same column. Doing this process finite times, we want to make the "tails" of all of coins face upward, except one that lies in the $ i$th row and $ j$th column. Show that this is possible if and only if both of $ i$ and $ j$ are divisible by $ 4$.

A box with weight $W$ will slide down a $30^\circ$ incline at constant speed under the influence of gravity and friction alone. If instead a horizontal force $P$ is applied to the box, the box can be made to move up the ramp at constant speed. What is the magnitude of $P$? $\textbf{(A) } P = W/2 \\ \textbf{(B) } P = 2W/\sqrt{3}\\ \textbf{(C) } P = W\\ \textbf{(D) } P = \sqrt{3}W \\ \textbf{(E) } P = 2W$

Given a triangle \(ABC\), an arbitrary point \(D\) is chosen on the side \(AC\). In triangles \(ABD\) and \(CBD\), the angle bisectors \(BK\) and \(BL\) are drawn, respectively. The point \(O\) is the circumcenter of \(\triangle KBL\). Prove that the second intersection point of the circumcircles of triangles \(ABL\) and \(CBK\) lies on the line \(OD\). [i]Proposed by Anton Trygub[/i]

Floyd looked at a standard $12$ hour analogue clock at $2\!:\!36$. When Floyd next looked at the clock, the angles through which the hour hand and minute hand of the clock had moved added to $247$ degrees. How many minutes after $3\!:\!00$ was that?

Let $P$ be the probability that the product of $2020$ real numbers chosen independently and uniformly at random from the interval $[-1, 2]$ is positive. The value of $2P - 1$ can be written in the form $\left(\frac{m}{n}\right)^b$ , where $m, n$ and $b$ are positive integers such that $m$ and $n$ are relatively prime and $b$ is as large as possible. Compute $m + n + b$.

Let $S$ be a subset of $\{1,2,3,4,5,6,7,8,9,10\}$. If $S$ has the property that the sums of three elements of $S$ are all different, find the maximum number of elements of $S$.

We call a bar of width ${w}$ on the surface of the unit sphere ${\Bbb{S}^2}$, a spherical segment, centered at the origin, which has width ${w}$ and is symmetric with respect to the origin. Prove that there exists a constant ${c>0}$, such that for any positive integer ${n}$ the surface ${\Bbb{S}^2}$ can be covered with ${n}$ bars of the same width so that any point is contained in no more than ${c\sqrt{n}}$ bars.

In a country between each pair of cities there is at most one direct road. There is a connection (using one or more roads) between any two cities even after the elimination of any given city and all roads incident to this city. We say that the city $A$ can be[i] k -directionally[/i] connected to the city $B$, if : we can orient at most $k$ roads such that after[i] arbitrary[/i] orientation of remaining roads for any fixed road $l$ (directly connecting two cities) there is a path passing through roads in the direction of their orientation starting at $A$, passing through $l$ and ending at $B$ and visiting each city at most once. Suppose that in a country with $n$ cities, any two cities can be[i] k - directionally[/i] connected. What is the minimal value of $k$?

A circle is drawn through vertices $A$ and $B$ of triangle $ABC$, intersecting sides $AC$ and $BC$ at points $M$ and $P$. It is known that the segment $MP$ contains the center of the circle inscribed in $ABC$. Find $MP$ if $AB = c$, $BC = a$, $CA=b$.

a) In how many ways can we read the word SARAJEVO from the table below, if it is allowed to jump from cell to an adjacent cell (by vertex or a side) cell? b) After the letter in one cell was deleted, only $525$ ways to read the word SARAJEVO remained. Find all possible positions of that cell.