Consider a chessboard that is infinite in all directions. Alex the T-rex wishes to place a positive integer in each square in such a way that: [list] [*] No two numbers are equal. [*] If a number $m$ is placed on square $C$, then at least $k$ of the squares orthogonally adjacent to $C$ have a multiple of $m$ written on them. [/list] What is the greatest value of $k$ for which this is possible?

[b]p1.[/b] Consider a triangular grid: nodes of the grid are painted black and white. At a single step you are allowed to change colors of all nodes situated on any straight line (with the slope $0^o$ ,$60^o$, or $120^o$ ) going through the nodes of the grid. Can you transform the combination in the left picture into the one in the right picture in a finite number of steps? [img]https://cdn.artofproblemsolving.com/attachments/3/a/957b199149269ce1d0f66b91a1ac0737cf3f89.png[/img] [b]p2.[/b] Find $x$ satisfying $\sqrt{x\sqrt{x \sqrt{x ...}}} = \sqrt{2022}$ where it is an infinite expression on the left side. [b]p3.[/b] $179$ glasses are placed upside down on a table. You are allowed to do the following moves. An integer number $k$ is fixed. In one move you are allowed to turn any $k$ glasses . (a) Is it possible in a finite number of moves to turn all $179$ glasses into “bottom-down” positions if $k=3$? (b) Is it possible to do it if $k=4$? [b]p4.[/b] An interval of length $1$ is drawn on a paper. Using a compass and a simple ruler construct an interval of length $\sqrt{93}$. [b]p5.[/b] Show that $5^{2n+1} + 3^{n+2} 2^{n-1} $ is divisible by $19$ for any positive integer $n$. [b]p6.[/b] Solve the system $$\begin{cases} \dfrac{xy}{x+y}=1-z \\ \dfrac{yz}{y+z}=2-x \\ \dfrac{xz}{x+z}=2-y \end{cases}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Consider a quartet of positive numbers $(a,b,c,d)$. In one step, we transform it to $(ab,bc,cd,da)$. Prove that you can never obtain the initial set if neither of $a,b,c,d$ is $1$.

Given positive integer $n,k$ such that $2 \le n <2^k$. Prove that there exist a subset $A$ of $\{0,1,\cdots,n\}$ such that for any $x \neq y \in A$, ${y\choose x}$ is even, and $$|A| \ge \frac{{k\choose \lfloor \frac{k}{2} \rfloor}}{2^k} \cdot (n+1)$$

$65$ distinct natural numbers not exceeding $2016$ are given. Prove that among these numbers we can find four $a,b,c,d$ such that $a+b-c-d$ is divisible by $2016.$

For positive integer $n \ge 3$, find the number of ordered pairs $(a_1, a_2, ... , a_n)$ of integers that satisfy the following two conditions [list=disc] [*]For positive integer $i$ such that $1\le i \le n$, $1 \le a_i \le i$ [*]For positive integers $i,j,k$ such that $1\le i < j < k \le n$, if $a_i = a_j$ then $a_j \ge a_k$ [/list]

Let $n$ be a positive integer. Anna and Beatrice play a game with a deck of $n$ cards labelled with the numbers $1, 2,...,n$. Initially, the deck is shuffled. The players take turns, starting with Anna. At each turn, if $k$ denotes the number written on the topmost card, then the player first looks at all the cards and then rearranges the $k$ topmost cards. If, after rearranging, the topmost card shows the number k again, then the player has lost and the game ends. Otherwise, the turn of the other player begins. Determine, depending on the initial shuffle, if either player has a winning strategy, and if so, who does.

Let $N$ be the number of ways to place $4$ bishops on a $5 \times 5$ chessboard such that no $3$ are on the same diagonal. Find the remainder when $N$ is divided by $100$. (Note: the length of a diagonal on a $5 \times 5$ chessboard can be 2, 3, 4, or 5.)

Let $n$ be a positive integer. Find the number of sequences $x_{1},x_{2},\ldots x_{2n-1},x_{2n}$, where $x_{i}\in\{-1,1\}$ for each $i$, satisfying the following condition: for any integer $k$ and $m$ such that $1\le k\le m\le n$ then the following inequality holds \[\left|\sum_{i=2k-1}^{2m}x_{i}\right|\le\ 2\]

On a large, flat field $n$ people are positioned so that for each person the distances to all the other people are different. Each person holds a water pistol and at a given signal fires and hits the person who is closest. When $n$ is odd show that there is at least one person left dry. Is this always true when $n$ is even?

Proof that there exist constant $\lambda$, so that for any positive integer $m(\ge 2)$, and any lattice triangle $T$ in the Cartesian coordinate plane, if $T$ contains exactly one $m$-lattice point in its interior(not containing boundary), then $T$ has area $\le \lambda m^3$. PS. lattice triangles are triangles whose vertex are lattice points; $m$-lattice points are lattice points whose both coordinates are divisible by $m$.

Let $m$ and $n$ be positive integers greater than $1$. In each unit square of an $m\times n$ grid lies a coin with its tail side up. A [i]move[/i] consists of the following steps. [list=1] [*]select a $2\times 2$ square in the grid; [*]flip the coins in the top-left and bottom-right unit squares; [*]flip the coin in either the top-right or bottom-left unit square. [/list] Determine all pairs $(m,n)$ for which it is possible that every coin shows head-side up after a finite number of moves. [i]Thanasin Nampaisarn, Thailand[/i]

Consider an urn containing $51$ white and $50$ black balls. Every turn, we randomly pick a ball, record the color of the ball, and then we put the ball back into the urn. We stop picking when we have recorded $n$ black balls, where $n$ is an integer randomly chosen from $\{1, 2,... , 100\}$. What is the expected number of turns?

Find the number of permutations $( p_1, p_2, p_3 , p_4 , p_5 , p_6)$ of $1, 2 ,3,4,5,6$ such that for any $k, 1 \leq k \leq 5$, $(p_1, \ldots, p_k)$ does not form a permutation of $1 , 2, \ldots, k$.

Find the maximum number of parts into which the $Oxy$-plane can be divided by $100$ graphs of different quadratic functions of the form $y = ax^2 + bx + c$. (N.B. Vasiliev, Moscow)

Let $n > 1$ be a positive integer. A 2-dimensional grid, infinite in all directions, is given. Each 1 by 1 square in a given $n$ by $n$ square has a counter on it. A [i]move[/i] consists of taking $n$ adjacent counters in a row or column and sliding them each by one space along that row or column. A [i]returning sequence[/i] is a finite sequence of moves such that all counters again fill the original $n$ by $n$ square at the end of the sequence. [list] [*] Assume that all counters are distinguishable except two, which are indistinguishable from each other. Prove that any distinguishable arrangement of counters in the $n$ by $n$ square can be reached by a returning sequence. [*] Assume all counters are distinguishable. Prove that there is no returning sequence that switches two counters and returns the rest to their original positions.[/list] [i]Mitchell Lee and Benjamin Gunby.[/i]

Kathryn has a crush on Joe. Dressed as Catwoman, she attends the same school Halloween party as Joe, hoping he will be there. If Joe gets beat up, Kathryn will be able to help Joe, and will be able to tell him how much she likes him. Otherwise, Kathryn will need to get her hipster friend, Max, who is DJing the event, to play Joe’s favorite song, “Pieces of Me” by Ashlee Simpson, to get him out on the dance floor, where she’ll also be able to tell him how much she likes him. Since playing the song would be in flagrant violation of Max’s musical integrity as a DJ, Kathryn will have to bribe him to play the song. For every $\$10$ she gives Max, the probability of him playing the song goes up $10\%$ (from $0\%$ to $10\%$ for the first $\$10$, from $10\%$ to $20\%$ for the next $\$10$, all the way up to $100\%$ if she gives him $\$100$). Max only accepts money in increments of $\$10$. How much money should Kathryn give to Max to give herself at least a $65\%$ chance of securing enough time to tell Joe how much she likes him?

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]

For each positive integer $k$, let $g(k)$ be the maximum possible number of points in the plane such that pairwise distances between these points have only $k$ different values. Prove that there exists $k$ such that $g(k) > 2k + 2020$.

A set of $8$ problems was prepared for an examination. Each student was given $3$ of them. No two students received more than one common problem. What is the largest possible number of students?

An $8 \times 8$ board is divided into unit squares. Ten of these squares have their centers marked. Prove that either there exist two marked points on the distance at most $\sqrt2$, or there is a point on the distance $1/2$ from the edge of the board.

Let $\{x_n\}$ be a Van Der Corput series,that is,if the binary representation of $n$ is $\sum a_{i}2^{i}$ then $x_n=\sum a_i2^{-i-1}$.Let $V$ be the set of points on the plane that have the form $(n,x_n)$.Let $G$ be the graph with vertex set $V$ that is connecting any two points $(p,q)$ if there is a rectangle $R$ which lies in parallel position with the axes and $R\cap V= \{p,q\}$.Prove that the chromatic number of $G$ is finite.

Initially, there are $111$ pieces of clay on the table of equal mass. In one turn, you can choose several groups of an equal number of pieces and push the pieces into one big piece for each group. What is the least number of turns after which you can end up with $11$ pieces no two of which have the same mass?

There are $85$ soldiers with different heigth and age. Every day commander chooses random soldier and send him and also all soldiers that are taller and older than this soldier, or all soldiers that are lower and younger than this soldier to color grass. Prove that after $10$ days we can find two soldiers, that color grass at same days.

An underground burrow consists of an infinite sequence of rooms labeled by the integers $(\dots, -3, -2, -1, 0, 1, 2, 3,\dots)$. Initially, some of the rooms are occupied by one or more rabbits. Each rabbit wants to be alone. Thus, if there are two or more rabbits in the same room (say, room $m$), half of the rabbits (rounding down) will flee to room $m-1$, and half (also rounding down) to room $m+1$. Once per minute, this happens simultaneously in all rooms that have two or more rabbits. For example, if initially all rooms are empty except for $5$ rabbits in room $\#12$ and $2$ rabbits in room $\#13$, then after one minute, rooms $\text{\#11--\#14}$ will contain $2$, $2$, $2$, and $1$ rabbits, respectively, and all other rooms will be empty. Now suppose that initially there are $k+1$ rabbits in room $k$ for each $k=0, 1, 2, \ldots, 9, 10$, and all other rooms are empty. [list=a] [*]Show that eventually the rabbits will stop moving. [*] Determine which rooms will be occupied when this occurs. [/list]