There are $11$ empty boxes. In one move you can put one coin in some 10 of them. Two people play and take turns. Wins the one after which for the first time there will be $21$ coins in one of the boxes. Who wins when played correctly?

The magician puts out hardly a deck of $52$ cards and announces that $51$ of them will be thrown out of the table, and there will remain three of clubs. The viewer at each step says which count from the edge the card should be thrown out, and the magician chooses to count from the left or right edge, and ejects the corresponding card. At what initial positions of the three of clubs can the success of the focus be guaranteed?

In a row the numbers $1,2,...,2010$ have been written. Two players, taking turns, write $+$ or $\times$ between two consecutive numbers whenever possible. The first player wins if the algebraic sum obtained is divisible by $3$; otherwise, the second player wins. Find a winning strategy for one of the players.

On each non-boundary unit segment of an $8\times 8$ chessboard, we write the number of dissections of the board into dominoes in which this segment lies on the border of a domino. What is the last digit of the sum of all the written numbers?

Let $n\ge 5$ be an integer. Consider $2n-1$ subsets $A_1, A_2, A_3, \ldots , A_{2n-1}$ of the set $\{ 1, 2, 3,\ldots , n \}$, these subsets have the property that each of them has $2$ elements (that is that is, for $1 \le i \le 2n-1$ it is true that $A_i$ has $2$ elements). Show that it is always possible to select $n$ of these subsets in such a way that the union of these $n$ subsets has at most $\frac{2}{3}n + 1$ elements in total.

[u]Set 6[/u] [b]B16.[/b] Let $\ell_r$ denote the line $x + ry + r^2 = 420$. Jeffrey draws the lines $\ell_a$ and $\ell_b$ and calculates their single intersection point. [b]B17.[/b] Let set $L$ consist of lines of the form $3x + 2ay = 60a + 48$ across all real constants a. For every line $\ell$ in $L$, the point on $\ell$ closest to the origin is in set $T$ . The area enclosed by the locus of all the points in $T$ can be expressed in the form nπ for some positive integer $n$. Compute $n$. [b]B18.[/b] What is remainder when the $2020$-digit number $202020 ... 20$ is divided by $275$? [u]Set 7[/u] [b]B19.[/b] Consider right triangle $\vartriangle ABC$ where $\angle ABC = 90^o$, $\angle ACB = 30^o$, and $AC = 10$. Suppose a beam of light is shot out from point $A$. It bounces off side $BC$ and then bounces off side $AC$, and then hits point $B$ and stops moving. If the beam of light travelled a distance of $d$, then compute $d^2$. [b]B20.[/b] Let $S$ be the set of all three digit numbers whose digits sum to $12$. What is the sum of all the elements in $S$? [b]B21.[/b] Consider all ordered pairs $(m, n)$ where $m$ is a positive integer and $n$ is an integer that satisfy $$m! = 3n^2 + 6n + 15,$$ where $m! = m \times (m - 1) \times ... \times 1$. Determine the product of all possible values of $n$. [u]Set 8[/u] [b]B22.[/b] Compute the number of ordered pairs of integers $(m, n)$ satisfying $1000 > m > n > 0$ and $6 \cdot lcm(m - n, m + n) = 5 \cdot lcm(m, n)$. [b]B23.[/b] Andrew is flipping a coin ten times. After every flip, he records the result (heads or tails). He notices that after every flip, the number of heads he had flipped was always at least the number of tails he had flipped. In how many ways could Andrew have flipped the coin? [b]B24.[/b] Consider a triangle $ABC$ with $AB = 7$, $BC = 8$, and $CA = 9$. Let $D$ lie on $\overline{AB}$ and $E$ lie on $\overline{AC}$ such that $BCED$ is a cyclic quadrilateral and $D, O, E$ are collinear, where $O$ is the circumcenter of $ABC$. The area of $\vartriangle ADE$ can be expressed as $\frac{m\sqrt{n}}{p}$, where $m$ and $p$ are relatively prime positive integers, and $n$ is a positive integer not divisible by the square of any prime. What is $m + n + p$? [u]Set 9[/u] [i]This set consists of three estimation problems, with scoring schemes described.[/i] [b]B25.[/b] Submit one of the following ten numbers: $$3 \,\,\,\, 6\,\,\,\, 9\,\,\,\, 12\,\,\,\, 15\,\,\,\, 18\,\,\,\, 21\,\,\,\, 24\,\,\,\, 27\,\,\,\, 30.$$ The number of points you will receive for this question is equal to the number you selected divided by the total number of teams that selected that number, then rounded up to the nearest integer. For example, if you and four other teams select the number $27$, you would receive $\left\lceil \frac{27}{5}\right\rceil = 6$ points. [b]B26.[/b] Submit any integer from $1$ to $1,000,000$, inclusive. The standard deviation $\sigma$ of all responses $x_i$ to this question is computed by first taking the arithmetic mean $\mu$ of all responses, then taking the square root of average of $(x_i -\mu)^2$ over all $i$. More, precisely, if there are $N$ responses, then $$\sigma =\sqrt{\frac{1}{N} \sum^N_{i=1} (x_i -\mu)^2}.$$ For this problem, your goal is to estimate the standard deviation of all responses. An estimate of $e$ gives $\max \{ \left\lfloor 130 ( min \{ \frac{\sigma }{e},\frac{e}{\sigma }\}^{3}\right\rfloor -100,0 \}$ points. [b]B27.[/b] For a positive integer $n$, let $f(n)$ denote the number of distinct nonzero exponents in the prime factorization of $n$. For example, $f(36) = f(2^2 \times 3^2) = 1$ and $f(72) = f(2^3 \times 3^2) = 2$. Estimate $N = f(2) + f(3) +.. + f(10000)$. An estimate of $e$ gives $\max \{30 - \lfloor 7 log_{10}(|N - e|)\rfloor , 0\}$ points. PS. You had better use hide for answers. First sets have been posted [url=https://artofproblemsolving.com/community/c4h2777391p24371239]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In the middle cell of the $1 \times 2005$ strip there is a chip. Two players each queues move it: first, the first player moves the piece one cell in any direction, then the second one moves it $2$ cells, the $1$st - by $4$ cells, the 2nd by $8$, etc. (the $k$-th shift occurs by $2^{k-1}$ cells). That, whoever cannot make another move loses. Who can win regardless of the opponent's play?

For any integer $r \geq 1$, determine the smallest integer $h(r) \geq 1$ such that for any partition of the set $\{1, 2, \cdots, h(r)\}$ into $r$ classes, there are integers $a \geq 0 \ ; 1 \leq x \leq y$, such that $a + x, a + y, a + x + y$ belong to the same class. [i]Proposed by Romania[/i]

In a square board of size 1001 x 1001, we color some $m$ cells in such a way that: i. Of any two cells that share an edge, at least one is colored. ii. Of any 6 consecutive cells in a column or a row, at least 2 consecutive ones are colored. Determine the smallest possible value of $m$.

Let $m,n \ge 2$ be integers. The sides $A_{00}A_{0m}$ and $A_{nm}A_{n0}$ of a convex quadrilateral $A_{00}A_{0m}A_{nm}A_{n0}$ are divided into $m$ equal segments by points $A_{0j}$ and $A_{nj}$ respectively ($j = 1,...,m-1$). The other two sides are divided into $n$ equal segments by points $A_{i0}$ and $A_{im}$ ($i = 1,...,n -1$). Denote by $A_{ij}$ the intersection of lines $A_{0j}A{nj}$ and $A_{i0}A_{im}$, by $S_{ij}$ the area of quadrilateral $A_{ij}A_{i, j+1}A_{i+1, j+1}A_{i+1, j}$ and by $S$ the area of the big quadrilateral. Show that $S_{ij} +S_{n-1-i,m-1-j} = \frac{2S}{mn}$

Peter writes a positive integer on the whiteboard. Each minute Basil multiplies the last written number by 2 or by 3 and writes the product on the whiteboard too. Can Peter choose the starting integer such that, irrespective of Basil's strategy, at any given moment the number of integers on the whiteboard starting with 1 or 2 would exceed the number of the ones starting with 7, 8 or 9 ? Maxim Didin

Let $n\geq 2$ be an integer. Determine the number of terms in the polynomial $$\prod_{1\leq i< j\leq n}(x_i+x_j)$$ whose coefficients are odd integers.

At a dinner party there are $N$ hosts and $N$ guests, seated around a circular table, where $N\geq 4$. A pair of two guests will chat with one another if either there is at most one person seated between them or if there are exactly two people between them, at least one of whom is a host. Prove that no matter how the $2N$ people are seated at the dinner party, at least $N$ pairs of guests will chat with one another.

Three coins are placed at the origin of a Cartesian coordinate system. On one move one removes a coin placed at some position $(x, y)$ and places three new coins at $(x+1, y)$, $(x, y+1)$ and $(x+1, y+1)$. Prove that after finitely many moves, there will exist two coins placed at the same point.

Consider the following figure formed by $10$ nodes and $15$ edges: [asy] unitsize(1.5 cm); pair A, B, C, D, E, F, G, H, I, J; A = dir(90); B = dir(90 + 360/5); C = dir(90 + 2*360/5); D = dir(90 + 3*360/5); E = dir(90 + 4*360/5); F = 0.6*A; G = 0.6*B; H = 0.6*C; I = 0.6*D; J = 0.6*E; draw(A--B--C--D--E--cycle); draw(F--H--J--G--I--cycle); draw(A--F); draw(B--G); draw(C--H); draw(D--I); draw(E--J); dot(A); dot(B); dot(C); dot(D); dot(E); dot(F); dot(G); dot(H); dot(I); dot(J); [/asy] Prove that the edges of the figure cannot be colored by using $3$ different colors so that the edges that reach each node have different colors from each other.

Does there exist a bijection $f:\mathbb{N}^{+} \rightarrow \mathbb{N}^{+}$, such that there exist a positive integer $k$, and it's possible to have each positive integer colored by one of $k$ chosen colors, such that for any $x \neq y$ , $f(x)+y$ and $f(y)+x$ are not the same color?

In the cells of the $2024\times 2024$ board, integers are arranged so that in any $2 \times 2023$ rectangle (vertical or horizontal) with one cut corner cell that does not go beyond the board, the sum of the numbers is divided by $13$. Prove that the sum of all the numbers on the board is divisible by $13$.

Let $A$ be the largest subset of $\{1,\dots,n\}$ such that for each $x\in A$, $x$ divides at most one other element in $A$. Prove that \[\frac{2n}3\leq |A|\leq \left\lceil \frac{3n}4\right\rceil. \]

At an IMOTC party, all people have pairwise distinct ages. Some pairs of people are friends and friendship is mutual. Call a person [i]junior[/i] if they are younger than all their friends, and [i]senior[/i] if they are older than all their friends. A person with no friends is both [i]junior[/i] and [i]senior[/i]. A sequence of pairwise distinct people $A_1, \dots, A_m$ is called [i]photogenic[/i] if: 1. $A_1$ is [i]junior[/i], 2. $A_m$ is [i]senior[/i], and 3. $A_i$ and $A_{i+1}$ are friends, and $A_{i+1}$ is older than $A_i$ for all $1 \leq i \leq m-1$. Let $k$ be a positive integer such that for every [i]photogenic[/i] sequence $A_1, \dots, A_m$, $m$ is not divisible by $k$. Prove that the people at the party can be partitioned into $k$ groups so that no two people in the same group are friends. [i]Proposed by Shantanu Nene[/i]

Consider $n$ children in a playground, where $n\ge 2$. Every child has a coloured hat, and every pair of children is joined by a coloured ribbon. For every child, the colour of each ribbon held is different, and also different from the colour of that child’s hat. What is the minimum number of colours that needs to be used?

Let $n\ge 2$ be an integer. Ariane and Bérénice play a game on the number of the residue classes modulo $n$. At the beginning there is the residue class $1$ on each piece of paper. It is the turn of the player whose turn it is to replace the current residue class $x$ with either $x + 1$ or by $2x$. The two players take turns, with Ariane starting. Ariane wins if the residue class $0$ is reached during the game. Bérénice wins if she can prevent that permanently. Depending on $n$, determine which of the two has a winning strategy.

Let $n$ be a positive integer. Find the number of sequences $a_0,a_1,a_2,\dots,a_{2n}$ of integers in the range $[0,n]$ such that for all integers $0\leq k\leq n$ and all nonnegative integers $m$, there exists an integer $k\leq i\leq 2k$ such that $\lfloor k/2^m\rfloor=a_i.$ [i]Andrew Carratu[/i]

Consider $S=\{1, 2, 3, \cdots, 6n\}$, $n>1$. Find the largest $k$ such that the following statement is true: every subset $A$ of $S$ with $4n$ elements has at least $k$ pairs $(a,b)$, $a<b$ and $b$ is divisible by $a$.

It is given $5$ numbers $1$, $3$, $5$, $7$, $9$. We get the new $5$ numbers such that we take arbitrary $4$ numbers(out of current $5$ numbers) $a$, $b$, $c$ and $d$ and replace them with $\frac{a+b+c-d}{2}$, $\frac{a+b-c+d}{2}$, $\frac{a-b+c+d}{2}$ and $\frac{-a+b+c+d}{2}$. Can we, with repeated iterations, get numbers: $a)$ $0$, $2$, $4$, $6$ and $8$ $b)$ $3$, $4$, $5$, $6$ and $7$

Two players play a game with a pile of $N$ coins on a table. On a player's turn, if there are $n$ coins, the player can take at most $n/2+1$ coins, and must take at least one coin. The player who grabs the last coin wins. For how many values of $N$ between $1$ and $100$ (inclusive) does the first player have a winning strategy?