Given an $n \times n$ board which is divided into $n^2$ squares of size $1 \times 1$, all of which are white. Then, Aqua selects several squares from this board and colors them black. Ruby then places exactly one $1\times 2$ domino on the board, so that the domino covers exactly two squares on the board. Ruby can rotate the domino into a $2\times 1$ domino. After Aqua colors, it turns out there are exactly $2024$ ways for Ruby to place a domino on the board so that it covers exactly $1$ black square and $1$ white square. Determine the smallest possible value of $n$ so that Aqua and Ruby can do this. [i]Proposed by Muhammad Afifurrahman, Indonesia [/i]

There are $27$ boxes located in a row; each contains at least $12$ marbles. The allowed operation is transfer a ball from a box to its neighbor on the right, as long as said neighbor contains more pellets than the box from which the transfer will be made. We will say that a distribution initial of the balls is [i]happy [/i] if it is possible to achieve, by means of a succession of permitted operations, that all the balls are in the same box. Determine what is the smallest total number of marbles with the that you can have a happy initial layout.

A pond has $2025$ lily pads arranged in a circle. Two frogs, Alice and Bob, begin on different lily pads. A frog jump is a jump which travels $2$, $3$, or $5$ positions clockwise. Alice and Bob each make a series of frog jumps, and each frog ends on the same lily pad that it started from. Given that each lily pad is the destination of exactly one jump, prove that each frog completes exactly two laps around the pond (i.e. travels $4050$ positions in total). [i]Linus Tang[/i]

[b]p1.[/b] Four witches are riding their brooms around a circle with circumference $10$ m. They are standing at the same spot, and then they all start to ride clockwise with the speed of $1$, $2$, $3$, and $4$ m/s, respectively. Assume that they stop at the time when every pair of witches has met for at least two times (the first position before they start counts as one time). What is the total distance all the four witches have travelled? [b]p2.[/b] Suppose $A$ is an equilateral triangle, $O$ is its inscribed circle, and $B$ is another equilateral triangle inscribed in $O$. Denote the area of triangle $T$ as $[T]$. Evaluate $\frac{[A]}{[B]}$. [b]p3. [/b]Tim has bought a lot of candies for Halloween, but unfortunately, he forgot the exact number of candies he has. He only remembers that it's an even number less than $2020$. As Tim tries to put the candies into his unlimited supply of boxes, he finds that there will be $1$ candy left if he puts seven in each box, $6$ left if he puts eleven in each box, and $3$ left if he puts thirteen in each box. Given the above information, find the total number of candies Tim has bought. [b]p4.[/b] Let $f(n)$ be a function defined on positive integers n such that $f(1) = 0$, and $f(p) = 1$ for all prime numbers $p$, and $$f(mn) = nf(m) + mf(n)$$ for all positive integers $m$ and $n$. Let $$n = 277945762500 = 2^23^35^57^7$$ Compute the value of $\frac{f(n)}{n}$ . [b]p5.[/b] Compute the only positive integer value of $\frac{404}{r^2-4}$ , where $r$ is a rational number. [b]p6.[/b] Let $a = 3 +\sqrt{10}$ . If $$\prod^{\infty}_{k=1} \left( 1 + \frac{5a + 1}{a^k + a} \right)= m +\sqrt{n},$$ where $m$ and $n$ are integers, find $10m + n$. [b]p7.[/b] Charlie is watching a spider in the center of a hexagonal web of side length $4$. The web also consists of threads that form equilateral triangles of side length $1$ that perfectly tile the hexagon. Each minute, the spider moves unit distance along one thread. If $\frac{m}{n}$ is the probability, in lowest terms, that after four minutes the spider is either at the edge of her web or in the center, find the value of $m + n$. [b]p8.[/b] Let $ABC$ be a triangle with $AB = 10$; $AC = 12$, and $\omega$ its circumcircle. Let $F$ and $G$ be points on $\overline{AC}$ such that $AF = 2$, $FG = 6$, and $GC = 4$, and let $\overrightarrow{BF}$ and $\overrightarrow{BG}$ intersect $\omega$ at $D$ and $E$, respectively. Given that $AC$ and $DE$ are parallel, what is the square of the length of $BC$? [b]p9.[/b] Two blue devils and $4$ angels go trick-or-treating. They randomly split up into $3$ non-empty groups. Let $p$ be the probability that in at least one of these groups, the number of angels is nonzero and no more than the number of devils in that group. If $p = \frac{m}{n}$ in lowest terms, compute $m + n$. [b]p10.[/b] We know that$$2^{22000} = \underbrace{4569878...229376}_{6623\,\,\, digits}.$$ For how many positive integers $n < 22000$ is it also true that the first digit of $2^n$ is $4$? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given is a simple connected graph with $2n$ vertices. Prove that its vertices can be colored with two colors so that if there are $k$ edges connecting vertices with different colors and $m$ edges connecting vertices with the same color, then $k-m \geq n$.

Tomek invited to a remote birthday part $11$ of his friends who will join the meeting one by one. Tomek chose the guests in such a way that, regardless of the order in which they will join, always the newcomer knew at least half of the people already present, including Tomek. Prove that among of invited guests, there is one who knows all of Tom's other $10$ friends. Caution: We assume that if person A knows person $B$, then $B$ also knows $A$. [hide=original wording]Tomek zaprosił na zdalne przyjęcie urodzinowe 11 swoich znajomych, którzy kolejno będą dołączać do spotkania. Tomek dobrał gości w taki sposób, aby niezależnie od kolejności w jakiej będą dołączać, zawsze nowo przybyła osoba znała co najmniej połowę już obecnych osób, wliczając Tomka. Wykaż, że wśród zaproszonych gości istnieje taki, który zna wszystkich pozostałych 10 znajomych Tomka. Uwaga: Przyjmujemy, że jeśli osoba A zna osobę B, to również B zna A.[/hide]

Prove that for every positive integer $t$ there is a unique permutation $a_0, a_1, \ldots , a_{t-1}$ of $0, 1, \ldots , t-1$ such that, for every $0 \leq i \leq t-1$, the binomial coefficient $\binom{t+i}{2a_i}$ is odd and $2a_i \neq t+i$.

Numbers 1 and −1 are written in the cells of a board 2000×2000. It is known that the sum of all the numbers in the board is positive. Show that one can select 1000 rows and 1000 columns such that the sum of numbers written in their intersection cells is at least 1000. [i]D. Karpov[/i]

For a set $S$ of integers, define $\max (S)$ to be the maximal element of $S$. How many non-empty subsets $S \subseteq \{1, 2, 3, ... , 10\}$ satisfy $\max (S) \le |S| + 2$?

Let $E$ be a finite set, $P_E$ the family of its subsets, and $f$ a mapping from $P_E$ to the set of non-negative reals, such that for any two disjoint subsets $A,B$ of $E$, $f(A\cup B)=f(A)+f(B)$. Prove that there exists a subset $F$ of $E$ such that if with each $A \subset E$, we associate a subset $A'$ consisting of elements of $A$ that are not in $F$, then $f(A)=f(A')$ and $f(A)$ is zero if and only if $A$ is a subset of $F$.

A whole number is written on each square of a board of $2019\times 2021$ squares. If the number written in each square is equal to the arithmetic mean of the numbers written in two of its neighboring squares, how many different numbers written on the blackboard can there be at most? Note: Two squares on the board are neighbors when they have a common side.

A [i]hook[/i] consists of three segments of longitude $1$ forming two right angles as demonstrated in the figure. |_| We have a square of side length $n$ divided into $n^2$ squares of side length $1$ by lines parallel to its sides. Hooks are placed on this square in such a way that each segment of the hook covers one side of a little square. Two segements of a hook cannot overlap. Determine all possible values of n for which it is possible to cover the sides of the $n^2$ small squares.

Find the number of distinct permutations of $ITEST$. [i](.1 point)[/i]

Given a set $M$ of $1985$ distinct positive integers, none of which has a prime divisor greater than $23$, prove that $M$ contains a subset of $4$ elements whose product is the $4$th power of an integer.

Let $P = \{(x, y) | x, y \in \{0, 1, 2,... , 2015\}\}$ be a set of points on the plane. Straight wires of unit length are placed to connect points in $P$ so that each piece of wire connects exactly two points in $P$, and each point in $P$ is an endpoint of exactly one wire. Prove that no matter how the wires are placed, it is always possible to draw a straight line parallel to either the horizontal or vertical axis passing through midpoints of at least $506$ pieces of wire.

In some squares of a $2012\times 2012$ grid there are some beetles, such that no square contain more than one beetle. At one moment, all the beetles fly off the grid and then land on the grid again, also satisfying the condition that there is at most one beetle standing in each square. The vector from the centre of the square from which a beetle $B$ flies to the centre of the square on which it lands is called the [i]translation vector[/i] of beetle $B$. For all possible starting and ending configurations, find the maximum length of the sum of the [i]translation vectors[/i] of all beetles.

The first $510$ positive integers are written on a blackboard: $1, 2, 3, ..., 510$. An [i]operation [/i] consists of of erasing two numbers whose sum is a prime number. What is the maximum number of operations in a row what can be done? Show how it is accomplished and explain why it can be done in no more operations.

[u]Round 9[/u] [b]p25.[/b] Maisy the Bear is at the origin of the Cartesian Plane. WhenMaisy is on the point $(m,n)$ then it can jump to either $(m,n +1)$ or $(m+1,n)$. Let $L(x, y)$ be the number of pathsMaisy can take to reach the point $(x, y)$. The sum of $L(x, y)$ over all lattice points $(x, y)$ with both coordinates between $0$ and $2020$, inclusive, can be written as ${2k \choose k} - j$ for a minimum positive integer k and corresponding positive integer $j$ . Find $k + j$ . [b]p26.[/b] A circle with center $O$ and radius $2$ and a circle with center $P$ and radius $3$ are externally tangent at $A$. Points $B$ and $C$ are on the circle with center $O$ such that $\vartriangle ABC$ is equilateral. Segment $AB$ extends past B to point $D$ and $AC$ extends past $C$ to point $E$ such that $BD = CE =\sqrt3$. A line through $D$ is tangent to circle $P$ at $F$. The value of $EF^2$ can be expressed as $\frac{a+b\sqrt{c}}{d}$ where $a$, $b$, $c$, and $d$ are integers, c is squarefree, and $gcd(a,b,d) = 1$. Find $a +b +c +d$. [b]p27.[/b] Find the number of trailing zeroes at the end of $$\sum^{2021}_{i=1}(2021^i -1) = (2021^1 -1)...(2021^{2021}-1).$$ [u]Round 10[/u] [b]p28.[/b] Points $A, B, C, P$, and $D$ lie on circle ω in that order. Let $AC$ and $BD$ intersect at $I$ . Given that $PI = PC = PD$, $\angle DAB = 137^o$, and $\angle ABC = 109^o$, find the measure of $\angle BIC$ in degrees. [b]p29.[/b] Find the sum of all positive integers $n < 2021$ such that when ${d_1,d_2,... ,d_k}$ are the positive integer factors of $n$, then $$\left( \sum^{k}_{i=1}d_i \right) \left( \sum^{k}_{i=1} \frac{1}{d_i} \right)= r^2$$ for some rational number $r$ . [b]p30.[/b] Let $a, b, c, d$ and $e$ be positive real numbers. Define the function $f (x, y) = \frac{x}{y}+\frac{y}{x}$ for all positive real numbers. Given that $f (a,b) = 7$, $f (b,c) = 5$, $f (c,d) = 3$, and $f (d,e) = 2$, find the sum of all possible values of $f (e,a)$. [u]Round 11[/u] [b]p31.[/b] There exist $100$ (not necessarily distinct) complex numbers $r_1, r_2,..., r_{100}$ such that for any positive integer $1 \le k \le 100$, we have that $P(r_k ) = 0$ where the polynomial $P$ is defined as $$P(x) = \sum^{101}_{i=1}i \cdot x^{101-i} = x^{100} +2x^{99} +3x^{98} +...+99x^2 +100x +101.$$ Find the value of $$\prod^{100}_{j=1} (r^2_j+1) = (r^2_1 +1)(r^2_2 +1)...(r^2_{100} +1).$$ [b]p32.[/b] Let $BT$ be the diameter of a circle $\omega_1$, and $AT$ be a tangent of $\omega_1$. Line $AB$ intersects $\omega_1$ at $C$, and $\vartriangle ACT$ has circumcircle $\omega_2$. Points $P$ and $S$ exist such that $PA$ and $PC$ are tangent to $\omega_2$ and $SB = BT = 20$. Given that $AT = 15$, the length of $PS$ can be written as $\frac{a\sqrt{b}}{c}$ , where $a$, $b$, and $c$ are positive integers, $b$ is squarefree, and $gcd(a,b) = 1$. Find $a +b +c$. [b]p33.[/b] There are a hundred students in math team. Each pair of students are either mutually friends or mutually enemies. It is given that if any three students are chosen, then they are not all mutually friends. The maximum possible number of ways to choose four students such that it is possible to label them $A, B, C$, and $D$ such that $A$ and $B$ are friends, $B$ and $C$ are friends, $C$ and $D$ are friends, and D and A are friends can be expressed as $n^4$. Find $n$. [u]Round 12[/u] [b]p34.[/b] Let $\{p_i\}$ be the prime numbers, such that $p_1 = 2, p_2 = 3, p_3 = 5, ...$ For each $i$ , let $q_i$ be the nearest perfect square to $p_i$ . Estimate $\sum^{2021}_{i=1}|p_i=q_i |$. If the correct answer is $A$ and your answer is $E$, your score will be $\left \lfloor 30 \cdot \max - \left(0,1-5 \cdot \left| \log_{10} \frac{A}{E} \right| \right)\right \rfloor.$ [b]p35.[/b] Estimate the number of digits of $(2021!)^{2021}$. If the correct answer is $A$ and your answer is $E$, your score will be $\left \lfloor 15 \cdot \max \left(0,2- \cdot \left| \log_{10} \frac{A}{E} \right| \right) \right \rfloor.$ [b]p36.[/b] Pick a positive integer between$ 1$ and $1000$, inclusive. If your answer is $E$ and a quarter of the mean of all the responses to this problem is $A$, your score will be $$ \lfloor \max \left(0,30- |A-E|, 2-|E-1000| \right) \rfloor.$$ Note that if you pick $1000$, you will automatically get $2$ points. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3166489p28814241]here [/url] and 5-8 [url=https://artofproblemsolving.com/community/c3h3166494p28814284]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n \ge 3$ be a positive integer. We call a $3 \times 3$ grid [i]beautiful[/i] if the cell located at the center is colored white and all other cells are colored black, or if it is colored black and all other cells are colored white. Determine the minimum value of $a+b$ such that there exist positive integers $a$, $b$ and a coloring of an $a \times b$ grid with black and white, so that it contains $n^2 - n$ [i]beautiful[/i] subgrids.

For each letter in the English alphabet, William assigns an English word which contains that letter. His first document consists only of the word assigned to the letter $A$. In each subsequent document, he replaces each letter of the preceding document by its assigned word. The fortieth document begins with “Till whatsoever star that guides my moving.” Prove that this sentence reappears later in this document.

Cells of a $2000\times2000$ board are colored according to the following rules: 1)At any moment a cell can be colored, if none of its neighbors are colored 2)At any moment a $1\times2$ rectangle can be colored, if exactly two of its neighbors are colored. 3)At any moment a $2\times2$ squared can be colored, if 8 of its neighbors are colored (Two cells are considered to be neighboring, if they share a common side). Can the entire $2000\times2000$ board be colored? [I]Proposed by K. Kohas[/i]

[b]p1.[/b] Two players play the following game. On the lowest left square of an $8\times 8$ chessboard there is a rook. The first player is allowed to move the rook up or to the right by an arbitrary number of squares. The second player is also allowed to move the rook up or to the right by an arbitrary number of squares. Then the first player is allowed to do this again, and so on. The one who moves the rook to the upper right square wins. Who has a winning strategy? [b]p2.[/b] In Crocodile Country there are banknotes of $1$ dollar, $10$ dollars, $100$ dollars, and $1,000$ dollars. Is it possible to get 1,000,000 dollars by using $250,000$ banknotes? [b]p3.[/b] Fifteen positive numbers (not necessarily whole numbers) are placed around the circle. It is known that the sum of every four consecutive numbers is $30$. Prove that each number is less than $15$. [b]p4.[/b] Donald Duck has $100$ sticks, each of which has length $1$ cm or $3$ cm. Prove that he can break into $2$ pieces no more than one stick, after which he can compose a rectangle using all sticks. [b]p5.[/b] Three consecutive $2$ digit numbers are written next to each other. It turns out that the resulting $6$ digit number is divisible by $17$. Find all such numbers. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Two players Arnaldo and Betania play alternately, with Arnaldo being the first to play. Initially there are two piles of stones containing $x$ and $y$ stones respectively. In each play, it is possible to perform one of the following operations: 1. Choose two non-empty piles and take one stone from each pile. 2. Choose a pile with an odd amount of stones, take one of their stones and, if possible, split into two piles with the same amount of stones. The player who cannot perform either of operations 1 and 2 loses. Determine who has the winning strategy based on $x$ and $y$.

Let $n$ be a positive integer such that there exists a positive integer that is less than $\sqrt{n}$ and does not divide $n$. Let $(a_1, . . . , a_n)$ be an arbitrary permutation of $1, . . . , n$. Let $a_{i1} < . . . < a_{ik}$ be its maximal increasing subsequence and let $a_{j1} > . . . > a_{jl}$ be its maximal decreasing subsequence. Prove that tuples $(a_{i1}, . . . , a_{ik})$ and $(a_{j1}, . . . , a_{jl} )$ altogether contain at least one number that does not divide $n$.

There are 94 safes and 94 keys. Each key can open only one safe, and each safe can be opened by only one key. We place randomly one key into each safe. 92 safes are then randomly chosen, and then locked. What is the probability that we can open all the safes with the two keys in the two remaining safes? (Once a safe is opened, the key inside the safe can be used to open another safe.)