Let $k>1$ be a positive integer. On a $\text{k} \times \text{k}$ square grid, Tom and Jerry are on opposite corners, with Tom at the top right corner. Both can move to an adjacent square every move, where two squares are adjacent if they share a side. Tom and Jerry alternate moves, with Jerry going first. Tom [i]catches[/i] Jerry if they are on the same square. We aim to answer to the following question: What is the smallest number of moves that Tom needs to guarantee catching Jerry? (a) Without proof, find the answer in the cases of $k=2,3,4$, and (correctly) guess what the answer is in terms of $k$. We'll refer to this answer as $A(k)$. (b) Find a strategy that Jerry can use to guarantee that Tom takes at least $A(k)$ moves to catch Jerry. Now, you will find a strategy for Tom to catch Jerry in at most $A(k)$ moves, no matter what Jerry does. (c) Find, with proof, a working strategy for $k=5$. (d) Find, with proof, a working strategy for all $k \geq 2$.

Suppose that $S$ is a finite set of real numbers with the property that any two distinct elements of $S$ form an arithmetic progression with another element in $S$. Give an example of such a set with 5 elements and show that no such set exists with more than $5$ elements.

Let $ABCD$ be a unit square. For any interior points $M,N$ such that the line $MN$ does not contain a vertex of the square, we denote by $s(M,N)$ the least area of the triangles having their vertices in the set of points $\{ A,B,C,D,M,N\}$. Find the least number $k$ such that $s(M,N)\le k$, for all points $M,N$. [i]Dinu Șerbănescu[/i]

Let ${n}$ and $k$ be positive integers. There are given ${n}$ circles in the plane. Every two of them intersect at two distinct points, and all points of intersection they determine are pairwise distinct (i. e. no three circles have a common point). No three circles have a point in common. Each intersection point must be colored with one of $n$ distinct colors so that each color is used at least once and exactly $k$ distinct colors occur on each circle. Find all values of $n\geq 2$ and $k$ for which such a coloring is possible. [i]Proposed by Horst Sewerin, Germany[/i]

Aidan rolls a pair of fair, six sided dice. Let$ n$ be the probability that the product of the two numbers at the top is prime. Given that $n$ can be written as $a/b$ , where $a$ and $b$ are relatively prime positive integers, find $a +b$. [i]Proposed by Aidan Duncan[/i]

Suppose that to every point of the plane a colour, either red or blue, is associated. (a) Show that if there is no equilateral triangle with all vertices of the same colour then there must exist three points $A,B$ and $C$ of the same colour such that $B$ is the midpoint of $AC$. (b) Show that there must be an equilateral triangle with all vertices of the same colour.

We have $2012$ sticks with integer length, and sum of length is $n$. We need to have sticks with lengths $1,2,....,2012$. For it we can break some sticks ( for example from stick with length $6$ we can get $1$ and $4$). For what minimal $n$ it is always possible?

An equilateral triangle of side $n$ is divided into equilateral triangles of side $1$. Find the greatest possible number of unit segments with endpoints at vertices of the small triangles that can be chosen so that no three of them are sides of a single triangle.

Santa Claus has at least $n$ gifts for $n$ children. For $i\in\{1,2, ... , n\}$, the $i$-th child considers $x_i > 0$ of these items to be desirable. Assume that \[\dfrac{1}{x_1}+\cdots+\dfrac{1}{x_n}\le1.\] Prove that Santa Claus can give each child a gift that this child likes.

We have a rectangle with integer sides $m, n$ that is subdivided into $mn$ squares of side $1$. Find the number of little squares that are crossed by the diagonal (without counting those that are touched only in one vertex)

A laticial cycle of length $n$ is a sequence of lattice points $(x_k, y_k)$, $k = 0, 1,\cdots, n$, such that $(x_0, y_0) = (x_n, y_n) = (0, 0)$ and $|x_{k+1} -x_{k}|+|y_{k+1} - y_{k}| = 1$ for each $k$. Prove that for all $n$, the number of latticial cycles of length $n$ is a perfect square.

Given a positive integer $n$, let $[n] = \{1,2,\dots,n\}$. Let [list] [*] $a_n$ denote the number of functions $f: [n] \to [n]$ such that $f(f(i))\ge i$ for all $i$; and [*] $b_n$ denote the number of ordered set partitions of $[n]$, i.e., the number of ways to pick an integer $k$ and an ordered $k$-tuple of pairwise disjoint nonempty sets $(A_1,\dots,A_k)$ whose union is $[n]$. [/list] Prove that $a_n=b_n$. [i]Derek Liu[/i]

A $2^{2014} + 1$ by $2^{2014} + 1$ grid has some black squares filled. The filled black squares form one or more snakes on the plane, each of whose heads splits at some points but never comes back together. In other words, for every positive integer $n$ greater than $2$, there do not exist pairwise distinct black squares $s_1$, $s_2$, \dots, $s_n$ such that $s_i$ and $s_{i+1}$ share an edge for $i=1,2, \dots, n$ (here $s_{n+1}=s_1$). What is the maximum possible number of filled black squares? [i]Proposed by David Yang[/i]

At a two-day team competition in chess, three schools with $15$ pupils each attend. Each student plays one game against each player on the other two teams, ie a total of $30$ chess games per student. a) Is it possible for each student to play exactly $15$ games after the first day? b) Show that it is possible for each student to play exactly $16$ games after the first day. c) Assume that each student has played exactly $16$ games after the first day. Show that there are three students, one from each school, who have played their three parties

Let $n$ be a positive integer and let $\mathcal{A}$ be a family of non-empty subsets of $\{1, 2, \ldots, n \}$ such that if $A \in \mathcal{A}$ and $A$ is subset of a set $B\subseteq \{1, 2, \ldots, n\}$, then $B$ is also in $\mathcal{A}$. Show that the function $$f(x):=\sum_{A \in \mathcal{A}} x^{|A|}(1-x)^{n-|A|}$$ is strictly increasing for $x \in (0,1)$.

A set $S$ of four distinct points is given in the plane. It is known that for any point $X\in S$ the remaining points can be denoted by $Y,Z$ and $W$ so that $|XY|=|XZ|+|XW|$ Prove that all four points lie on a line.

The infinite sequence $a_0,a _1, a_2, \dots$ of (not necessarily distinct) integers has the following properties: $0\le a_i \le i$ for all integers $i\ge 0$, and \[\binom{k}{a_0} + \binom{k}{a_1} + \dots + \binom{k}{a_k} = 2^k\] for all integers $k\ge 0$. Prove that all integers $N\ge 0$ occur in the sequence (that is, for all $N\ge 0$, there exists $i\ge 0$ with $a_i=N$).

Determine whether there exist ten sets $A_1$, $A_2$, $\dots$, $A_{10}$ such that (i) each set is of the form $\{a,b,c\}$, where $a \in \{1,2,3\}$, $b \in \{4,5,6\}$, $c \in \{7,8,9\}$, (ii) no two sets are the same, (iii) if the ten sets are arranged in a circle $(A_1, A_2, \dots, A_{10})$, then any two adjacent sets have no common element, but any two non-adjacent sets intersect. (Note: $A_{10}$ is adjacent to $A_1$.)

Consider a cube and let$ M, N$ be two of its vertices. Assign the number $1$ to these vertices and $0$ to the other six vertices. We are allowed to select a vertex and to increase with a unit the numbers assigned to the $3$ adjiacent vertices - call this a [i]movement[/i]. Prove that there is a sequence of [i]movements [/i] after which all the numbers assigned to the vertices of the cube became equal if and only if $MN$ is not a diagonal of a face of the cube. Marius Ghergu, Dinu Serbanescu

There are $128$ numbered seats arranged around a circle in a palaestra. The first person to enter the place would sit on seat number $1$. Since a contagious disease is infecting the people of the city, each person who enters the palaestra would sit on a seat whose distance is the longest to the nearest occupied seat. If there are several such seats, the newly entered person would sit on the seat with the smallest number. What is the number of the seat on which the $39$th person sits?

The Hawking Space Agency operates $n-1$ space flights between the $n$ habitable planets of the Local Galaxy Cluster. Each flight has a fixed price which is the same in both directions, and we know that using these flights, we can travel from any habitable planet to any habitable planet. In the headquarters of the Agency, there is a clearly visible board on a wall, with a portrait, containing all the pairs of different habitable planets with the total price of the cheapest possible sequence of flights connecting them. Suppose that these prices are precisely $1,2, ... , \binom{n}{2}$ monetary units in some order. prove that $n$ or $n-2$ is a square number.

Find the smallest number of squares on an $8\times8$ board that should be colored so that every $L$-tromino on the board contains at least one colored square.

Given an $n$-tuple of numbers $(x_1,x_2,\dots ,x_n)$ where each $x_i=+1$ or $-1$, form a new $n$-tuple $$(x_1x_2,x_2x_3,x_3x_4,\dots ,x_nx_1),$$ and continue to repeat this operation. Show that if $n=2^k$ for some integer $k\ge 1$, then after a certain number of repetitions of the operation, we obtain the $n$-tuple $$(1,1,1,\dots ,1).$$

$n$ players ($n \ge 4$) took part in the tournament. Each player played exactly one match with every other player, there were no draws. There was no four players $(A, B, C, D)$, such that $A$ won with $B$, $B$ won with $C$, $C$ won with $D$ and $D$ won with $A$. Determine, depending on $n$, maximum number of trios of players $(A, B, C)$, such that $A$ won with $B$, $B$ won with $C$ and $C$ won with $A$. (Attention: Trios $(A, B, C)$, $(B, C, A)$ and $(C, A, B)$ are the same trio.)

Let $(x_1, y_1, z_1), (x_2, y_2, z_2), \cdots, (x_{19}, y_{19}, z_{19})$ be integers. Prove that there exist pairwise distinct subscripts $i, j, k$ such that $x_i+x_j+x_k$, $y_i+y_j+y_k$, $z_i+z_j+z_k$ are all multiples of $3$.