How many functions $f:\{1,2,3, \ldots, 7\} \rightarrow \{1,2,3, \ldots, 7\}$ are there such that the set $\mathcal{F} = \{f(i) : i\in\{1,\ldots, 7\}\}$ has cardinality four, while the set $\mathcal{G} = \{f(f(f(i))) : i\in\{1,\ldots, 7\}\}$ consists of a single element? [i]Proposed by Sam Delatore[/i]

A sequence of $28$ letters consists of $14$ of each of the letters $A$ and $B$ arranged in random order. The expected number of times that $ABBA$ appears as four consecutive letters in that sequence is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

[u]Round 5[/u] [b]p13.[/b] Two concentric circles have radii $1$ and $3$. Compute the length of the longest straight line segment that can be drawn froma point on the circle of radius $1$ to a point on the circle of radius $3$ if the segment cannot intersect the circle of radius $1$. [b]p14.[/b] Find the value of $\frac{1}{3} + \frac29+\frac{3}{27}+\frac{4}{81}+\frac{5}{243}+...$ [b]p15.[/b] Bob is trying to type the word "welp". However, he has a $18$ chance ofmistyping each letter and instead typing one of four adjacent keys, each with equal probability. Find the probability that he types "qelp" instead of "welp". [u]Round 6[/u] [b]p16.[/b] How many ways are there to tile a $2\times 12$ board using an unlimited supply of $1\times 1$ and $1\times 3$ pieces? [b]p17.[/b] Jeffrey and Yiming independently choose a number between $0$ and $1$ uniformly at random. What is the probability that their two numbers can formthe sidelengths of a triangle with longest side of length $1$? [b]p18.[/b] On $\vartriangle ABC$ with $AB = 12$ and $AC = 16$, let $M$ be the midpoint of $BC$ and $E$,$F$ be the points such that $E$ is on $AB$, $F$ is on $AC$, and $AE = 2AF$. Let $G$ be the intersection of $EF$ and $AM$. Compute $\frac{EG}{GF}$ . [u]Round 7[/u] [b]p19.[/b] Find the remainder when $2019x^{2019} -2018x^{2018}+ 2017x^{2017}-...+x$ is divided by $x +1$. [b]p20.[/b] Parallelogram $ABCD$ has $AB = 5$, $BC = 3$, and $\angle ABC = 45^o$. A line through C intersects $AB$ at $M$ and $AD$ at $N$ such that $\vartriangle BCM$ is isosceles. Determine the maximum possible area of $\vartriangle MAN$. [b]p21[/b]. Determine the number of convex hexagons whose sides only lie along the grid shown below. [img]https://cdn.artofproblemsolving.com/attachments/2/9/93cf897a321dfda282a14e8f1c78d32fafb58d.png[/img] [u]Round 8[/u] [b]p22.[/b] Let $\vartriangle ABC$ be a triangle with side lengths $AB = 4$, $BC = 5$, and $C A = 6$. Extend ray $\overrightarrow{AB}$ to a point $D$ such that $AD = 12$, and similarly extend ray $\overrightarrow{CB}$ to point $E$ such that $CE = 15$. Let $M$ and $N$ be points on the circumcircles of $ABC$ and $DBE$, respectively, such that line $MN$ is tangent to both circles. Determine the length of $MN$. [b]p23.[/b] A volcano will erupt with probability $\frac{1}{20-n}$ if it has not erupted in the last $n$ years. Determine the expected number of years between consecutive eruptions. [b]p24.[/b] If $x$ and $y$ are integers such that $x+ y = 9$ and $3x^2+4x y = 128$, find $x$. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3165997p28809441]here [/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3166099p28810427]here[/url].Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Elmo has 2023 cookie jars, all initially empty. Every day, he chooses two distinct jars and places a cookie in each. Every night, Cookie Monster finds a jar with the most cookies and eats all of them. If this process continues indefinitely, what is the maximum possible number of cookies that the Cookie Monster could eat in one night? [i]Proposed by Espen Slettnes[/i]

Let $n\ge 2$ be a positive integer, and consider an $n\times n$ grid of $n^2$ equilateral triangles. Two triangles are adjacent if they share at least one vertex. Each triangle is colored red or blue, splitting the grid into regions. Find, with proof, the minimum number of triangles in the largest region. [i]Rohan Bodke[/i]

Given two positive integers $n$ and $m$ and a function $f : \mathbb{Z} \times \mathbb{Z} \to \left\{0,1\right\}$ with the property that \begin{align*} f\left(i, j\right) = f\left(i+n, j\right) = f\left(i, j+m\right) \qquad \text{for all } \left(i, j\right) \in \mathbb{Z} \times \mathbb{Z} . \end{align*} Let $\left[k\right] = \left\{1,2,\ldots,k\right\}$ for each positive integer $k$. Let $a$ be the number of all $\left(i, j\right) \in \left[n\right] \times \left[m\right]$ satisfying \begin{align*} f\left(i, j\right) = f\left(i+1, j\right) = f\left(i, j+1\right) . \end{align*} Let $b$ be the number of all $\left(i, j\right) \in \left[n\right] \times \left[m\right]$ satisfying \begin{align*} f\left(i, j\right) = f\left(i-1, j\right) = f\left(i, j-1\right) . \end{align*} Prove that $a = b$.

Let $[n] = \{1, 2, 3, ... ,n\}$ and for any set $S$, let$ P(S)$ be the set of non-empty subsets of $S$. What is the last digit of $|P(P([2013]))|$?

We have an $n \times n$ square divided into unit squares. Each side of unit square is called unit segment. Some isoceles right triangles of hypotenuse $2$ are put on the square so all their vertices are also vertices of unit squares. For which $n$ it is possible that every unit segment belongs to exactly one triangle(unit segment belongs to a triangle even if it's on the border of the triangle)?

Let $ S$ be a set of all points of a plane whose coordinates are integers. Find the smallest positive integer $ k$ for which there exists a 60-element subset of set $ S$ with the following condition satisfied for any two elements $ A,B$ of the subset there exists a point $ C$ contained in $ S$ such that the area of triangle $ ABC$ is equal to k .

In a $7\times 8$ chessboard, $56$ stones are placed in the squares. Now we have to remove some of the stones such that after the operation, there are no five adjacent stones horizontally, vertically or diagonally. Find the minimal number of stones that have to be removed.

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?

A spacecraft landed on an asteroid. It is known that the asteroid is either a ball or a cube. The rover started its route at the landing site and finished it at the point symmetric to the landing site with respect to the center of the asteroid. On its way, the rover transmitted its spatial coordinates to the spacecraft on the landing site so that the trajectory of the rover movement was known. Can it happen that this information is not suffcient to determine whether the asteroid is a ball or a cube?

$A$ writes, at his choice, $8$ ones and $8$ twos on a $4\times 4$ board. Then $B$ covers the board with $8$ dominoes and for each domino she finds the smaller of the two numbers that that domino covers. Finally, $A$ adds these $8$ numbers and the result is her score. What is the highest score $A$ can secure, no matter how $B$ plays? Clarification: A domino is a $1\times 2$ or $2\times 1$ rectangle that covers exactly two squares on the board.

In each unit cell of a finite set of cells of an infinite checkered board, an integer is written so that the sum of the numbers in each row, as well as in each column, is divided by $2002$. Prove that every number $\alpha$ can be replaced by a certain number $\alpha'$ , divisible by $2002$ so that $|\alpha-\alpha'| <2002$ and the sum of the numbers in all rows, and in all columns will not change.

A table of the type $~$ $ (n_1, n_2, ... , n_m) ,\ n_1 \ge n_2 \ge ... \ge n_m $ $~$ is defined in the following way: $~$ $n_1$ $~$ squares are ordered horizontally one next to another, then $~$ $n_2$ $~$ squares are ordered horizontally beneath the already ordered $~$ $n_1$ $~$ squares. The procedure continues until a net composed of $~$ $n_1$ $~$ squares in the first row, $~$ $n_2$ $~$ in the second, $~$ $n_i$ $~$ in the $~$ $i$-th row is obtained, such that there are totally $~$ $n=n_1+n_2+...+n_m$ $~$ squares in the net. The ordered rows form a straight line on the left, as shown in the example. The obtained table is filled with the numbers from $~$ $1$ $~$ till $~$ $n$ $~$ in a way that the numbers in each row and column become greater from left to right and from top to bottom, respectively. An example of a table of the type $~$ $(5,4,2,1)$ $~$ and one possible way of filling it is attached to the post. Find the number of ways the table of type $~$ $(4,3,2)$ $~$ can be filled.

Natural numbers from $1$ to $400$ are divided in $100$ disjoint sets. Prove that one of the sets contains three numbers which are lengths of a non-degenerate triangle's sides.

Given is an array $A$ of $2n$ numbers, where $n$ is a positive integer. Give an algorithm to create an array $prod$ of length $2n$ where $$prod[i] \, = \, A[i] \times A[i+1] \times \cdots \times A[i+n-1],$$ ($A[x]$ means $A[x \ \text{mod}\ 2n]$) in $O(n)$ time [b]withou[/b]t using division. Assume that all binary arithmetic operations are $O(1)$

There is a safe that can be opened by entering a secret code consisting of $n$ digits, each of them is $0$ or $1$. Initially, $n$ zeros were entered, and the safe is closed (so, all zeros is not the secret code). In one attempt, you can enter an arbitrary sequence of $n$ digits, each of them is $0$ or $1$. If the entered sequence matches the secret code, the safe will open. If the entered sequence matches the secret code in more positions than the previously entered sequence, you will hear a click. In any other cases the safe will remain locked and there will be no click. Find the smallest number of attempts that is sufficient to open the safe in all cases.

There is a rectangular plot of size $1 \times n$. This has to be covered by three types of tiles - red, blue and black. The red tiles are of size $1 \times 1$, the blue tiles are of size $1 \times 1$ and the black tiles are of size $1 \times 2$. Let $t_n$ denote the number of ways this can be done. For example, clearly $t_1 = 2$ because we can have either a red or a blue tile. Also $t_2 = 5$ since we could have tiled the plot as: two red tiles, two blue tiles, a red tile on the left and a blue tile on the right, a blue tile on the left and a red tile on the right, or a single black tile. [list=a] [*]Prove that $t_{2n+1} = t_n(t_{n-1} + t_{n+1})$ for all $n > 1$. [*]Prove that $t_n = \sum_{d \ge 0} \binom{n-d}{d}2^{n-2d}$ for all $n >0$. [/list] Here, \[ \binom{m}{r} = \begin{cases} \dfrac{m!}{r!(m-r)!}, &\text{ if $0 \le r \le m$,} \\ 0, &\text{ otherwise} \end{cases}\] for integers $m,r$.

At each of the given $n$ points on a circle, either $+1$ or $-1$ is written. The following operation is performed: between any two consecutive numbers on the circle their product is written, and the initial $n$ numbers are deleted. Suppose that, for any initial arrangement of $+1$ and $-1$ on the circle, after finitely many operations all the numbers on the circle will be equal to $+1$. Prove that $n$ is a power of two.

p1. Bahri lives quite close to the clock gadang in the city of Bukit Tinggi West Sumatra. Bahri has an antique clock. On Monday $4$th March $2013$ at $10.00$ am, Bahri antique clock is two minutes late in comparison with Clock Tower. A day later, the antique clock was four minutes late compared to the Clock Tower. March $6$, $2013$ the clock is late six minutes compared to Jam Gadang. The following days Bahri observed that his antique clock exhibited the same pattern of delay. On what day and what date in $2014$ the antique Bahri clock (hand short and long hands) point to the same number as the Clock Tower? p2. In one season, the Indonesian Football League is participated by $20$ teams football. Each team competes with every other team twice. The result of each match is $3$ if you win, $ 1$ if you draw, and $0$ if you lose. Every week there are $10$ matches involving all teams. The winner of the competition is the team that gets the highest total score. At the end what week is the fastest possible, the winner of the competition on is the season certain? p3. Look at the following picture. The quadrilateral $ABCD$ is a cyclic. Given that $CF$ is perpendicular to $AF$, $CE$ is perpendicular to $BD$, and $CG$ is perpendicular to $AB$. Is the following statements true? Write down your reasons. $$\frac{BD}{CE}=\frac{AB}{CG}+ \frac{AD}{CF}$$ [img]https://cdn.artofproblemsolving.com/attachments/b/0/dbd97b4c72bc4ebd45ed6fa213610d62f29459.png[/img] p4. Suppose $M=2014^{2014}$. If the sum of all the numbers (digits) that make up the number $M$ equals $A$ and the sum of all the digits that make up the number $A$ equals $B$, then find the sum of all the numbers that make up $B$. p5. Find all positive integers $n < 200$ so that $n^2 + (n + 1)^2$ is square of an integer.

Is it possible to place a positive integer in every cell of a $10 \times 10$ array in such a way that both the following conditions are satisfied? $\bullet$ Each number (not in the top row) is a proper divisor of the number immediately above. $\bullet$ Each row consists of 1$0$ consecutive positive integers (but not necessarily in order).

A triangular table with $n$ rows and $n$ columns is given, the $i$-th row ends with a field in the $v$-th column. In each field of the table, some of the numbers $1,2,..., n$ are written such that for each $k \in {1, 2,..., n}$ all the numbers $1,2,..., n$ occur in the union of the $k$-th row and the $k$-th column. Prove that for odd $n$, each of the numbers $1,2,..., n$ is written in the last box of a row. [img]https://cdn.artofproblemsolving.com/attachments/f/9/2aed55628edb1505c7de27c152127b04d8d991.png[/img]

[b]p1.[/b] One out of $12$ coins is counterfeited. It is known that its weight differs from the weight of a valid coin but it is unknown whether it is lighter or heavier. How to detect the counterfeited coin with the help of four trials using only a two-pan balance without weights? [b]p2.[/b] Below a $3$-digit number $c d e$ is multiplied by a $2$-digit number $a b$ . Find all solutions $a, b, c, d, e, f, g$ if it is known that they represent distinct digits. $\begin{tabular}{ccccc} & & c & d & e \\ x & & & a & b \\ \hline & & f & e & g \\ + & c & d & e & \\ \hline & b & b & c & g \\ \end{tabular}$ [b]p3.[/b] Find all integer $n$ such that $\frac{n + 1}{2n - 1}$is an integer. [b]p4[/b]. There are several straight lines on the plane which split the plane in several pieces. Is it possible to paint the plane in brown and green such that each piece is painted one color and no pieces having a common side are painted the same color? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Joe and Penny play a game. Initially there are $5000$ stones in a pile, and the two players remove stones from the pile by making a sequence of moves. On the $k$-th move, any number of stones between $1$ and $k$ inclusive may be removed. Joe makes the odd-numbered moves and Penny makes the even-numbered moves. The player who removes the very last stone is the winner. Who wins if both players play perfectly?