In a school there are $2021$ doors with the numbers $1,2,\dots,2021$. In a day $2021$ students play the following game: Initially all the doors are closed, and each student receive a card to define the order, there are exactly $2021$ cards. The numbers in the cards are $1,2,\dots,2020,2021$. The order will be student $1$ first, student $2$ will be the second, and going on. The student $k$ will change the state of the doors $k,2k,4k,8k,\dots,2^pk$ with $2^pk\leq 2021\leq 2^{p+1}k$. Change the state is [b]if the door was close, it will be open and vice versa.[/b] a) After the round of the student $16$, determine the configuration of the doors $1,2,\dots,16$ b) After the round of the student $2021$, determine how many doors are closed.

Every cell of a $2017\times 2017$ grid is colored either black or white, such that every cell has at least one side in common with another cell of the same color. Let $V_1$ be the set of all black cells, $V_2$ be the set of all white cells. For set $V_i (i=1,2)$, if two cells share a common side, draw an edge with the centers of the two cells as endpoints, obtaining graphs $G_i$. If both $G_1$ and $G_2$ are connected paths (no cycles, no splits), prove that the center of the grid is one of the endpoints of $G_1$ or $G_2$.

$2013$ people run a marathon on a straight road $4m$ wide broad. At any given moment, no two runners are closer $2$ m from each other. Prove that there are two runners that at that moment are more than $1052$ m from each other. Note: Consider runners as points.

Let $ m,n$ be positive integers, and let $ F$ be a family of $ m$-element subsets of $ \{1,2,...,n\}$ satisfying $ A\cap B \not \equal{} \emptyset$ for all $ A,B\in F$. Determine the maximum possible number of elements in $ F$.

How many ways are there to place $31$ knights in the cells of an $8 \times 8$ unit grid so that no two attack one another? (A knight attacks another knight if the distance between the centers of their cells is exactly $\sqrt5$.)

In a particular European city, there are only $7$ day tickets and $30$ day tickets to the public transport. The former costs $7.03$ euro and the latter costs $30$ euro. Aina the Algebraist decides to buy at once those tickets that she can travel by the public transport the whole three year (2014-2016, 1096 days) visiting in the city. What is the cheapest solution?

[u]Set 1[/u] [b]B1.[/b] Evaluate $2 + 0 - 2 \times 0$. [b]B2.[/b] It takes four painters four hours to paint four houses. How many hours does it take forty painters to paint forty houses? [b]B3.[/b] Let $a$ be the answer to this question. What is $\frac{1}{2-a}$? [u]Set 2[/u] [b]B4.[/b] Every day at Andover is either sunny or rainy. If today is sunny, there is a $60\%$ chance that tomorrow is sunny and a $40\%$ chance that tomorrow is rainy. On the other hand, if today is rainy, there is a $60\%$ chance that tomorrow is rainy and a $40\%$ chance that tomorrow is sunny. Given that today is sunny, the probability that the day after tomorrow is sunny can be expressed as n%, where n is a positive integer. What is $n$? [b]B5.[/b] In the diagram below, what is the value of $\angle DD'Y$ in degrees? [img]https://cdn.artofproblemsolving.com/attachments/0/8/6c966b13c840fa1885948d0e4ad598f36bee9d.png[/img] [b]B6.[/b] Christina, Jeremy, Will, and Nathan are standing in a line. In how many ways can they be arranged such that Christina is to the left of Will and Jeremy is to the left of Nathan? Note: Christina does not have to be next to Will and Jeremy does not have to be next to Nathan. For example, arranging them as Christina, Jeremy, Will, Nathan would be valid. [u]Set 3[/u] [b]B7.[/b] Let $P$ be a point on side $AB$ of square $ABCD$ with side length $8$ such that $PA = 3$. Let $Q$ be a point on side $AD$ such that $P Q \perp P C$. The area of quadrilateral $PQDB$ can be expressed in the form $m/n$ for relatively prime positive integers $m$ and $n$. Compute $m + n$. [b]B8.[/b] Jessica and Jeffrey each pick a number uniformly at random from the set $\{1, 2, 3, 4, 5\}$ (they could pick the same number). If Jessica’s number is $x$ and Jeffrey’s number is $y$, the probability that $x^y$ has a units digit of $1$ can be expressed as $m/n$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [b]B9.[/b] For two points $(x_1, y_1)$ and $(x_2, y_2)$ in the plane, we define the taxicab distance between them as $|x_1 - x_2| + |y_1 - y_2|$. For example, the taxicab distance between $(-1, 2)$ and $(3,\sqrt2)$ is $6-\sqrt2$. What is the largest number of points Nathan can find in the plane such that the taxicab distance between any two of the points is the same? [u]Set 4[/u] [b]B10.[/b] Will wants to insert some × symbols between the following numbers: $$1\,\,\,2\,\,\,3\,\,\,4\,\,\,6$$ to see what kinds of answers he can get. For example, here is one way he can insert $\times$ symbols: $$1 \times 23 \times 4 \times 6 = 552.$$ Will discovers that he can obtain the number $276$. What is the sum of the numbers that he multiplied together to get $276$? [b]B11.[/b] Let $ABCD$ be a parallelogram with $AB = 5$, $BC = 3$, and $\angle BAD = 60^o$ . Let the angle bisector of $\angle ADC$ meet $AC$ at $E$ and $AB$ at $F$. The length $EF$ can be expressed as $m/n$, where $m$ and $n$ are relatively prime positive integers. What is $m + n$? [b]B12.[/b] Find the sum of all positive integers $n$ such that $\lfloor \sqrt{n^2 - 2n + 19} \rfloor = n$. Note: $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$. [u]Set 5[/u] [b]B13.[/b] This year, February $29$ fell on a Saturday. What is the next year in which February $29$ will be a Saturday? [b]B14.[/b] Let $f(x) = \frac{1}{x} - 1$. Evaluate $$f\left( \frac{1}{2020}\right) \times f\left( \frac{2}{2020}\right) \times f\left( \frac{3}{2020}\right) \times \times ... \times f\left( \frac{2019}{2020}\right) .$$ [b]B15.[/b] Square $WXYZ$ is inscribed in square $ABCD$ with side length $1$ such that $W$ is on $AB$, $X$ is on $BC$, $Y$ is on $CD$, and $Z$ is on $DA$. Line $W Y$ hits $AD$ and $BC$ at points $P$ and $R$ respectively, and line $XZ$ hits $AB$ and $CD$ at points $Q$ and $S$ respectively. If the area of $WXYZ$ is $\frac{13}{18}$ , then the area of $PQRS$ can be expressed as $m/n$ for relatively prime positive integers $m$ and $n$. What is $m + n$? PS. You had better use hide for answers. Last sets have been posted [url=https://artofproblemsolving.com/community/c4h2777424p24371574]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

We are given $3n$ points $A_1,A_2, \ldots , A_{3n}$ in the plane, no three of them collinear. Prove that one can construct $n$ disjoint triangles with vertices at the points $A_i.$

[b]p1.[/b] Compute $2020 \cdot \left( 2^{(0\cdot1)} + 9 - \frac{(20^1)}{8}\right)$. [b]p2.[/b] Nathan has five distinct shirts, three distinct pairs of pants, and four distinct pairs of shoes. If an “outfit” has a shirt, pair of pants, and a pair of shoes, how many distinct outfits can Nathan make? [b]p3.[/b] Let $ABCD$ be a rhombus such that $\vartriangle ABD$ and $\vartriangle BCD$ are equilateral triangles. Find the angle measure of $\angle ACD$ in degrees. [b]p4.[/b] Find the units digit of $2019^{2019}$. [b]p5.[/b] Determine the number of ways to color the four vertices of a square red, white, or blue if two colorings that can be turned into each other by rotations and reflections are considered the same. [b]p6.[/b] Kathy rolls two fair dice numbered from $1$ to $6$. At least one of them comes up as a $4$ or $5$. Compute the probability that the sumof the numbers of the two dice is at least $10$. [b]p7.[/b] Find the number of ordered pairs of positive integers $(x, y)$ such that $20x +19y = 2019$. [b]p8.[/b] Let $p$ be a prime number such that both $2p -1$ and $10p -1$ are prime numbers. Find the sum of all possible values of $p$. [b]p9.[/b] In a square $ABCD$ with side length $10$, let $E$ be the intersection of $AC$ and $BD$. There is a circle inscribed in triangle $ABE$ with radius $r$ and a circle circumscribed around triangle $ABE$ with radius $R$. Compute $R -r$ . [b]p10.[/b] The fraction $\frac{13}{37 \cdot 77}$ can be written as a repeating decimal $0.a_1a_2...a_{n-1}a_n$ with $n$ digits in its shortest repeating decimal representation. Find $a_1 +a_2 +...+a_{n-1}+a_n$. [b]p11.[/b] Let point $E$ be the midpoint of segment $AB$ of length $12$. Linda the ant is sitting at $A$. If there is a circle $O$ of radius $3$ centered at $E$, compute the length of the shortest path Linda can take from $A$ to $B$ if she can’t cross the circumference of $O$. [b]p12.[/b] Euhan and Minjune are playing tennis. The first one to reach $25$ points wins. Every point ends with Euhan calling the ball in or out. If the ball is called in, Minjune receives a point. If the ball is called out, Euhan receives a point. Euhan always makes the right call when the ball is out. However, he has a $\frac34$ chance of making the right call when the ball is in, meaning that he has a $\frac14$ chance of calling a ball out when it is in. The probability that the ball is in is equal to the probability that the ball is out. If Euhan won, determine the expected number of wrong callsmade by Euhan. [b]p13.[/b] Find the number of subsets of $\{1, 2, 3, 4, 5, 6,7\}$ which contain four consecutive numbers. [b]p14.[/b] Ezra and Richard are playing a game which consists of a series of rounds. In each round, one of either Ezra or Richard receives a point. When one of either Ezra or Richard has three more points than the other, he is declared the winner. Find the number of games which last eleven rounds. Two games are considered distinct if there exists a round in which the two games had different outcomes. [b]p15.[/b] There are $10$ distinct subway lines in Boston, each of which consists of a path of stations. Using any $9$ lines, any pair of stations are connected. However, among any $8$ lines there exists a pair of stations that cannot be reached from one another. It happens that the number of stations is minimized so this property is satisfied. What is the average number of stations that each line passes through? [b]p16.[/b] There exist positive integers $k$ and $3\nmid m$ for which $$1 -\frac12 + \frac13 - \frac14 +...+ \frac{1}{53}-\frac{1}{54}+\frac{1}{55}=\frac{3^k \times m}{28\times 29\times ... \times 54\times 55}.$$ Find the value $k$. [b]p17.[/b] Geronimo the giraffe is removing pellets from a box without replacement. There are $5$ red pellets, $10$ blue pellets, and $15$ white pellets. Determine the probability that all of the red pellets are removed before all the blue pellets and before all of the white pellets are removed. [b]p18.[/b] Find the remainder when $$70! \left( \frac{1}{4 \times 67}+ \frac{1}{5 \times 66}+...+ \frac{1}{66\times 5}+ \frac{1}{67\times 4} \right)$$ is divided by $71$. [b]p19.[/b] Let $A_1A_2...A_{12}$ be the regular dodecagon. Let $X$ be the intersection of $A_1A_2$ and $A_5A_{11}$. Given that $X A_2 \cdot A_1A_2 = 10$, find the area of dodecagon. [b]p20.[/b] Evaluate the following infinite series: $$\sum^{\infty}_{n=1}\sum^{\infty}_{m=1} \frac{n \sec^2m -m \tan^2 n}{3^{m+n}(m+n)}$$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The Tokyo Metro system is one of the most efficient in the world. There is some odd positive integer $k$ such that each metro line passes through exactly $k$ stations, and each station is serviced by exactly $k$ metro lines. One can get from any station to any otherstation using only one metro line - but this connection is unique. Furthermore, any two metro lines must share exactly one station. David is planning an excursion for the IMO team, and wants to visit a set $S$ of $k$ stations. He remarks that no three of the stationsin $S$ are on a common metro line. Show that there is some station not in $S$, which is connected to every station in $S$ by a different metro line.

In a $12\times 12$ square table some stones are placed in the cells with at most one stone per cell. If the number of stones on each line, column, and diagonal is even, what is the maximum number of the stones? [b]Note[/b]. Each diagonal is parallel to one of two main diagonals of the table and consists of $1,2\ldots,11$ or $12$ cells.

In the beginning, there are $100$ cards on the table, and each card has a positive integer written on it. An odd number is written on exactly $43$ cards. Every minute, the following operation is performed: for all possible sets of $3$ cards on the table, the product of the numbers on these three cards is calculated, all the obtained results are summed, and this sum is written on a new card and placed on the table. A day later, it turns out that there is a card on the table, the number written on this card is divisible by $2^{2018}.$ Prove that one hour after the start of the process, there was a card on the table that the number written on that card is divisible by $2^{2018}.$

Let $n$ be a positive integer. We know that the set $I_n = \{ 1, 2,\ldots , n\}$ has exactly $2^n$ subsets, so there are $8^n$ ordered triples $(A, B, C)$, where $A, B$, and $C$ are subsets of $I_n$. For each of these triples we consider the number $\mid A \cap B \cap C\mid$. Prove that the sum of the $8^n$ numbers considered is a multiple of $n$. Clarification: $\mid Y\mid$ denotes the number of elements in the set $Y$.

A city has $4$ horizontal and $n\geq3$ vertical boulevards which intersect at $4n$ crossroads. The crossroads divide every horizontal boulevard into $n-1$ streets and every vertical boulevard into $3$ streets. The mayor of the city decides to close the minimum possible number of crossroads so that the city doesn't have a closed path(this means that starting from any street and going only through open crossroads without turning back you can't return to the same street). $a)$Prove that exactly $n$ crossroads are closed. $b)$Prove that if from any street you can go to any other street and none of the $4$ corner crossroads are closed then exactly $3$ crossroads on the border are closed(A crossroad is on the border if it lies either on the first or fourth horizontal boulevard, or on the first or the n-th vertical boulevard).

Find the maximal number of points, such that there exist a configuration of $2023$ lines on the plane, with each lines pass at least $2$ points.

Suppose $n$ lines in plane are such that no two are parallel and no three are concurrent. For each two lines their angle is a real number in $[0,\frac{\pi}2]$. Find the largest value of the sum of the $\binom n2$ angles between line. [i]By Aliakbar Daemi[/i]

a) Prove the existence of two infinite sets $A$ and $B$, not necessarily disjoint, of non-negative integers such that each non-negative integer $n$ is uniquely representable in the form $n=a+b$ with $a\in A,b\in B$. b) Prove that for each such pair $(A,B)$, either $A$ or $B$ contains only multiples of some integer $k>1$.

Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\dots a_n$ of the sequence $1$, $2$, $\dots$ , $n$ satisfying $$a_1 \le 2a_2\le 3a_3 \le \dots \le na_n$$. Proposed by United Kingdom

Greedy goblin Griphook has a regular $2000$-gon, whose every vertex has a single coin. In a move, he chooses a vertex, removes one coin each from the two adjacent vertices, and adds one coin to the chosen vertex, keeping the remaining coin for himself. He can only make such a move if both adjacent vertices have at least one coin. Griphook stops only when he cannot make any more moves. What is the maximum and minimum number of coins he could have collected? [i]Proposed by Pranjal Srivastava and Rohan Goyal[/i]

Let n be a natural number. Let $A_1, A_2, . . . , A_k$ be distinct $3$-element subsets of $\{1, 2, . . . , n\}$ such that $|A_i \cap A_j | \ne 1$ for all $1 \le i, j \le k$. Determine all $n$ for which there are $n$ such that these subsets exist. [hide=original wording of last sentence]Bestimme alle n, fur die es n solche Teilmengen gibt.[/hide]

Peter has $2022$ pieces of magnetic railroad cars, which are of two types: some have the front with north and the rear with south magnetic polarity, and some have the rear with north and the rear with south magnetic polarity (on these railroad cars the front and the rear can be distinguished). Peter wants to decide whether there is the same number of both types of cars. He can try to fit together two cars in one try. What is the least number of tries needed? [i]Proposed by Dömötör Pálvölgyi, Budapest[/i]

A box contains 900 cards numbered from 100 to 999. Cards are drawn randomly, one at a time, without replacement, and the sum of their digits is recorded. What is the minimum number of cards that must be drawn to guarantee that at least three of these sums are the same?

A kingdom consists of $12$ cities located on a one-way circular road. A magician comes on the $13$th of every month to cast spells. He starts at the city which was the 5th down the road from the one that he started at during the last month (for example, if the cities are numbered $1–12$ clockwise, and the direction of travel is clockwise, and he started at city #$9$ last month, he will start at city #$2$ this month). At each city that he visits, the magician casts a spell if the city is not already under the spell, and then moves on to the next city. If he arrives at a city which is already under the spell, then he removes the spell from this city, and leaves the kingdom until the next month. Last Thanksgiving the capital city was free of the spell. Prove that it will be free of the spell this Thanksgiving as well.

Let $6$ pairwise different digits are given and all of them are different from $0$. Prove that there exist $2$ six-digit integers, such that their difference is equal to $9$ and each of them contains all given $6$ digits.

Let $AB$ be a segment of a plane. Is it possible to paint the plane in $2009$ colors in such a way that both of the following conditions are satisfied? 1) Every two points of the same color can be connected by a polygonal line. 2) For any point $C$ of $AB$, every $n \in N$ and every $k\in \{1,2,3,...,2009\}$ , there exists a point $D$, painted in $k$-th color such that the length of $CD$ is less than $0,0...01$, where all the zeros after the decimal point are exactly $n$.