The natural numbers from $100$ to $999$ are written on separate cards. They are gathered in one pile with their numbers down in arbitrary order. Let us open them in sequence and divide into $10$ piles according to the least significant digit. The first pile will contain cards with $0$ at the end, ... , the tenth -- with $9$. Then we shall gather $10$ piles in one pile, the first -- down, then the second, ... and the tenth -- up. Let us repeat the procedure twice more, but the next time we shall divide cards according to the second digit, and the last time -- to the most significant one. What will be the order of the cards in the obtained pile?

Divide the set of twelve numbers $A = \{3, 4, 5, ...,13, 14\}$ into two sets $ B$ and $C$ 'of six numbers each according to this condition: for any two different numbers with $ B$ their sum does not belong to $ B$ and for any two different numbers from $C$, the sum does not belong to $C$.

Let $m,n\geq 2$ be positive integers and $S\subseteq [1,m]\times [1,n]$ be a set of lattice points. Prove that if \[|S|\geq m+n+\bigg\lfloor\frac{m+n}{4}-\frac{1}{2}\bigg\rfloor\]then there exists a circle which passes through at least four distinct points of $S.$

Two cells in a $20 \times 20$ board are adjacent if they have a common edge (a cell is not considered adjacent to itself). What is the maximum number of cells that can be marked in a $20 \times 20$ board such that every cell is adjacent to at most one marked cell?

Let $K$ and $L$ be positive integers. On a board consisting of $2K \times 2L$ unit squares an ant starts in the lower left corner square and walks to the upper right corner square. In each step it goes horizontally or vertically to a neighbouring square. It never visits a square twice. At the end some squares may remain unvisited. In some cases the collection of all unvisited squares forms a single rectangle. In such cases, we call this rectangle [i]MEMOrable[/i]. Determine the number of different MEMOrable rectangles. [i]Remark: Rectangles are different unless they consist of exactly the same squares.[/i]

We are given five equal-looking weights of pairwise distinct masses. For any three weights $A$, $B$, $C$, we can check by a measuring if $m(A) < m(B) < m(C)$, where $m(X)$ denotes the mass of a weight $X$ (the answer is [i]yes[/i] or [i]no[/i].) Can we always arrange the masses of the weights in the increasing order with at most nine measurings?

What is the maximum number of checkers it is possible to put on a $ n \times n$ chessboard such that in every row and in every column there is an even number of checkers?

Is it possible to arrange all the integers from $0$ to $9$ in circles so that the sum of three numbers along any of the six segments is the same? [img]https://cdn.artofproblemsolving.com/attachments/c/1/1a577fb4a607c395f5cc07b63653307b569b95.png[/img]

Let $ A_1A_2...A_n$ be a convex polygon. Show that there exists an index $ j$ such that the circum-circle of the triangle $ A_j A_{j \plus{} 1} A_{j \plus{} 2}$ covers the polygon (here indices are read modulo n).

A certain number of cubes are painted in six colours, each cube having six faces of different colours (the colours in different cubes may be arranged differently) . The cubes are placed on a table so as to form a rectangle. We are allowed to take out any column of cubes, rotate it (as a whole) along its long axis and replace it in the rectangle. A similar operation with rows is also allowed. Can we always make the rectangle monochromatic (i.e. such that the top faces of all the cubes are the same colour) by means of such operations? ( D. Fomin , Leningrad)

A marker is placed at the origin of an integer lattice. Calvin and Hobbes play the following game. Calvin starts the game and each of them takes turns alternatively. At each turn, one can choose two (not necessarily distinct) integers $a, b$, neither of which was chosen earlier by any player and move the marker by $a$ units in the horizontal direction and $b$ units in the vertical direction. Hobbes wins if the marker is back at the origin any time after the first turn. Prove or disprove that Calvin can prevent Hobbes from winning. Note: A move in the horizontal direction by a positive quantity will be towards the right, and by a negative quantity will be towards the left (and similar directions in the vertical case as well).

A fair six-sided die is rolled five times. The probability that the five die rolls form an increasing sequence where each value is strictly larger than the one that preceded can be written in the form $m/n$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.

Let $n$ be a positive integer. Each number $1, 2, ..., 1000$ has been colored with one of $n$ colours. Each two numbers , such that one is a divisor of second of them, are colored with different colours. Determine minimal number $n$ for which it is possible.

The permutation $\sigma$ consisting of four words $A,B,C,D$ has $f_{AB}(\sigma)$, the sum of the number of $B$ placed rightside of every $A$. We can define $f_{BC}(\sigma)$,$f_{CD}(\sigma)$,$f_{DA}(\sigma)$ as the same way too. For example, $\sigma=ACBDBACDCBAD$, $f_{AB}(\sigma)=3+1+0=4$, $f_{BC}(\sigma)=4$,$f_{CD}(\sigma)=6$, $f_{DA}(\sigma)=3$ Find the maximal value of $f_{AB}(\sigma)+f_{BC}(\sigma)+f_{CD}(\sigma)+f_{DA}(\sigma)$, when $\sigma$ consists of $2020$ letters for each $A,B,C,D$

Suppose that $2002$ numbers, each equal to $1$ or $-1$, are written around a circle. For every two adjacent numbers, their product is taken; it turns out that the sum of all $2002$ such products is negative. Prove that the sum of the original numbers has absolute value less than or equal to $1000$. (The absolute value of $x$ is usually denoted by $|x|$. It is equal to $x$ if $x \ge 0$, and to $-x$ if $x < 0$. For example, $|6| = 6, |0| = 0$, and $|-7| = 7$.)

For which integers $n\ge 2$ can the numbers $1$ to $16$ be written each in one square of a squared $4\times 4$ paper such that the $8$ sums of the numbers in rows and columns are all different and divisible by $n$?

The sides of an equilateral triangle $ABC$ are divided into $n$ equal parts $(n \geq 2) .$ For each point on a side, we draw the lines parallel to other sides of the triangle $ABC,$ e.g. for $n=3$ we have the following diagram: [asy] unitsize(150); defaultpen(linewidth(0.7)); int n = 3; /* # of vertical lines, including AB */ pair A = (0,0), B = dir(-30), C = dir(30); draw(A--B--C--cycle,linewidth(2)); dot(A,UnFill(0)); dot(B,UnFill(0)); dot(C,UnFill(0)); label("$A$",A,W); label("$C$",C,NE); label("$B$",B,SE); for(int i = 1; i < n; ++i) { draw((i*A+(n-i)*B)/n--(i*A+(n-i)*C)/n); draw((i*B+(n-i)*A)/n--(i*B+(n-i)*C)/n); draw((i*C+(n-i)*A)/n--(i*C+(n-i)*B)/n); } [/asy] For each $n \geq 2,$ find the number of existing parallelograms.

There is a reunion of $201$ people from $5$ different countries. It is known that in each group of $6$ people, at least two have the same age. Show that there must be at least $5$ people with the same country, age and sex.

Let us name a move of the chess knight horizontal if it moves two cells horizontally and one vertically, and vertical otherwise. It is required to place the knight on a cell of a ${46} \times {46}$ board and alternate horizontal and vertical moves. Prove that if each cell is visited not more than once then the number of moves does not exceed 2024. Alexandr Gribalko

Ana baked 15 pasties. She placed them on a round plate in a circular way: 7 with cabbage, 7 with meat and 1 with cherries in that exact order and put the plate into a microwave. She doesn’t know how the plate has been rotated in the microwave. She wants to eat a pasty with cherries. Is it possible for Ana, by trying no more than three pasties, to find exactly where the pasty with cherries is?

Let $x_1$ and $x_2$ be positive integers. On a straight line, $y_1$ white segments and $y_2$ black segments are given, with $y_1 \ge x_1$ and $y_2 \ge x_2$. Suppose that no two segments of the same colour intersect (and do not have common ends). Moreover, suppose that for any choice of $x_1$ white segments and $x_2$ black segments, some pair of selected segments will intersect. Prove that $(y_1-x_1)(y_2-x_2)<x_1x_2$. [i]Proposed by G. Chelnokov[/i]

Let $k \in \mathbb{N},$ $S_k = \{(a, b) | a, b = 1, 2, \ldots, k \}.$ Any two elements $(a, b)$, $(c, d)$ $\in S_k$ are called "undistinguishing" in $S_k$ if $a - c \equiv 0$ or $\pm 1 \pmod{k}$ and $b - d \equiv 0$ or $\pm 1 \pmod{k}$; otherwise, we call them "distinguishing". For example, $(1, 1)$ and $(2, 5)$ are undistinguishing in $S_5$. Considering the subset $A$ of $S_k$ such that the elements of $A$ are pairwise distinguishing. Let $r_k$ be the maximum possible number of elements of $A$. (i) Find $r_5$. (ii) Find $r_7$. (iii) Find $r_k$ for $k \in \mathbb{N}$.

A cinema has its seats arranged in $n$ rows $\times m$ columns. It sold mn tickets but sold some seats more than once. The usher managed to allocate seats so that every ticket holder was in the correct row or column. Show that he could have allocated seats so that every ticket holder was in the correct row or column and at least one person was in the correct seat. What is the maximum $k$ such that he could have always put every ticket holder in the correct row or column and at least $k$ people in the correct seat?

Let $A=\overline{abcd}$ be a four-digit positive integer with digits $a, b, c, d$, such that $a\ge7$ and $a>b>c>d>0$. Consider the positive integer $B=\overline{dcba}$ , that comes from number $A$ by reverting the order of it's digits. Given that the number $A+B$ has all it's digits odd, find all possible values of number $A$.

Let \[M=\{1, 2, 3, \ldots, 2022\}\] Determine the least positive integer $k$, such that for every $k$ subsets of $M$ with the cardinality of each subset equal to $3$, there are two of these subsets with exactly one common element.