The following $100$ numbers are written on the board: $$2^1 - 1, 2^2 - 1, 2^3 - 1, \dots, 2^{100} - 1.$$ Alice chooses two numbers $a,b,$ erases them and writes the number $\dfrac{ab - 1}{a+b+2}$ on the board. She keeps doing this until a single number remains on the board. If the sum of all possible numbers she can end up with is $\dfrac{p}{q}$ where $p, q$ are coprime, then what is the value of $\log_{2}(p+q)$?

A tournament of order $n$, $n \in \mathbb{N}$, consists of $2^n$ players, which are numbered with $1, 2, \ldots, 2^n$, and has $n$ rounds. In each round, the remaining players paired with each other to play a match and the winner from each match advances to the next round. The winner of the $n$-th round is considered the winner of the tournament. Two tournaments are considered different if there is a match that took place in the $k$-th round of one tournament, but not in the $k$-th round of the other, or if the tournaments have different winners. Determine how many different tournaments of order $n$ there are with the property that in each round, the sum of the numbers of the players in each match is the same (but not necessarily the same for all rounds).

Let $n$ be a positive integer. A frog starts on the number line at $0$. Suppose it makes a finite sequence of hops, subject to two conditions: [list] [*]The frog visits only points in $\{1, 2, \dots, 2^n-1\}$, each at most once. [*]The length of each hop is in $\{2^0, 2^1, 2^2, \dots\}$. (The hops may be either direction, left or right.) [/list] Let $S$ be the sum of the (positive) lengths of all hops in the sequence. What is the maximum possible value of $S$? [i]Ashwin Sah[/i]

$2n$ clubs want to play a league. Each club must play every other club exactly once. Each club is only allowed to play one game per day. Prove that the competition can be completed in $2n - 1$ days.

How many ways are there to divide a $2\times n$ rectangle into rectangles having integral sides, where $n$ is a positive integer?

There is an infinite set of points $S$ on the plane, and any $1\times 1$ square contains a finite number of points from the set $S$. Prove that there are two different points $A$ and $B$ from $S$ such that for any other point $X$ from $S$ the following inequalities hold: $$|XA|, |XB| \ge 0.999|AB|.$$

Messages are coded using sequences consisting of zeroes and ones only. Only sequences with at most two consecutive ones or zeroes are allowed. (For instance the sequence $011001$ is allowed, but $011101$ is not.) Determine the number of sequences consisting of exactly $12$ numbers.

Let $ S \equal{} \{x_1, x_2, \ldots, x_{k \plus{} l}\}$ be a $ (k \plus{} l)$-element set of real numbers contained in the interval $ [0, 1]$; $ k$ and $ l$ are positive integers. A $ k$-element subset $ A\subset S$ is called [i]nice[/i] if \[ \left |\frac {1}{k}\sum_{x_i\in A} x_i \minus{} \frac {1}{l}\sum_{x_j\in S\setminus A} x_j\right |\le \frac {k \plus{} l}{2kl}\] Prove that the number of nice subsets is at least $ \dfrac{2}{k \plus{} l}\dbinom{k \plus{} l}{k}$. [i]Proposed by Andrey Badzyan, Russia[/i]

On an infinite triangular lattice, there is a single atom at a lattice point. We allow for four operations as illustrated in Figure 1. In words, one could take an existing atom, split it into three atoms, and place them at adjacent lattice points in one of the two displayed fashions (a “split”). One could also reverse the process, i.e. taking three existing atoms in the displayed configurations, and merge them into a single atom at the center (a “merge”). [center][img]https://cdn.artofproblemsolving.com/attachments/2/5/41abc4dc8fb8235e5eb0c98638f9e4a0896c05.png[/img][/center] Figure 1: The four possible operations on an atom. Assume that, after finitely many operations, there is again only a single atom remaining on the lattice. Show that this is possible if and only if the final atom is contained in the sublattice implied by Figure 2. [center][img]https://cdn.artofproblemsolving.com/attachments/b/4/7a7bd10a1862947c250fa07571c061367a5a71.png[/img][/center] Figure 2: The possible positions for the final atom is the green sublattice. The position of the original atom is marked in purple.

A circle with circumference 6n units is given and 3n points divide the circumference in n intervals of 1 unit, n intervals of 2 units, and n intervals of 3 units. Prove that there is at least one pair of points that are diametrically opposite to each other.

Isabel wants to partition the set $\mathbb{N}$ of the positive integers into $n$ disjoint sets $A_{1}, A_{2}, \ldots, A_{n}$. Suppose that for each $i$ with $1\leq i\leq n$, given any positive integers $r, s\in A_{i}$ with $r\neq s$, we have $r+s\in A_{i}$. If $|A_{j}|=1$ for some $j$, find the greatest positive integer that may belong to $A_{j}$.

Consider a $9 \times 9$ array of white squares. Find the largest $n \in\mathbb N$ with the property: No matter how one chooses $n$ out of 81 white squares and color in black, there always remains a $1 \times 4$ array of white squares (either vertical or horizontal).

Let $S_n$ be the sum of reciprocal values of non-zero digits of all positive integers up to (and including) $n$. For instance, $S_{13} = \frac{1}{1}+ \frac{1}{2}+ \frac{1}{3}+ \frac{1}{4}+ \frac{1}{5}+ \frac{1}{6}+ \frac{1}{7}+ \frac{1}{8}+ \frac{1}{9}+ \frac{1}{1}+ \frac{1}{1}+ \frac{1}{1}+ \frac{1}{1}+ \frac{1}{2}+ \frac{1}{1}+ \frac{1}{3}$ . Find the least positive integer $k$ making the number $k!\cdot S_{2016}$ an integer.

There is a row of $100N$ sandwiches with ham. A boy and his cat play a game. In one action the boy eats the first sandwich from any end of the row. In one action the cat either eats the ham from one sandwich or does nothing. The boy performs 100 actions in each of his turns, and the cat makes only 1 action each turn; the boy starts first. The boy wins if the last sandwich he eats contains ham. Is it true that he can win for any positive integer $N{}$ no matter how the cat plays? [i]Ivan Mitrofanov[/i]

Let $\mathcal{P}_0=A_0A_1\ldots A_{n-1}$ be a convex polygon such that $A_iA_{i+1}=2^{[i/2]}$ for $i=0, 1,\ldots ,n-1$ (where $A_n=A_0$). Define the sequence of polygons $\mathcal{P}_k=A_0^kA_1^k\ldots A_{n-1}^k$ as follows: $A_i^1$ is symmetric to $A_i$ with respect to $A_0$, $A_i^2$ is symmetric to $A_i^1$ with respect to $A_1^1$, $A_i^3$ is symmetric to $A_i^2$ with respect to $A_2^2$ and so on. Find the values of $n$ for which infinitely many polygons $\mathcal{P}_k$ coincide with $\mathcal{P}_0$.

A circle is divided into arcs of equal size by $n$ points ($n \ge 1$). For any positive integer $x$, let $P_n(x)$ denote the number of possibilities for colouring all those points, using colours from $x$ given colours, so that any rotation of the colouring by $ i \cdot \frac{360^o}{n}$ , where i is a positive integer less than $n$, gives a colouring that differs from the original in at least one point. Prove that the function $P_n(x)$ is a polynomial with respect to $x$.

In the plane we consider rectangles whose sides are parallel to the coordinate axes and have positive length. Such a rectangle will be called a [i]box[/i]. Two boxes [i]intersect[/i] if they have a common point in their interior or on their boundary. Find the largest $ n$ for which there exist $ n$ boxes $ B_1$, $ \ldots$, $ B_n$ such that $ B_i$ and $ B_j$ intersect if and only if $ i\not\equiv j\pm 1\pmod n$. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

We consider an $n \times n$ ($n \in N, n \ge 2$) square divided into $n^2$ unit squares. Determine all the values of $k \in N$ for which we can write a real number in each of the unit squares such that the sum of the $n^2$ numbers is a positive number, while the sum of the numbers from the unit squares of any $k \times k$ square is a negative number.

There is a fence that consists of $n$ planks arranged in a line. Each plank is painted with one of the available $100$ colors. Suppose that for any two distinct colors $i$ and $j$, there is a plank with color $i$ located to the left of a (not necessarily adjacent) plank with color $j$. Determine the minimum possible value of $n$.

Each point of a circle is colored either red or blue. [b](a)[/b] Prove that there always exists an isosceles triangle inscribed in this circle such that all its vertices are colored the same. [b](b)[/b] Does there always exist an equilateral triangle inscribed in this circle such that all its vertices are colored the same?

For which pairs $(m,n)$ does there exist an injective function $f:\mathbb{R}^2\to\mathbb{R}^2$ under which the image of every regular $m$-gon is a regular $n$-gon. (Note that $m,n\geq 3$, and that by a regular $N$-gon we mean the union of the boundary segments, not the closed polygonal region.) [i]Proposed by Sutanay Bhattacharya, Bishnupur, India[/i]

Let $n$ be an even positive integer. We say that two different cells of a $n \times n$ board are [b]neighboring[/b] if they have a common side. Find the minimal number of cells on the $n \times n$ board that must be marked so that any cell (marked or not marked) has a marked neighboring cell.

Nelson challenges Telma for the following game: First Telma takes $2^9$ numbers from the set $\left\{0,1,2,3,\cdots,1024\right\}$, then Nelson takes $2^8$ of the remaining numbers. Then Telma takes $2^7$ numbers and successively, until only two numbers remain. Nelson will have to give Telma the difference between these two numbers in euros. What is the largest amount Telma can win, whatever Nelson's strategy is?

Eight red boxes and eight blue boxes are randomly placed in four stacks of four boxes each. The probability that exactly one of the stacks consists of two red boxes and two blue boxes is $\frac{m}{n}$ , where m and n are relatively prime positive integers. Find $m + n$.

The kingdom of Anisotropy consists of $n$ cities. For every two cities there exists exactly one direct one-way road between them. We say that a [i]path from $X$ to $Y$[/i] is a sequence of roads such that one can move from $X$ to $Y$ along this sequence without returning to an already visited city. A collection of paths is called [i]diverse[/i] if no road belongs to two or more paths in the collection. Let $A$ and $B$ be two distinct cities in Anisotropy. Let $N_{AB}$ denote the maximal number of paths in a diverse collection of paths from $A$ to $B$. Similarly, let $N_{BA}$ denote the maximal number of paths in a diverse collection of paths from $B$ to $A$. Prove that the equality $N_{AB} = N_{BA}$ holds if and only if the number of roads going out from $A$ is the same as the number of roads going out from $B$. [i]Proposed by Warut Suksompong, Thailand[/i]