Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\dots a_n$ of the sequence $1$, $2$, $\dots$ , $n$ satisfying $$a_1 \le 2a_2\le 3a_3 \le \dots \le na_n$$. Proposed by United Kingdom

Within an equilateral triangle of side $ 15$ are $ 111$ points. Prove that it is always possible to cover three of these points by a round coin of diameter $ \sqrt{3}$, part of which may lie outside the triangle.

In a $2\times n$ array we have positive reals s.t. the sum of the numbers in each of the $n$ columns is $1$. Show that we can select a number in each column s.t. the sum of the selected numbers in each row is at most $\frac{n+1}4$.

A pirate has five purses with 30 coins in each. He knows that one purse contains only gold coins, another one contains only silver coins, the third one contains only bronze coins, and the remaining two ones contain 10 gold, 10 silver and 10 bronze coins each. It is allowed to simultaneously take one or several coins out of any purses (only once), and examine them. What is the minimal number of taken coins that is necessary to determine for sure the content of at least one purse? [i]Mikhail Evdokimov[/i]

There are 60 empty boxes $B_1,\ldots,B_{60}$ in a row on a table and an unlimited supply of pebbles. Given a positive integer $n$, Alice and Bob play the following game. In the first round, Alice takes $n$ pebbles and distributes them into the 60 boxes as she wishes. Each subsequent round consists of two steps: (a) Bob chooses an integer $k$ with $1\leq k\leq 59$ and splits the boxes into the two groups $B_1,\ldots,B_k$ and $B_{k+1},\ldots,B_{60}$. (b) Alice picks one of these two groups, adds one pebble to each box in that group, and removes one pebble from each box in the other group. Bob wins if, at the end of any round, some box contains no pebbles. Find the smallest $n$ such that Alice can prevent Bob from winning. [i]Czech Republic[/i]

A set $S$ of positive integers is $\textit{sum-complete}$ if there are positive integers $m$ and $n$ such that an integer $a$ is the sum of the elements of some nonempty subset of $S$ if and only if $m \le a \le n$. Let $S$ be a sum-complete set such that $\{1, 3\} \subset S$ and $|S| = 8$. Find the greatest possible value of the sum of the elements of $S$. [i]Proposed by Michael Tang[/i]

The triangle table is constructed according to the rule: You put the natural number $a>1$ in the upper row, and then you write under the number $k$ from the left side $k^2$, and from the right side -- $(k+1)$. For example, if $a = 2$, you get the table on the picture. Prove that all the numbers on each particular line are different. 2 / \ / \ 4 3 / \ / \ 16 5 9 4 / \ / \ /\ / \

Every square of $1000 \times 1000$ board is colored black or white. It is known that exists one square $10 \times 10$ such that all squares inside it are black and one square $10 \times 10$ such that all squares inside are white. For every square $K$ $10 \times 10$ we define its power $m(K)$ as an absolute value of difference between number of white and black squares $1 \times 1$ in square $K$. Let $T$ be a square $10 \times 10$ which has minimum power among all squares $10 \times 10$ in this board. Determine maximal possible value of $m(T)$

$100$ silver coins ordered by weight and $101$ gold coins also ordered by weight are given. All coins have different weights. You are given a balance to compare weights of any two coins. How can you find the “middle” coin (that occupies the $101$-st place in weight among all $201$ coins) using the minimal number of weighings? Find this number and prove that a smaller number of weighings would be insufficient. (A. Andjans, Riga)

The vertices of a connected graph cannot be coloured with less than $n+1$ colours (so that adjacent vertices have different colours). Prove that $\dfrac{n(n-1)}{2}$ edges can be removed from the graph so that it remains connected. [i]V. Dolnikov[/i] [b]EDIT.[/b] It is confirmed by the official solution that the graph is tacitly assumed to be [b]finite[/b].

Monica and Bogdan are playing a game, depending on given integers $n, k$. First, Monica writes some $k$ positive numbers. Bogdan wins, if he is able to find $n$ points on the plane with the following property: for any number $m$ written by Monica, there are some two points chosen by Bogdan with distance exactly $m$ between them. Otherwise, Monica wins. Determine who has a winning strategy depending on $n, k$. [i](Proposed by Fedir Yudin)[/i]

[b]p1.[/b] Replace $*$’s by an arithmetic operations (addition, subtraction, multiplication or division) to obtain true equality $$2*0*1*6*7=1.$$ [b]p2.[/b] The interval of length $88$ cm is divided into three unequal parts. The distance between middle points of the left and right parts is $46$ cm. Find the length of the middle part. [b]p3.[/b] A $5\times 6$ rectangle is drawn on a square grid. Paint some cells of the rectangle in such a way that every $3\times 2$ sub‐rectangle has exactly two cells painted. [b]p4.[/b] There are $8$ similar coins. $5$ of them are counterfeit. A detector can analyze any set of coins and show if there are counterfeit coins in this set. The detector neither determines which coins nare counterfeit nor how many counterfeit coins are there. How to run the detector twice to find for sure at least one counterfeit coin? [b]p5.[/b] There is a set of $20$ weights of masses $1, 2, 3,...$ and $20$ grams. Can one divide this set into three groups of equal total masses? [b]p6.[/b] Replace letters $A,B,C,D,E,F,G$ by the digits $0,1,...,9$ to get true equality $AB+CD=EF * EG$ (different letters correspond to different digits, same letter means the same digit, $AB$, $CD$, $EF$, and $EG$ are two‐digit numbers). PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find the number of $4 \times 4$ array whose entries are from the set $\{ 0 , 1, 2, 3 \}$ and which are such that the sum of the numbers in each of the four rows and in each of the four columns is divisible by $4$.

Zscoder has an simple undirected graph $G$ with $n\ge 3$ vertices. Navi labels a positive integer to each vertex, and places a token at one of the vertex. This vertex is now marked red. In each turn, Zscoder plays with following rule: $\bullet$ If the token is currently at vertex $v$ with label $t$, then he can move the token along the edges in $G$ (possibly repeating some edges) exactly $t$ times. After these $t$ moves, he marks the current vertex red where the token is at if it is unmarked, or does nothing otherwise, then finishes the turn. Zscoder claims that he can mark all vertices in $G$ red after finite number of turns, regardless of Navi's labels and starting vertex. What is the minimum number of edges must $G$ have, in terms of $n$? [i]Proposed by Yeoh Zi Song[/i]

There are $19$ balls in a box, numbered $1$ through $19$. When we go out get that box without looking five different balls, which number has the largest probability of being the difference between the highest and lowest number drawn? Justify you reply .

There is secret society with $2011$ members. Every member has bank account with integer balance ( can be negative). Sometimes some member give one dollar to every his friend. It is known, that after some such moves members can redistribute their money arbitrarily. Prove, that there are exactly $2010$ pairs of friends.

A plane is tiled with regular hexagons of side $1$. $A$ is a fixed hexagon vertex. Find the number of paths $P$ such that: (1) one endpoint of $P$ is $A$, (2) the other endpoint of $P$ is a hexagon vertex, (3) $P$ lies along hexagon edges, (4) $P$ has length $60$, and (5) there is no shorter path along hexagon edges from $A$ to the other endpoint of $P$.

For an integer $n>2$, the tuple $(1, 2, \ldots, n)$ is written on a blackboard. On each turn, one can choose two numbers from the tuple such that their sum is a perfect square and swap them to obtain a new tuple. Find all integers $n > 2$ for which all permutations of $\{1, 2,\ldots, n\}$ can appear on the blackboard in this way.

Let $n$ be a positive integer and $A$ a set of integers such that the set $\{x = a + b\ |\ a, b \in A\}$ contains $\{1^2, 2^2, \dots, n^2\}$. Prove that there is a positive integer $N$ such that if $n \ge N$, then $|A| > n^{0.666}$.

For all nonnegative integer $i$, there are seven cards with $2^i$ written on it. How many ways are there to select the cards so that the numbers add up to $n$?

Can the cells of a $2002 \times 2002$ table be filled with the numbers from $1$ to $2002^2$ (one per cell) so that for any cell we can find three numbers $a, b, c$ in the same row or column (or the cell itself) with $a = bc$?

The numbers from $1$ to $100$ are placed without repetition in each cell of a \(10 \times 10\) board. An increasing path of length \(k\) on this board is a sequence of cells \(c_1, c_2, \ldots, c_k\) such that, for each \(i = 2, 3, \ldots, k\), the following properties are satisfied: • The cells \(c_i\) and \(c_{i-1}\) share a side or a vertex; • The number in \(c_i\) is greater than the number in \(c_{i-1}\). What is the largest positive integer \(k\) for which we can always find an increasing path of length \(k\), regardless of how the numbers from 1 to 100 are arranged on the board?

We say that a distribution of students lined upen in collumns is $\textit{bacana}$ when there are no two friends in the same column. We know that all contestants in a math olympiad can be arranged in a $\textit{bacana}$ configuration with $n$ columns, and that this is impossible with $n-1$ columns. Show that we can choose competitors $M_1, M_2, \cdots, M_n$ in such a way that $M_i$ is on the $i$-th column, for each $i = 1, 2, 3, \ldots, n$ and $M_i$ is a friend of $M_{i+1}$ for each $i = 1, 2, \ldots, n - 1$.

A shop sells bottles with this capacity: $1L, 2L, 3L,..., 1996L$, the prices of bottles satifies this $2$ conditions: $1$. Two bottles have the same price, if and only if, your capacities satifies $m - n = 1000$ $2$. The price of bottle $m$($1001>m>0$) is $1996 - m$ dollars. Find all pair(s) $m$ and $n$ such that: a) $m + n = 1000$ b) the cost is smallest possible!!! c) with the pair, the shop can measure $k$ liters, with $0<k<1996$(for all $k$ integer) Note: The operations to measure are: i) To fill or empty any one of two bottles ii)Pass water of a bottle for other bottle We can measure $k$ liters when the capacity of one bottle plus the capacity of other bottle is equal to $k$

A binary decision tree is a list of $n$ yes/no questions, together with instructions for the order in which they should be asked (without repetition). For instance, if $n = 3$, there are $12$ possible binary decision trees, one of which asks question $2$ first, then question $3$ (followed by question $ 1$) if the answer was yes or question $1$ (followed by question $3$) if the answer was no. Determine the greatest possible $k$ such that $2^k$ divides the number of binary decision trees on $n = 13$ questions.