[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].

Over a period of $k$ consecutive days, a total of $2014$ babies were born in a certain city, with at least one baby being born each day. Show that: (a) If $1014 < k \le 2014$, there must be a period of consecutive days during which exactly $100$ babies were born. (b) By contrast, if $k = 1014$, such a period might not exist.

Let $m,n\ge2$ be positive integers. On an $m\times n$ chessboard, some unit squares are occupied by rooks such that each rook attacked by odd number of other rooks. Determine the maximum number of rooks that can be placed on the chessboard.

the code system of a new 'MO lock' is a regular $n$-gon,each vertex labelled a number $0$ or $1$ and coloured red or blue.it is known that for any two adjacent vertices,either their numbers or colours coincide. find the number of all possible codes(in terms of $n$).

$k$ is a positive integer, $R_{n}={-k, -(k-1),..., -1, 1,..., k-1, k}$ for $n=2k$ $R_{n}={-k, -(k-1),..., -1, 0, 1,..., k-1, k}$ for $n=2k+1$. A mechanism consists of some marbles and white/red ropes that connects some marble pairs. If each one of the marbles are written on some numbers from $R_{n}$ with the property that any two connected marbles have different numbers on them, we call it [i]nice labeling[/i]. If each one of the marbles are written on some numbers from $R_{n}$ with the properties that any two connected marbles with a white rope have different numbers on them and any two connected marbles with a red rope have two numbers with sum not equal to $0$, we call it [i]precise labeling[/i]. $n\geq{3}$, if every mechanism that is labeled [i]nicely[/i] with $R_{n}$, could be labeled [i]precisely[/i] with $R_{m}$, what is the minimal value of $m$?

Let $n\geqslant 3$ be a positiv integer. Ana chooses the positive integers $a_1,a_2,\ldots,a_n$ and for any non-empty subset $A\subseteq\{1,2,\ldots,n\}$ she computes the sum \[s_A=\sum_{k \in A}a_k.\]She orders these sums $s_1\leqslant s_2\leqslant\cdots\leqslant s_{2^n-1}.$ Prove that there exists a subset $B\subseteq\{1,2,\ldots,2^n-1\}$ with $2^{n-2}+1$ elements such that, regardless of the integers $a_1,a_2,\ldots,a_n$ chosen by Ana, these can be determined by only knowing the sums $s_i$ with $i\in B.$

It is known that there are polyhedrons whose faces are more numbered than the vertices. Find the smallest number of triangular faces that such a polyhedron can have.

Let $n$ be an odd integer greater than 1 and let $c_1, c_2, \ldots, c_n$ be integers. For each permutation $a = (a_1, a_2, \ldots, a_n)$ of $\{1,2,\ldots,n\}$, define $S(a) = \sum_{i=1}^n c_i a_i$. Prove that there exist permutations $a \neq b$ of $\{1,2,\ldots,n\}$ such that $n!$ is a divisor of $S(a)-S(b)$.

A frog is located on a unit square of an infinite grid oriented according to the cardinal directions. The frog makes moves consisting of jumping either one or two squares in the direction it is facing, and then turning according to the following rules: i) If the frog jumps one square, it then turns $90^\circ$ to the right; ii) If the frog jumps two squares, it then turns $90^\circ$ to the left. Is it possible for the frog to reach the square exactly $2024$ squares north of the initial square after some finite number of moves if it is initially facing: a) North; b) East?

Consider a finite set of points $T\in\mathbb{R}^n$ contained in the $n$-dimensional unit ball centered at the origin, and let $X$ be the convex hull of $T$. Prove that for all positive integers $k$ and all points $x\in X$, there exist points $t_1, t_2, \dots, t_k\in T$, not necessarily distinct, such that their centroid \[\frac{t_1+t_2+\dots+t_k}{k}\]has Euclidean distance at most $\frac{1}{\sqrt{k}}$ from $x$. (The $n$-dimensional unit ball centered at the origin is the set of points in $\mathbb{R}^n$ with Euclidean distance at most $1$ from the origin. The convex hull of a set of points $T\in\mathbb{R}^n$ is the smallest set of points $X$ containing $T$ such that each line segment between two points in $X$ lies completely inside $X$.)

From the set of numbers $1 , 2, 3, . . . , 1985$ choose the largest subset such that the difference between any two numbers in the subset is not a prime number (the prime numbers are $2, 3 , 5 , 7,... , 1$ is not a prime number) .

A sequence of moves is performed starting on the three letter string "$BAD.$'' A move consists of inserting an additional instance of the three letter string "$BAD$'' between any two consecutive letters of the current string, to achieve an elongated string. After $n$ moves, how many distinct possible strings of length $3n+3$ can be achieved? For example, after one move the strings "$BBADAD$'' and "$BABADD$'' are achievable. [i]Proposed by squareman (Evan Chang), USA[/i]

Positive integers $m, n$ are such that $mn$ is divisible by $9$ but not divisible by $27$. Rectangle $m \times n$ is cut into corners, each consisting of three cells. There are four types of such corners, depending on their orientation; you can see them on the figure below. Could it happen that the number of corners of each type was the exact square of some positive integer? [i]Proposed by Oleksiy Masalitin[/i] [img]https://i.ibb.co/Y8QSHyf/Kyiv-MO-2023-10-4.png[/img]

Find the greatest constant $\lambda$ such that for any doubly stochastic matrix of order 100, we can pick $150$ entries such that if the other $9850$ entries were replaced by $0$, the sum of entries in each row and each column is at least $\lambda$. Note: A doubly stochastic matrix of order $n$ is a $n\times n$ matrix, all entries are nonnegative reals, and the sum of entries in each row and column is equal to 1.

Anna and Bob are playing a game on a rectangular board with $i$ rows and $j$ columns. Anna and Bob alternate turns with Anna going first. On each turn, a player places a penny in a square and then all squares in the same row and column of that square are marked. A player cannot place a penny in any marked square. When a player cannot place a penny in any square, they lose and the other player wins. How many ordered pairs of integers $(i, j)$ with $1 \le i \le 2020, 1 \le j \le 2020$ are there such that Anna wins?

There are a thousand non-intersecting arcs on a circle, and on each of them contains two natural numbers. Sum of numbers of each arc is divided by the product of the numbers of the arc following it clockwise arrow. What is the largest possible value of the largest number written?

There are $n\ge 2$ line segments in the plane such that every two segments cross and no three segments meet at a point. Geoff has to choose an endpoint of each segment and place a frog on it facing the other endpoint. Then he will clap his hands $n-1$ times. Every time he claps,each frog will immediately jump forward to the next intersection point on its segment. Frogs never change the direction of their jumps. Geoff wishes to place the frogs in such a way that no two of them will ever occupy the same intersection point at the same time. (a) Prove that Geoff can always fulfill his wish if $n$ is odd. (b) Prove that Geoff can never fulfill his wish if $n$ is even.

We will say that a set of real numbers $A = (a_1,... , a_{17})$ is stronger than the set of real numbers $B = (b_1, . . . , b_{17})$, and write $A >B$ if among all inequalities $a_i > b_j$ the number of true inequalities is at least $3$ times greater than the number of false. Prove that there is no chain of sets $A_1, A_2, . . . , A_N$ such that $A_1>A_2> \cdots A_N>A_1$. Remark: For 11.4, the constant $3$ is changed to $2$ and $N=3$ and $17$ is changed to $m$ and $n$ in the definition (the number of elements don't have to be equal).

Find the maximum value of $M$, if you choose $10$ different real numbers randomly in $[1,M]$, there must be $3$ numbers $a<b<c$, satisfy $ax^2+bx+c=0$ has no real root.

Consider an $m \times n$ grid of unit squares. Let $R$ be the total number of rectangles of any size, and let $S$ be the total number of squares of any size. Assume that the sides of the rectangles and squares are parallel to the sides of the $m \times n$ grid. If $\frac{R}{S} =\frac{759}{50}$ , then determine $mn$.

Minivan and Megavan play a game. For a positive integer $n$, Minivan selects a sequence of integers $a_1,a_2,\ldots,a_n$. An operation on $a_1,a_2,\ldots,a_n$ means selecting an $a_i$ and increasing it by $1$. Minivan and Megavan take turns, with Minivan going first. On Minivan's turn, he performs at most $2025$ operations, and he may choose the same integer repeatedly. On Megavan's turn, he performs exactly $1$ operation instead. Megavan wins if at any point in the game, including in the middle of Minivan's operations, two numbers in the sequence are equal. [i](Proposed by Ho Janson)[/i]

An equilateral triangle $T$ with side length $2022$ is divided into equilateral unit triangles with lines parallel to its sides to obtain a triangular grid. The grid is covered with figures shown on the image below, which consist of $4$ equilateral unit triangles and can be rotated by any angle $k \cdot 60^{\circ}$ for $k \in \left \{1,2,3,4,5 \right \}$. The covering satisfies the following conditions: $1)$ It is possible not to use figures of some type and it is possible to use several figures of the same type. The unit triangles in the figures correspond to the unit triangles in the grid. $2)$ Every unit triangle in the grid is covered, no two figures overlap and every figure is fully contained in $T$. Determine the smallest possible number of figures of type $1$ that can be used in such a covering. [i]Proposed by Ilija Jovcheski[/i]

For any point $(x, y)$ with $0\le x < 1$ and $0 \le y < 1$, Jenny can perform a shuffle on that point, which takes the point to $(\{3x + y\} ,\{x + 2y\})$ where $\{a\}$ denotes the fractional or decimal part of $a$ (so for example,$\{\pi\} = \pi - 3 = 0.1415...$). How many points $p$ are there such that after $3$ shuffles on $p$, $p$ ends up in its original position?

Let $n\geq 2$ be an integer and $a_1,a_2,\cdots,a_n$ be distinct positive real numbers. For any $(i,j)$ in a country consisting of cities $C_1,C_2,\cdots,C_n$, there is a two-way flight between $C_i$ and $C_j$ that costs $a_i+a_j$.A traveler travels between cities of this country such that every time they pay a strictly higher cost than their previous flight. Find the maximum number of flight this traveler could take.

It is given set $A=\{1,2,3,...,2n-1\}$. From set $A$, at least $n-1$ numbers are expelled such that: $a)$ if number $a \in A$ is expelled, and if $2a \in A$ then $2a$ must be expelled $b)$ if $a,b \in A$ are expelled, and $a+b \in A$ then $a+b$ must be also expelled Which numbers must be expelled such that sum of numbers remaining in set stays minimal