Five circles in a row are each labeled with a positive integer. As shown in the diagram, each circle is connected to its adjacent neighbor(s). The integers must be chosen such that the sum of the digits of the neighbor(s) of a given circle is equal to the number labeling that point. In the example, the second number $23 = (1+8)+(5+9)$, but the other four numbers do not have the needed value. [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvMi9lL2M2MzVkMmMyYTRlZjliNWEzYWNkOTM2OGVmY2NkOGZmOWVkN2VmLnBuZw==&rn=MjAxMSBCQU1PIDIucG5n[/img] What is the smallest possible sum of the five numbers? How many possible arrangements of the five numbers have this sum? Justify your answers.

A strip of width $w$ is the set of all points which lie on, or between, two parallel lines distance $w$ apart. Let $S$ be a set of $n$ ($n \ge 3$) points on the plane such that any three different points of $S$ can be covered by a strip of width $1$. Prove that $S$ can be covered by a strip of width $2$.

Let us call a 1×3 rectangle a tromino. Alice and Bob go to different rooms, and each divides a 20 × 21 board into trominos. Then they compare the results, compute how many trominos are the same in both splittings, and Alice pays Bob that number of dollars. What is the maximal amount Bob may guarantee to himself no matter how Alice plays?

The two figures depicted below consisting of $6$ and $10$ unit squares, respectively, are called staircases. Consider a $2018\times 2018$ board consisting of $2018^2$ cells, each being a unit square. Two arbitrary cells were removed from the same row of the board. Prove that the rest of the board cannot be cut (along the cell borders) into staircases (possibly rotated).

The set Φ consists of a finite number of points on the plane. The distance between any two points from Φ is at least $\sqrt{2}$. It is known that a regular triangle with side lenght $3$ cut out of paper can cover all points of Φ. What is the greatest number of points that Φ can consist of?

Let $n \geq 2$ be an integer. Switzerland and Liechtenstein are performing their annual festive show. There is a field divided into $n \times n$ squares, in which the bottom-left square contains a red house with $k$ Swiss gymnasts, and the top-right square contains a blue house with $k$ Liechtensteiner gymnasts. Every other square only has enough space for a single gymnast at a time. Each second either a Swiss gymnast or a Liechtensteiner gymnast moves. The Swiss gymnasts move to either the square immediately above or to the right and the Liechtensteiner gymnasts move either to the square immediately below or to the left. The goal is to move all the Swiss gymnasts to the blue house and all the Liechtensteiner gymnasts to the red house, with the caveat that a gymnast cannot enter a house until all the gymnasts of the other nationality have left. Determine the largest $k$ in terms of $n$ for which this is possible.

a) A castle is equilateral triangle with the side of $100$ metres. It is divided onto $100$ triangle rooms. Each wall between the rooms is $10$ metres long and contain one door. You are inside and are allowed to pass through every door not more than once. Prove that you can visit not more than $91$ room (not exiting the castle). b) Every side of the triangle is divided onto $k$ parts by the lines parallel to the sides. And the triangle is divided onto $k^2$ small triangles. Let us call the "chain" such a sequence of triangles, that every triangle in it is included only once, and the consecutive triangles have the common side. What is the greatest possible number of the triangles in the chain?

We are given an $(n^2-1)\times(n^2-1)$ checkered board. A set of $n{}$ cells is called [i]progressive[/i] if the centers of the cells lie on a straight line and form $n-1$ equal intervals. Find the number of progressive sets. [i]Proposed by P. Kozhevnikov[/i]

Let $n$ be a positive integer and let vectors $v_1$, $v_2$, $\ldots$, $v_n$ be given in the plain. A flea originally sitting in the origin moves according to the following rule: in the $i$th minute (for $i=1,2,\ldots,n$) it will stay where it is with probability $1/2$, moves with vector $v_i$ with probability $1/4$, and moves with vector $-v_i$ with probability $1/4$. Prove that after the $n$th minute there exists no point which is occupied by the flea with greater probability than the origin. [i]Proposed by Péter Pál Pach, Budapest[/i]

Given a set of 1988 points in the plane. No four points of the set are collinear. The points of a subset with 1788 points are coloured blue, the remaining 200 are coloured red. Prove that there exists a line in the plane such that each of the two parts into which the line divides the plane contains 894 blue points and 100 red points.

Let $N$ be a positive integer. Kingdom Wierdo has $N$ castles, with at most one road between each pair of cities. There are at most four guards on each road. To cost down, the King of Wierdos makes the following policy: (1) For any three castles, if there are roads between any two of them, then any of these roads cannot have four guards. (2) For any four castles, if there are roads between any two of them, then for any one castle among them, the roads from it toward the other three castles cannot all have three guards. Prove that, under this policy, the total number of guards on roads in Kingdom Wierdo is smaller than or equal to $N^2$. [i]Remark[/i]: Proving that the number of guards does not exceed $cN^2$ for some $c > 1$ independent of $N$ will be scored based on the value of $c$. [i]Proposed by usjl[/i]

Suppose $A_1,A_2,\cdots ,A_n \subseteq \left \{ 1,2,\cdots ,2018 \right \}$ and $\left | A_i \right |=2, i=1,2,\cdots ,n$, satisfying that $$A_i + A_j, \; 1 \le i \le j \le n ,$$ are distinct from each other. $A + B = \left \{ a+b|a\in A,\,b\in B \right \}$. Determine the maximal value of $n$.

A rectangle is divided into $n^2$ smaller rectangle by $n - 1$ horizontal lines and $n - 1$ vertical lines. Between those rectangles there are exactly $5660$ which are not congruent. For what minimum value of $n$ is this possible?

Let $p$ be an odd prime, and put $N=\frac{1}{4} (p^3 -p) -1.$ The numbers $1,2, \dots, N$ are painted arbitrarily in two colors, red and blue. For any positive integer $n \leqslant N,$ denote $r(n)$ the fraction of integers $\{ 1,2, \dots, n \}$ that are red. Prove that there exists a positive integer $a \in \{ 1,2, \dots, p-1\}$ such that $r(n) \neq a/p$ for all $n = 1,2, \dots , N.$ [I]Netherlands[/i]

Andrea flips a fair coin repeatedly, continuing until she either flips two heads in a row (the sequence HH) or flips tails followed by heads (the sequence TH). What is the probability that she will stop after flipping HH?

For a sequence, one can perform the following operation: select three adjacent terms $a,b,c,$ and change it into $b,c,a.$ Determine all the possible positive integers $n\geq 3,$ such that after finite number of operation, the sequence $1,2,\cdots, n$ can be changed into $n,n-1,\cdots,1$ finally.

There are $N$ houses in a city. Every Christmas, Santa visits these $N$ houses in some order. Show that if $N$ is large enough, then it holds that for three consecutive years there are always are $13$ houses such that they have been visited in the same order for two years (out of the three consecutive years). Determine the smallest $N$ for which this holds.

Find the number of trapeziums that it can be formed with the vertices of a regular polygon.

Call arrangement of $m$ number on the circle [b]$m$-negative[/b], if all numbers are equal to $-1$. On the first step Andrew chooses one number on circle and multiplies it by $-1$. All other steps are similar: instead of the next number(clockwise) he writes its product with the number, written on the previous step. Prove that if $n$-negative arrangement in $k$ steps becomes $n$-negative again, then $(2^n - 1)$-negative after $(2^k - 1)$ steps becomes $(2^n - 1)$-negative again.

Santa Claus wants to wrap presents. These are available in $n$ sizes $A_1 <A_2 <...<A_n$, and analogously, there are $n$ packaging sizes $B_1 <B_2 <...<B_n$, where $B_i$ is enough to all gift sizes $A_j$ can be grouped with $j\le i$, but too small for those with $j> i$. On the shelf to the right of Santa Claus are the gifts sorted by size, where the smallest are on the right, of course there can be several gifts of the same size, or none of a size at all. To his left is a shelf with packaging, and also these are sorted from small to large in the same direction. He's brooding in what way he should wrap the gifts and sees two methods for doing this, which depend on his thinking and laziness of movement have been optimized: a) He takes the present closest to him and puts it in the closest packaging, in which it fits in. b) He takes the packaging closest to him and packs in it the closest thing to him gift. In both cases he then does the same again, although of course the one he was using the gift and its packaging are missing, and so on. Once it is not large enough if the packaging or the present is not small enough, he / she will provide the present or the packaging back to its place on the shelf and takes the next-closest. Prove that both methods lead to the same result in the end, they are considered to be exactly the same gifts packed in the same packaging.

Does it exist a permutation of the numbers $1,2,\ldots,1992$ such that the arithmetic mean of arbitrary two of the numbers is not equal to any of the numbers which is placed between these two numbers in the permutation?

On a $5\times 5$ grid $\mathcal A$ of integers, each with absolute value $<10^9$, define a [i]flip[/i] to be the operation of negating each element in a row / column with negative sum. For example, $(-1,-4,3,-4,1) \to (1,4,-3,4,-1)$. Determine whether there exists an $\mathcal A$ so that it's possible to perform $90$ flips on it. [i]Alex Chen[/i]

Pawns and rooks are placed on a $2019\times 2019$ chessboard, with at most one piece on each of the $2019^2$ squares. A rook [i]can see[/i] another rook if they are in the same row or column and all squares between them are empty. What is the maximal number $p$ for which $p$ pawns and $p+2019$ rooks can be placed on the chessboard in such a way that no two rooks can see each other?

[u]Round 5[/u] [b]p13.[/b] Pieck the Frog hops on Pascal’s Triangle, where she starts at the number $1$ at the top. In a hop, Pieck can hop to one of the two numbers directly below the number she is currently on with equal probability. Given that the expected value of the number she is on after $7$ hops is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers, find $m+n$. [b]p14.[/b] Maisy chooses a random set $(x, y)$ that satisfies $$x^2 + y^2 -26x -10y \le 482.$$ The probability that $y>0$ can be expressed as $\frac{A\pi -B\sqrt{C}}{D \pi}$. Find $A+B +C +D$. [color=#f00]Due to the problem having a typo, all teams who inputted answers received points[/color] [b]p15.[/b] $6$ points are located on a circle. How many ways are there to draw any number of line segments between the points such that none of the line segments overlap and none of the points are on more than one line segment? (It is possible to draw no line segments). [u]Round 6[/u] [b]p16.[/b] Find the number of $3$ by $3$ grids such that each square in the grid is colored white or black and no two black squares share an edge. [b]p17.[/b] Let $ABC$ be a triangle with side lengths $AB = 20$, $BC = 25$, and $AC = 15$. Let $D$ be the point on BC such that $CD = 4$. Let $E$ be the foot of the altitude from $A$ to $BC$. Let $F$ be the intersection of $AE$ with the circle of radius $7$ centered at $A$ such that $F$ is outside of triangle $ABC$. $DF$ can be expressed as $\sqrt{m}$, where $m$ is a positive integer. Find $m$. [b]p18.[/b] Bill and Frank were arrested under suspicion for committing a crime and face the classic Prisoner’s Dilemma. They are both given the choice whether to rat out the other and walk away, leaving their partner to face a $9$ year prison sentence. Given that neither of them talk, they both face a $3$ year sentence. If both of them talk, they both will serve a $6$ year sentence. Both Bill and Frank talk or do not talk with the same probabilities. Given the probability that at least one of them talks is $\frac{11}{36}$ , find the expected duration of Bill’s sentence in months. [u]Round 7[/u] [b]p19.[/b] Rectangle $ABCD$ has point $E$ on side $\overline{CD}$. Point $F$ is the intersection of $\overline{AC}$ and $\overline{BE}$. Given that the area of $\vartriangle AFB$ is $175$ and the area of $\vartriangle CFE$ is $28$, find the area of $ADEF$. [b]p20.[/b] Real numbers $x, y$, and $z$ satisfy the system of equations $$5x+ 13y -z = 100,$$ $$25x^2 +169y^2 -z2 +130x y= 16000,$$ $$80x +208y-2z = 2020.$$ Find the value of $x yz$. [color=#f00]Due to the problem having infinitely many solutions, all teams who inputted answers received points. [/color] [b]p21.[/b] Bob is standing at the number $1$ on the number line. If Bob is standing at the number $n$, he can move to $n +1$, $n +2$, or $n +4$. In howmany different ways can he move to the number $10$? [u]Round 8[/u] [b]p22.[/b] A sequence $a_1,a_2,a_3, ...$ of positive integers is defined such that $a_1 = 4$, and for each integer $k \ge 2$, $$2(a_{k-1} +a_k +a_{k+1}) = a_ka_{k-1} +8.$$ Given that $a_6 = 488$, find $a_2 +a_3 +a_4 +a_5$. [b]p23.[/b] $\overline{PQ}$ is a diameter of circle $\omega$ with radius $1$ and center $O$. Let $A$ be a point such that $AP$ is tangent to $\omega$. Let $\gamma$ be a circle with diameter $AP$. Let $A'$ be where $AQ$ hits the circle with diameter $AP$ and $A''$ be where $AO$ hits the circle with diameter $OP$. Let $A'A''$ hit $PQ$ at $R$. Given that the value of the length $RA'$ is is always less than $k$ and $k$ is minimized, find the greatest integer less than or equal to $1000k$. [b]p24.[/b] You have cards numbered $1,2,3, ... ,100$ all in a line, in that order. You may swap any two adjacent cards at any time. Given that you make ${100 \choose 2}$ total swaps, where you swap each distinct pair of cards exactly once, and do not do any swaps simultaneously, find the total number of distinct possible final orderings of the cards. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3166472p28814057]here [/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3166480p28814155]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Consider $n>9$ lines on the plane such that no two lines are parallel. Show that there exist at least $n/9$ lines such that the angle between any two of the lines is at most $20^\circ$.