The World Cup, featuring $17$ teams from Europe and South America, as well as $15$ other teams that honestly don’t have a chance, is a soccer tournament that is held once every four years. As we speak, Croatia andMorocco are locked in a battle that has no significance whatsoever on the winner, but if you would like live score updates nonetheless, feel free to ask your proctor, who has no obligation whatsoever to provide them. [b]p1.[/b] During the group stage of theWorld Cup, groups of $4$ teams are formed. Every pair of teams in a group play each other once. Each team earns $3$ points for each win and $1$ point for each tie. Find the greatest possible sum of the points of each team in a group. [b]p2.[/b] In the semi-finals of theWorld Cup, the ref is bad and lets $11^2 = 121$ players per team go on the field at once. For a given team, one player is a goalie, and every other player is either a defender, midfielder, or forward. There is at least one player in each position. The product of the number of defenders, midfielders, and forwards is a mulitple of $121$. Find the number of ordered triples (number of defenders, number of midfielders, number of forwards) that satisfy these conditions. [b]p3.[/b] Messi is playing in a game during the Round of $16$. On rectangular soccer field $ABCD$ with $AB = 11$, $BC = 8$, points $E$ and $F$ are on segment $BC$ such that $BE = 3$, $EF = 2$, and $FC = 3$. If the distance betweenMessi and segment $EF$ is less than $6$, he can score a goal. The area of the region on the field whereMessi can score a goal is $a\pi +\sqrt{b} +c$, where $a$, $b$, and $c$ are integers. Find $10000a +100b +c$. [b]p4.[/b] The workers are building theWorld Cup stadium for the $2022$ World Cup in Qatar. It would take 1 worker working alone $4212$ days to build the stadium. Before construction started, there were 256 workers. However, each day after construction, $7$ workers disappear. Find the number of days it will take to finish building the stadium. [b]p5.[/b] In the penalty kick shootout, $2$ teams each get $5$ attempts to score. The teams alternate shots and the team that scores a greater number of times wins. At any point, if it’s impossible for one team to win, even before both teams have taken all $5$ shots, the shootout ends and nomore shots are taken. If each team does take all $5$ shots and afterwards the score is tied, the shootout enters sudden death, where teams alternate taking shots until one team has a higher score while both teams have taken the same number of shots. If each shot has a $\frac12$ chance of scoring, the expected number of times that any team scores can be written as $\frac{A}{B}$ for relatively prime positive integers $A$ and $B$. Find $1000A+B$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] Alan leaves home when the clock in his cardboard box says $7:35$ AM and his watch says $7:41$ AM. When he arrives at school, his watch says $7:47$ AM and the $7:45$ AM bell rings. Assuming the school clock, the watch, and the home clock all go at the same rate, how many minutes behind the school clock is the home clock? [b]p2.[/b] Compute $$\left( \frac{2012^{2012-2013} + 2013}{2013} \right) \times 2012.$$ Express your answer as a mixed number. [b]p3.[/b] What is the last digit of $$2^{3^{4^{5^{6^{7^{8^{9^{...^{2013}}}}}}}}} ?$$ [b]p4.[/b] Let $f(x)$ be a function such that $f(ab) = f(a)f(b)$ for all positive integers $a$ and $b$. If $f(2) = 3$ and $f(3) = 4$, find $f(12)$. [b]p5.[/b] Circle $X$ with radius $3$ is internally tangent to circle $O$ with radius $9$. Two distinct points $P_1$ and $P_2$ are chosen on $O$ such that rays $\overrightarrow{OP_1}$ and $\overrightarrow{OP_2}$ are tangent to circle $X$. What is the length of line segment $P_1P_2$? [b]p6.[/b] Zerglings were recently discovered to use the same $24$-hour cycle that we use. However, instead of making $12$-hour analog clocks like humans, Zerglings make $24$-hour analog clocks. On these special analog clocks, how many times during $ 1$ Zergling day will the hour and minute hands be exactly opposite each other? [b]p7.[/b] Three Small Children would like to split up $9$ different flavored Sweet Candies evenly, so that each one of the Small Children gets $3$ Sweet Candies. However, three blind mice steal one of the Sweet Candies, so one of the Small Children can only get two pieces. How many fewer ways are there to split up the candies now than there were before, assuming every Sweet Candy is different? [b]p8.[/b] Ronny has a piece of paper in the shape of a right triangle $ABC$, where $\angle ABC = 90^o$, $\angle BAC = 30^o$, and $AC = 3$. Holding the paper fixed at $A$, Ronny folds the paper twice such that after the first fold, $\overline{BC}$ coincides with $\overline{AC}$, and after the second fold, $C$ coincides with $A$. If Ronny initially marked $P$ at the midpoint of $\overline{BC}$, and then marked $P'$ as the end location of $P$ after the two folds, find the length of $\overline{PP'}$ once Ronny unfolds the paper. [b]p9.[/b] How many positive integers have the same number of digits when expressed in base $3$ as when expressed in base $4$? [b]p10.[/b] On a $2 \times 4$ grid, a bug starts at the top left square and arbitrarily moves north, south, east, or west to an adjacent square that it has not already visited, with an equal probability of moving in any permitted direction. It continues to move in this way until there are no more places for it to go. Find the expected number of squares that it will travel on. Express your answer as a mixed number. PS. You had better use hide for answers.

Mykolka the numismatist possesses $241$ coins, each worth an integer number of turgiks. The total value of the coins is $360$ turgiks. Is it necessarily true that the coins can be divided into three groups of equal total value?

Consider a $N\times N$ square board where $N\geq 3$ is an odd integer. The caterpillar Carl sits at the center of the square; all other cells contain distinct positive integers. An integer $n$ weights $1\slash n$ kilograms. Carl wants to leave the board but can eat at most $2$ kilograms. Determine whether Carl can always find a way out when a) $N=2003.$ b) $N$ is an arbitrary odd integer.

Let $n>1$ be a positive integer. Claire writes $n$ distinct positive real numbers $x_1, x_2, \dots, x_n$ in a row on a blackboard. In a $\textit{move},$ William can erase a number $x$ and replace it with either $\tfrac{1}{x}$ or $x+1$ at the same location. His goal is to perform a sequence of moves such that after he is done, the number are strictly increasing from left to right. [list] [*]Prove that there exists a positive constant $A,$ independent of $n,$ such that William can always reach his goal in at most $An \log n$ moves. [*]Prove that there exists a positive constant $B,$ independent of $n,$ such that Claire can choose the initial numbers such that William cannot attain his goal in less than $Bn \log n$ moves. [/list]

[u]Round 1[/u] [b]p1.[/b] Solve the maze [img]https://cdn.artofproblemsolving.com/attachments/8/c/6439816a52b5f32c3cb415e2058556edb77c80.png[/img] [b]p2.[/b] Billiam can write a problem in $30$ minutes, Jerry can write a problem in $10$ minutes, and Evin can write a problem in $20$ minutes. Billiam begins writing problems alone at $3:00$ PM until Jerry joins himat $4:00$ PM, and Evin joins both of them at $4:30$ PM. Given that they write problems until the end of math team at $5:00$ PM, how many full problems have they written in total? [b]p3.[/b] How many pairs of positive integers $(n,k)$ are there such that ${n \choose k}= 6$? [u]Round 2 [/u] [b]p4.[/b] Find the sumof all integers $b > 1$ such that the expression of $143$ in base $b$ has an even number of digits and all digits are the same. [b]p5.[/b] Ιni thinks that $a \# b = a^2 - b$ and $a \& b = b^2 - a$, while Mimi thinks that $a \# b = b^2 - a$ and $a \& b = a^2 - b$. Both Ini and Mimi try to evaluate $6 \& (3 \# 4)$, each using what they think the operations $\&$ and $\#$ mean. What is the positive difference between their answers? [b]p6.[/b] A unit square sheet of paper lies on an infinite grid of unit squares. What is the maximum number of grid squares that the sheet of paper can partially cover at once? A grid square is partially covered if the area of the grid square under the sheet of paper is nonzero - i.e., lying on the edge only does not count. [u]Round 3[/u] [b]p7.[/b] Maya wants to buy lots of burgers. A burger without toppings costs $\$4$, and every added topping increases the price by 50 cents. There are 5 different toppings for Maya to choose from, and she can put any combination of toppings on each burger. How much would it cost forMaya to buy $1$ burger for each distinct set of toppings? Assume that the order in which the toppings are stacked onto the burger does not matter. [b]p8.[/b] Consider square $ABCD$ and right triangle $PQR$ in the plane. Given that both shapes have area $1$, $PQ =QR$, $PA = RB$, and $P$, $A$, $B$ and $R$ are collinear, find the area of the region inside both square $ABCD$ and $\vartriangle PQR$, given that it is not $0$. [b]p9.[/b] Find the sum of all $n$ such that $n$ is a $3$-digit perfect square that has the same tens digit as $\sqrt{n}$, but that has a different ones digit than $\sqrt{n}$. [u]Round 4[/u] [b]p10.[/b] Jeremy writes the string: $$LMTLMTLMTLMTLMTLMT$$ on a whiteboard (“$LMT$” written $6$ times). Find the number of ways to underline $3$ letters such that from left to right the underlined letters spell LMT. [b]p11.[/b] Compute the remainder when $12^{2022}$ is divided by $1331$. [b]p12.[/b] What is the greatest integer that cannot be expressed as the sum of $5$s, $23$s, and $29$s? [u]Round 5 [/u] [b]p13.[/b] Square $ABCD$ has point $E$ on side $BC$, and point $F$ on side $CD$, such that $\angle EAF = 45^o$. Let $BE = 3$, and $DF = 4$. Find the length of $FE$. [b]p14.[/b] Find the sum of all positive integers $k$ such that $\bullet$ $k$ is the power of some prime. $\bullet$ $k$ can be written as $5654_b$ for some $b > 6$. [b]p15.[/b] If $\sqrt[3]{x} + \sqrt[3]{y} = 2$ and $x + y = 20$, compute $\max \,(x, y)$. PS. You should use hide for answers. Rounds 6-9 have been posted [url=https://artofproblemsolving.com/community/c3h3167372p28825861]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

How many one-to-one functions $f : \{1, 2, \cdots, 9\} \rightarrow \{1, 2, \cdots, 9\}$ satisfy (i) and (ii)? (i) $f(1)>f(2)$, $f(9)<9$. (ii) For each $i=3, 4, \cdots, 8$, if $f(1), \cdots, f(i-1)$ are smaller than $f(i)$, then $f(i+1)$ is also smaller than $f(i)$.

Let $r$ and $b$ be positive integers. The game of [i]Monis[/i], a variant of Tetris, consists of a single column of red and blue blocks. If two blocks of the same color ever touch each other, they both vanish immediately. A red block falls onto the top of the column exactly once every $r$ years, while a blue block falls exactly once every $b$ years. (a) Suppose that $r$ and $b$ are odd, and moreover the cycles are offset in such a way that no two blocks ever fall at exactly the same time. Consider a period of $rb$ years in which the column is initially empty. Determine, in terms of $r$ and $b$, the number of blocks in the column at the end. (b) Now suppose $r$ and $b$ are relatively prime and $r+b$ is odd. At time $t=0$, the column is initially empty. Suppose a red block falls at times $t = r, 2r, \dots, (b-1)r$ years, while a blue block falls at times $t = b, 2b, \dots, (r-1)b$ years. Prove that at time $t=rb$, the number of blocks in the column is $\left\lvert 1+2(r-1)(b+r)-8S \right\rvert$, where \[ S = \left\lfloor \frac{2r}{r+b} \right\rfloor + \left\lfloor \frac{4r}{r+b} \right\rfloor + ... + \left\lfloor \frac{(r+b-1)r}{r+b} \right\rfloor . \] [i]Proposed by Sammy Luo[/i]

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}{}.$

Can ten distinct numbers $a_1, a_2, b_1, b_2, b_3, c_1, c_2, d_1, d_2, d_3$ be chosen from $\{0, 1, 2, \ldots, 14\}$, so that the $14$ differences $|a_1 - b_1|$, $|a_1 - b_2|$, $|a_1 - b_3|$, $|a_2 - b_1|$, $|a_2 - b_2|$, $|a_2 - b_3|$, $|c_1 - d_1|$, $|c_1 - d_2|$, $|c_1 - d_3|$, $|c_2 - d_1|$, $|c_2 - d_2|$, $|c_2 - d_3|$, $|a_1 - c_1|$, and $|a_2 - c_2|$ are all distinct?

Let $S$ be a circle, and $\alpha =\{A_1,\ldots ,A_n\}$ a family of open arcs in $S$. Let $N(\alpha )=n$ denote the number of elements in $\alpha$. We say that $\alpha$ is a covering of $S$ if $\bigcup_{k=1}^n A_k\supset S$. Let $\alpha=\{A_1,\ldots ,A_n\}$ and $\beta =\{B_1,\ldots ,B_m\}$ be two coverings of $S$. Show that we can choose from the family of all sets $A_i\cap B_j,\ i=1,2,\ldots ,n,\ j=1, 2,\ldots ,m,$ a covering $\gamma$ of $S$ such that $N(\gamma )\le N(\alpha)+N(\beta)$.

Mr. Murgatroyd decides to throw his class a pizza party, but he's going to make them hunt for it first. He chooses eleven locations in the school, which we'll call $1, 2, \ldots, 11$. His plan is to tell students to start at location $1$, and at each location $n$ from $1$ to $10$, they will find a message directing them to go to location $n+1$; at location $11$, there's pizza! Mr. Murgatroyd sends his teaching assistant to post the ten messages in locations $1$ to $10$. Unfortunately, the assistant jumbles up the message cards at random before posting them. If the students begin at location $1$ as planned and follow the directions at each location, show that they will still get to the pizza.

Consider \(n^2\) unit squares in the \(xy\) plane centered at point \((i,j)\) with integer coordinates, \(1 \leq i \leq n\), \(1 \leq j \leq n\). It is required to colour each unit square in such a way that whenever \(1 \leq i < j \leq n\) and \(1 \leq k < l \leq n\), the three squares with centres at \((i,k),(j,k),(j,l)\) have distinct colours. What is the least possible number of colours needed?

Let $G$ be a simple, undirected, connected graph with $100$ vertices and $2013$ edges. It is given that there exist two vertices $A$ and $B$ such that it is not possible to reach $A$ from $B$ using one or two edges. We color all edges using $n$ colors, such that for all pairs of vertices, there exists a way connecting them with a single color. Find the maximum value of $n$.

Prove that the squares with sides $\frac{1}{1}, \frac{1}{2}, \frac{1}{3},\ldots$ may be put into the square with side $\frac{3}{2} $ in such a way that no two of them have any interior point in common.

In a text editor program, initially there is a footprint symbol (L) that we want to multiply. Unfortunately, our computer has been the victim of a hacker attack, and only two functions are working: Copy and Paste, each costing 1 Dürer dollar to use. Using the Copy function, we can select one or more consecutive symbols from the existing ones, and the computer memorizes their number. When using the Paste function, the computer adds as many new footprint symbols to the sequence as were selected in the last Copy. If no Copy has been done yet, Paste cannot be used. Let $D(n)$ denote the minimum number of Dürer dollars required to obtain exactly $n$ footprint symbols. Prove that for any positive integer $k$, there exists a positive integer $N$ such that \[D(N)=D(N+1)+1=D(N+2)=D(N+3)+1=D(N+4)=\ldots=D(N+2k-1)+1=D(N+2k).\] [i]Based on a problem of the Dürer Competition[/i]

The maximum possible number of knights are placed on a $5 \times 5$ chessboard so that no two attack each other. Prove that there is only one possible placement. (A Kanel)

Pasha and Vova play the game crossing out the cells of the $3\times 101$ board by turns. At the start, the central cell is crossed out. By one move the player chooses the diagonal (there can be $1, 2$ or $3$ cells in the diagonal) and crosses out cells of this diagonal which are still uncrossed. At least one new cell must be crossed out by any player's move. Pasha begins, the one who can not make any move loses. Who has a winning strategy?

On a board there are $n$ nails, each two connected by a rope. Each rope is colored in one of $n$ given distinct colors. For each three distinct colors, there exist three nails connected with ropes of these three colors. a) Can $n$ be $6$ ? b) Can $n$ be $7$ ?

Let $S=\{(x,y)| x,y\in \mathbb{Q} , 0\le x,y\le 1\}$, where $\mathbb{Q}$ is the set of all rational numbers. Given a set of lines and a set of marked points in $S$, Euclid can do one of two moves: (i) Draw a line connecting two marked points, or (ii) Mark a point in $S$ which lies on at least two drawn lines. At first, the five distinct points $A(0,0), B(1,0), C(1,1), D(0,1)$ and $P\in S$ are marked. Find all such points $P$ such that Euclid can mark any point in $S$ after finitely many moves. [i]Glen Lim[/i]

Let $X$ be an $n$-element set and let $A_1,\ldots ,A_m$ be subsets of $X$ such that i) $|A_i|=3$ for each $i=1,\ldots ,m$. ii) $|A_i\cap A_j|\le 1$ for any two distinct indices $i,j$. Show that there exists a subset of $X$ with at least $\lfloor\sqrt{2n}\rfloor$ elements which does not contain any of the $A_i$’s.

There are $ n^2$ students in a class. Each week all the students participate in a table quiz. Their teacher arranges them into $ n$ teams of $ n$ players each. For as many weeks as possible, this arrangement is done in such a way that any pair of students who were members of the same team one week are not in the same team in subsequent weeks. Prove that after at most $ n\plus{}2$ weeks, it is necessary for some pair of students to have been members of the same team in at least two different weeks.

$2000$ lines are set on the plane. Prove that among them there are two such that have the same number of different intersection points with the rest of the lines.

Let $a_1, a_2, \ldots, a_n$ be $n$ positive integers, and let $b_1, b_2, \ldots, b_m$ be $m$ positive integers such that $a_1 a_2 \cdots a_n = b_1 b_2 \cdots b_m$. Prove that a rectangular table with $n$ rows and $m$ columns can be filled with positive integer entries in such a way that * the product of the entries in the $i$-th row is $a_i$ (for each $i \in \left\{1,2,\ldots,n\right\}$); * the product of the entries in the $j$-th row is $b_j$ (for each $i \in \left\{1,2,\ldots,m\right\}$).

Inside a square of side $16$ are placed $1000$ points. Show that it is possible to put a equilateral triangle of side $2\sqrt3$ in the plane so that it covers at least $16$ of these points.