Each person stands on a whole number on the number line from $0$ to $2022$ . In each turn, two people are selected by a distance of at least $2$. These go towards each other by $1$. When no more such moves are possible, the process ends. Show that this process always ends after a finite number of moves, and determine all possible configurations where people can end up standing. (whereby is for each configuration is only of interest how many people stand at each number.) [i](Birgit Vera Schmidt)[/i] [hide=original wording]Bei jeder ganzen Zahl auf dem Zahlenstrahl von 0 bis 2022 steht zu Beginn eine Person. In jedem Zug werden zwei Personen mit Abstand mindestens 2 ausgewählt. Diese gehen jeweils um 1 aufeinander zu. Wenn kein solcher Zug mehr möglich ist, endet der Vorgang. Man zeige, dass dieser Vorgang immer nach endlich vielen Zügen endet, und bestimme alle möglichen Konfigurationen, wo die Personen am Ende stehen können. (Dabei ist für jede Konfiguration nur von Interesse, wie viele Personen bei jeder Zahl stehen.)[/hide]

For every $n$ non-negative integer let $S(n)$ denote a subset of the positive integers, for which $i$ is an element of $S(n)$ if and only if the $i$-th digit (from the right) in the base two representation of $n$ is a digit $1$. Two players, $A$ and $B$ play the following game: first, $A$ chooses a positive integer $k$, then $B$ chooses a positive integer $n$ for which $2^n\geqslant k$. Let $X$ denote the set of integers $\{ 0,1,\dotsc ,2^n-1\}$, let $Y$ denote the set of integers $\{ 0,1,\dotsc ,2^{n+1}-1\}$. The game consists of $k$ rounds, and in each round player $A$ chooses an element of set $X$ or $Y$, then player $B$ chooses an element from the other set. For $1\leqslant i\leqslant k$ let $x_i$ denote the element chosen from set $X$, let $y_i$ denote the element chosen from set $Y$. Player $B$ wins the game, if for every $1\leqslant i\leqslant k$ and $1\leqslant j\leqslant k$, $x_i<x_j$ if and only if $y_i<y_j$ and $S(x_i)\subset S(x_j)$ if and only if $S(y_i)\subset S(y_j)$. Which player has a winning strategy? [i]Proposed by Levente Bodnár, Cambridge[/i]

Given integers \( m, n \geq 2 \), the points \( A_1, A_2, \dots, A_n \) are chosen independently and uniformly at random on a circle of circumference \( 1 \). That is, for each \( i = 1, \dots, n \), for any \( x \in (0,1) \), and for any arc \( \mathcal{C} \) of length \( x \) on the circle, we have $\mathbb{P}(A_i \in \mathcal{C}) = x$. What is the probability that there exists an arc of length \( \frac{1}{m} \) on the circle that contains all the points \( A_1, A_2, \dots, A_n \)?

The polynomial $x^8 +x^7$ is written on a blackboard. In a move, Peter can erase the polynomial $P(x)$ and write down $(x+1)P(x)$ or its derivative $P'(x).$ After a while, the linear polynomial $ax+b$ with $a\ne 0$ is written on the board. Prove that $a-b$ is divisible by $49.$

Based on a city's rules, the buildings of a street may not have more than $9$ stories. Moreover, if the number of stories of two buildings is the same, no matter how far they are from each other, there must be a building with a higher number of stories between them. What is the maximum number of buildings that can be built on one side of a street in this city?

Arutyun and Amayak show another effective trick. A spectator writes down on a board a sequence of $N$ (decimal) digits. Amayak closes two adjacent digits by a black disc. Then Arutyun comes and says both closed digits (and their order). For which minimal $N$ they may show such a trick? [i]K. Knop, O. Leontieva[/i]

Let $ \mathcal{F}$ be a family of hexagons $ H$ satisfying the following properties: i) $ H$ has parallel opposite sides. ii) Any 3 vertices of $ H$ can be covered with a strip of width 1. Determine the least $ \ell\in\mathbb{R}$ such that every hexagon belonging to $ \mathcal{F}$ can be covered with a strip of width $ \ell$. Note: A strip is the area bounded by two parallel lines separated by a distance $ \ell$. The lines belong to the strip, too.

In Shvambrania there are $N$ towns, every two of which are connected by a road. These roads do not intersect. If necessary, some of them pass over or under others via bridges. An evil magician establishes one-way rules along the roads in such a way that if someone goes out of a certain town he is unable to come back. Prove that (a) It is possible to establish such rules. (b) There exists a town from which it is possible to reach any other town, and there exists a town from which it is not possible to go out. (c) There is one and only one route passing through all towns. (d) The magician can realise his intention in $N!$ ways. (LM Koganov, Moscow) PS. (a),(b),(c) for Juniors, (a),(b),(d) for Seniors

In a "Hanger Party", the guests are initially dressed. In certain moments, the host chooses a guest, and the chosen guest and all his friends will wear its respective clothes if they are naked, and undress it if they are dressed. It is possible that, in some moment, the guests are naked, independent of their mutual friendships? (Suppose friendship is reciprocal.)

Let $n$ be a positive integer. On a board there are written all integers from $1$ to $n$. Alina does $n$ moves consecutively: for every integer $m$ $(1 \leq m \leq n)$ the move $m$ consists in changing the sign of every number divisible by $m$. At the end Alina sums the numbers. Find this sum.

$10$ people attended a party. For every $3$ people, there exist at least $2$ people who don’t know each other. Prove that there exist $4$ people who don’t know each other.

Let $A_1A_2 . . .A_{100}$ be the vertices of a regular $100$-gon. Let $\pi$ be a randomly chosen permutation of the numbers from $1$ through $100$. The segments $A_{\pi (1)}A_{\pi (2)}$, $A_{\pi (2)}A_{\pi (3)}$, $...$ ,$A_{\pi (99)}A_{\pi (100)}, A_{\pi (100)}A_{\pi (1)}$ are drawn. Find the expected number of pairs of line segments that intersect at a point in the interior of the $100$-gon.

A convex figure $F$ is such that any equilateral triangle with side $1$ has a parallel translation that takes all its vertices to the boundary of $F$. Is $F$ necessarily a circle?

There are totally $16$ teams participating in a football tournament, each team playing with every other exactly $1$ time. In each match, the winner gains $3$ points, the loser gains $0$ point and each teams gain $1$ point for the tie match. Suppose that at the end of the tournament, each team gains the same number of points. Prove that there are at least $4$ teams that have the same number of winning matches, the same number of losing matches and the same number of tie matches.

Let $m,n>2$ be integers. A regular ${n}$-sided polygon region $\mathcal T$ on a plane contains a regular ${m}$-sided polygon region with a side length of ${}{}{}1$. Prove that any regular ${m}$-sided polygon region $\mathcal S$ on the plane with side length $\cos{\pi}/[m,n]$ can be translated inside $\mathcal T.$ In other words, there exists a vector $\vec\alpha,$ such that for each point in $\mathcal S,$ after translating the vector $\vec\alpha$ at that point, it fall into $\mathcal T.$ Note: The polygonal area includes both the interior and boundaries. [i]Created by Bin Wang[/i]

At a tennis tournament there were $2n$ boys and $n$ girls participating. Every player played every other player. The boys won $\frac 75$ times as many matches as the girls. It is knowns that there were no draws. Find $n$. [i]Serbia[/i]

The figure shows a network of roads bounding $12$ blocks. Person $P$ goes from $A$ to $B,$ and person $Q$ goes from $B$ to $A,$ each going by a shortest path (along roads). The persons start simultaneously and go at the same constant speed. At each point with two possible directions to take, both have the same probability. Find the probability that the persons meet. [asy] import graph; size(150); real lsf = 0.5; pen dp = linewidth(0.7) + fontsize(10); defaultpen(dp); pen ds = black; draw((0,3)--(4,3),linewidth(1.2pt)); draw((4,3)--(4,0),linewidth(1.2pt)); draw((4,0)--(0,0),linewidth(1.2pt)); draw((0,0)--(0,3),linewidth(1.2pt)); draw((1,3)--(1,0),linewidth(1.2pt)); draw((2,3)--(2,0),linewidth(1.2pt)); draw((3,3)--(3,0),linewidth(1.2pt)); draw((0,1)--(4,1),linewidth(1.2pt)); draw((4,2)--(0,2),linewidth(1.2pt)); dot((0,0),ds); label("$A$", (-0.3,-0.36),NE*lsf); dot((4,3),ds); label("$B$", (4.16,3.1),NE*lsf); clip((-4.3,-10.94)--(-4.3,6.3)--(16.18,6.3)--(16.18,-10.94)--cycle); [/asy]

Let $a_1, a_2, \ldots, a_{11}$ be integers. Prove that there exist numbers $b_1, b_2, \ldots, b_{11}$ such that [list] [*] $b_i$ is equal to $-1,0$ or $1$ for all $i \in \{1, 2,\dots, 11\}$. [*] all numbers can't be zero at a time. [*] the number $N=a_1b_1+a_2b_2+\ldots+a_{11}b_{11}$ is divisible by $2024$. [/list]

[b]p1.[/b] David is taking a $50$-question test, and he needs to answer at least $70\%$ of the questions correctly in order to pass the test. What is the minimum number of questions he must answer correctly in order to pass the test? [b]p2.[/b] You decide to flip a coin some number of times, and record each of the results. You stop flipping the coin once you have recorded either $20$ heads, or $16$ tails. What is the maximum number of times that you could have flipped the coin? [b]p3.[/b] The width of a rectangle is half of its length. Its area is $98$ square meters. What is the length of the rectangle, in meters? [b]p4.[/b] Carol is twice as old as her younger brother, and Carol's mother is $4$ times as old as Carol is. The total age of all three of them is $55$. How old is Carol's mother? [b]p5.[/b] What is the sum of all two-digit multiples of $9$? [b]p6.[/b] The number $2016$ is divisible by its last two digits, meaning that $2016$ is divisible by $16$. What is the smallest integer larger than $2016$ that is also divisible by its last two digits? [b]p7.[/b] Let $Q$ and $R$ both be squares whose perimeters add to $80$. The area of $Q$ to the area of $R$ is in a ratio of $16 : 1$. Find the side length of $Q$. [b]p8.[/b] How many $8$-digit positive integers have the property that the digits are strictly increasing from left to right? For instance, $12356789$ is an example of such a number, while $12337889$ is not. [b]p9.[/b] During a game, Steve Korry attempts $20$ free throws, making 16 of them. How many more free throws does he have to attempt to finish the game with $84\%$ accuracy, assuming he makes them all? [b]p10.[/b] How many dierent ways are there to arrange the letters $MILKTEA$ such that $TEA$ is a contiguous substring? For reference, the term "contiguous substring" means that the letters $TEA$ appear in that order, all next to one another. For example, $MITEALK$ would be such a string, while $TMIELKA$ would not be. [b]p11.[/b] Suppose you roll two fair $20$-sided dice. What is the probability that their sum is divisible by $10$? [b]p12.[/b] Suppose that two of the three sides of an acute triangle have lengths $20$ and $16$, respectively. How many possible integer values are there for the length of the third side? [b]p13.[/b] Suppose that between Beijing and Shanghai, an airplane travels $500$ miles per hour, while a train travels at $300$ miles per hour. You must leave for the airport $2$ hours before your flight, and must leave for the train station $30$ minutes before your train. Suppose that the two methods of transportation will take the same amount of time in total. What is the distance, in miles, between the two cities? [b]p14.[/b] How many nondegenerate triangles (triangles where the three vertices are not collinear) with integer side lengths have a perimeter of $16$? Two triangles are considered distinct if they are not congruent. [b]p15.[/b] John can drive $100$ miles per hour on a paved road and $30$ miles per hour on a gravel road. If it takes John $100$ minutes to drive a road that is $100$ miles long, what fraction of the time does John spend on the paved road? [b]p16.[/b] Alice rolls one pair of $6$-sided dice, and Bob rolls another pair of $6$-sided dice. What is the probability that at least one of Alice's dice shows the same number as at least one of Bob's dice? [b]p17.[/b] When $20^{16}$ is divided by $16^{20}$ and expressed in decimal form, what is the number of digits to the right of the decimal point? Trailing zeroes should not be included. [b]p18.[/b] Suppose you have a $20 \times 16$ bar of chocolate squares. You want to break the bar into smaller chunks, so that after some sequence of breaks, no piece has an area of more than $5$. What is the minimum possible number of times that you must break the bar? For an example of how breaking the chocolate works, suppose we have a $2\times 2$ bar and wish to break it entirely into $1\times 1$ bars. We can break it once to get two $2\times 1$ bars. Then, we would have to break each of these individual bars in half in order to get all the bars to be size $1\times 1$, and we end up using $3$ breaks in total. [b]p19.[/b] A class of $10$ students decides to form two distinguishable committees, each with $3$ students. In how many ways can they do this, if the two committees can have no more than one student in common? [b]p20.[/b] You have been told that you are allowed to draw a convex polygon in the Cartesian plane, with the requirements that each of the vertices has integer coordinates whose values range from $0$ to $10$ inclusive, and that no pair of vertices can share the same $x$ or $y$ coordinate value (so for example, you could not use both $(1, 2)$ and $(1, 4)$ in your polygon, but $(1, 2)$ and $(2, 1)$ is fine). What is the largest possible area that your polygon can have? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a positive integer $N$ (written in base $10$), define its [i]integer substrings[/i] to be integers that are equal to strings of one or more consecutive digits from $N$, including $N$ itself. For example, the integer substrings of $3208$ are $3$, $2$, $0$, $8$, $32$, $20$, $320$, $208$, $3208$. (The substring $08$ is omitted from this list because it is the same integer as the substring $8$, which is already listed.) What is the greatest integer $N$ such that no integer substring of $N$ is a multiple of $9$? (Note: $0$ is a multiple of $9$.)

For every subset $\mathcal{P}$ of the plane let $S(\mathcal{P})$ denote the set of circles and lines that intersect $\mathcal{P}$ in at least three points. Find all sets $\mathcal{P}$ consisting of 2024 points such that for any two distinct elements of $S(\mathcal{P}),$ their intersection points all belong to $\mathcal{P}{}.$

Let $n$ be a positive integer. There are $n$ purple and $n$ white cows queuing in a line in some order. Tim wishes to sort the cows by colour, such that all purple cows are at the front of the line. At each step, he is only allowed to swap two adjacent groups of equally many consecutive cows. What is the minimal number of steps Tim needs to be able to fulfill his wish, regardless of the initial alignment of the cows?

Let $a_1,a_2,\ldots,a_7, b_1,b_2,\ldots,b_7\geq 0$ be real numbers satisfying $a_i+b_i\le 2$ for all $i=\overline{1,7}$. Prove that there exist $k\ne m$ such that $|a_k-a_m|+|b_k-b_m|\le 1$. Thanks for show me the mistake typing

A group of 6 math students is staying at a mathematical hotel to participate in a math tournament that will take place in the city in the coming days. This group, composed of 3 women and 3 men, was assigned rooms in a specific way by the hotel administration: in separate rooms and alternating between genders, specifically: woman, man, woman, man, woman, man, occupying the last 6 rooms in a corridor numbered from 101 to 110. \begin{tabular}{|c|c|c|c|c|c|c|c|c|c|} \hline M & H & M & H & M & H & & & & \\ \hline 110 & 109 & 108 & 107 & 106 & 105 & 104 & 103 & 102 & 101 \\ \hline \end{tabular} Against the hotel's rules, the group devised the following game: A valid room exchange occurs when two students in consecutive rooms move to two empty rooms, such that the difference between their new room numbers and their original ones is the same. For example, if the students in rooms 105 and 106 move to rooms 101 and 102, this would be a valid exchange since both numbers decreased by 4 units. Determine if, following these rules, the students can manage to have rooms 101, 102, and 103 occupied by men and rooms 104, 105, and 106 occupied by women in just 3 valid exchanges.

Can You fill the squares of the infinite cross-lined paper with integers so, that the sum of the numbers in every $4\times 6$ fields rectangle would be a) $10$? b) $1$?