Andrew generates a finite random sequence $\{a_n\}$ of distinct integers according to the following criteria: [list] [*] $a_0 = 1$, $0 < |a_n| < 7$ for all $n$, and $a_i \neq a_j$ for all $i < j$. [*] $a_{n+1}$ is selected uniformly at random from the set $\{a_n - 1, a_n + 1, -a_n\}$, conditioned on the above rule. The sequence terminates if no element of the set satisfies the first condition. [/list] For example, if $(a_0, a_1) = (1, 2)$, then $a_2$ would be chosen from the set $\{-2,3\}$, each with probability $\tfrac12$. Determine the probability that there exists an integer $k$ such that $a_k = 6$.

Let $n$ be a posititve integer. On a $n \times n$ grid there are $n^2$ unit squares and on these we color the sides with blue such that every unit square has exactly one side with blue. [b]a)[/b] Find the maximun number of blue unit sides we can have on the $n \times n$ grid. [b]b)[/b] Find the minimun number of blue unit sides we can have on the $n \times n$ grid.

In a dance party there are $n$ girls and $n$ boys, and some $m$ songs are played. Each song is danced to by at least one pair of a boy and a girl, who both receive a [i]malai [/i] each. Prove that for all positive integers $k \le n$, it is possible to select $k$ boys and $n - k$ girls so that the $n$ selected people received at least $m$ malai in total.

The numbers $1, 2, 3,\ldots , 64$ are placed on a chessboard, one number in each square. Consider all squares on the chessboard of size $2 \times 2.$ Prove that there are at least three such squares for which the sum of the $4$ numbers contained exceeds $100.$

In a city of gnomes there are $1000$ identical towers, each of which has $1000$ stories, with exactly one gnome living on each story. Every gnome in the city wears a hat colored in one of $1000$ possible colors and any two gnomes in the same tower have different hats. A pair of gnomes are friends if they wear hats of the same color, one of them lives in the $k$-th story of his tower and the other one in the $(k+1)$-st story of his tower. Determine the maximal possible number of pairs of gnomes which are friends. [i]Authored by Nikola Velov[/i]

[u]Set 7[/u] [b]p19.[/b] Let circles $\omega_1$ and $\omega_2$, with centers $O_1$ and $O_2$, respectively, intersect at $X$ and $Y$ . A lies on $\omega_1$ and $B$ lies on $\omega_2$ such that $AO_1$ and $BO_2$ are both parallel to $XY$, and $A$ and $B$ lie on the same side of $O_1O_2$. If $XY = 60$, $\angle XAY = 45^o$, and $\angle XBY = 30^o$, then the length of $AB$ can be expressed in the form $\sqrt{a - b\sqrt2 + c\sqrt3}$, where $a, b, c$ are positive integers. Determine $a + b + c$. [b]p20.[/b] If $x$ is a positive real number such that $x^{x^2}= 2^{80}$, find the largest integer not greater than $x^3$. [b]p21.[/b] Justin has a bag containing $750$ balls, each colored red or blue. Sneaky Sam takes out a random number of balls and replaces them all with green balls. Sam notices that of the balls left in the bag, there are $15$ more red balls than blue balls. Justin then takes out $500$ of the balls chosen randomly. If $E$ is the expected number of green balls that Justin takes out, determine the greatest integer less than or equal to $E$. [u]Set 8[/u] These three problems are interdependent; each problem statement in this set will use the answers to the other two problems in this set. As such, let the positive integers $A, B, C$ be the answers to problems $22$, $23$, and $24$, respectively, for this set. [b]p22.[/b] Let $WXYZ$ be a rectangle with $WX =\sqrt{5B}$ and $XY =\sqrt{5C}$. Let the midpoint of $XY$ be $M$ and the midpoint of $YZ$ be $N$. If $XN$ and $W Y$ intersect at $P$, determine the area of $MPNY$ . [b]p23.[/b] Positive integers $x, y, z$ satisfy $$xy \equiv A \,\, (mod 5)$$ $$yz \equiv 2A + C\,\, (mod 7)$$ $$zx \equiv C + 3 \,\, (mod 9).$$ (Here, writing $a \equiv b \,\, (mod m)$ is equivalent to writing $m | a - b$.) Given that $3 \nmid x$, $3 \nmid z$, and $9 | y$, find the minimum possible value of the product $xyz$. [b]p24.[/b] Suppose $x$ and $y$ are real numbers such that $$x + y = A$$ $$xy =\frac{1}{36}B^2.$$ Determine $|x - y|$. [u]Set 9[/u] [b]p25. [/b]The integer $2017$ is a prime which can be uniquely represented as the sum of the squares of two positive integers: $$9^2 + 44^2 = 2017.$$ If $N = 2017 \cdot 128$ can be uniquely represented as the sum of the squares of two positive integers $a^2 +b^2$, determine $a + b$. [b]p26.[/b] Chef Celia is planning to unveil her newest creation: a whole-wheat square pyramid filled with maple syrup. She will use a square flatbread with a one meter diagonal and cut out each of the five polygonal faces of the pyramid individually. If each of the triangular faces of the pyramid are to be equilateral triangles, the largest volume of syrup, in cubic meters, that Celia can enclose in her pyramid can be expressed as $\frac{a-\sqrt{b}}{c}$ where $a, b$ and $c$ are the smallest possible possible positive integers. What is $a + b + c$? [b]p27.[/b] In the Cartesian plane, let $\omega$ be the circle centered at $(24, 7)$ with radius $6$. Points $P, Q$, and $R$ are chosen in the plane such that $P$ lies on $\omega$, $Q$ lies on the line $y = x$, and $R$ lies on the $x$-axis. The minimum possible value of $PQ+QR+RP$ can be expressed in the form $\sqrt{m}$ for some integer $m$. Find m. [u]Set 10[/u] [i]Deja vu?[/i] [b]p28. [/b] Let $ABC$ be a triangle with incircle $\omega$. Let $\omega$ intersect sides $BC$, $CA$, $AB$ at $D, E, F$, respectively. Suppose $AB = 7$, $BC = 12$, and $CA = 13$. If the area of $ABC$ is $K$ and the area of $DEF$ is $\frac{m}{n}\cdot K$, where $m$ and $n$ are relatively prime positive integers, then compute $m + n$. [b]p29.[/b] Sebastian is playing the game Split! again, but this time in a three dimensional coordinate system. He begins the game with one token at $(0, 0, 0)$. For each move, he is allowed to select a token on any point $(x, y, z)$ and take it off, replacing it with three tokens, one at $(x + 1, y, z)$, one at $(x, y + 1, z)$, and one at $(x, y, z + 1)$ At the end of the game, for a token on $(a, b, c)$, it is assigned a score $\frac{1}{2^{a+b+c}}$ . These scores are summed for his total score. If the highest total score Sebastian can get in $100$ moves is $m/n$, then determine $m + n$. [b]p30.[/b] Determine the number of positive $6$ digit integers that satisfy the following properties: $\bullet$ All six of their digits are $1, 5, 7$, or $8$, $\bullet$ The sum of all the digits is a multiple of $5$. [u]Set 11[/u] [b]p31.[/b] The triangular numbers are defined as $T_n =\frac{n(n+1)}{2}$. We also define $S_n =\frac{n(n+2)}{3}$. If the sum $$\sum_{i=16}^{32} \left(\frac{1}{T_i}+\frac{1}{S_i}\right)= \left(\frac{1}{T_{16}}+\frac{1}{S_{16}}\right)+\left(\frac{1}{T_{17}}+\frac{1}{S_{17}}\right)+...+\left(\frac{1}{T_{32}}+\frac{1}{S_{32}}\right)$$ can be written in the form $a/b$ , where $a$ and $b$ are positive integers with $gcd(a, b) = 1$, then find $a + b$. [b]p32.[/b] Farmer Will is considering where to build his house in the Cartesian coordinate plane. He wants to build his house on the line $y = x$, but he also has to minimize his travel time for his daily trip to his barnhouse at $(24, 15)$ and back. From his house, he must first travel to the river at $y = 2$ to fetch water for his animals. Then, he heads for his barnhouse, and promptly leaves for the long strip mall at the line $y =\sqrt3 x$ for groceries, before heading home. If he decides to build his house at $(x_0, y_0)$ such that the distance he must travel is minimized, $x_0$ can be written in the form $\frac{a\sqrt{b}-c}{d}$ , where $a, b, c, d$ are positive integers, $b$ is not divisible by the square of a prime, and $gcd(a, c, d) = 1$. Compute $a+b+c+d$. [b]p33.[/b] Determine the greatest positive integer $n$ such that the following two conditions hold: $\bullet$ $n^2$ is the difference of consecutive perfect cubes; $\bullet$ $2n + 287$ is the square of an integer. [u]Set 12[/u] The answers to these problems are nonnegative integers that may exceed $1000000$. You will be awarded points as described in the problems. [b]p34.[/b] The “Collatz sequence” of a positive integer n is the longest sequence of distinct integers $(x_i)_{i\ge 0}$ with $x_0 = n$ and $$x_{n+1} =\begin{cases} \frac{x_n}{2} & if \,\, x_n \,\, is \,\, even \\ 3x_n + 1 & if \,\, x_n \,\, is \,\, odd \end{cases}.$$ It is conjectured that all Collatz sequences have a finite number of elements, terminating at $1$. This has been confirmed via computer program for all numbers up to $2^{64}$. There is a unique positive integer $n < 10^9$ such that its Collatz sequence is longer than the Collatz sequence of any other positive integer less than $10^9$. What is this integer $n$? An estimate of $e$ gives $\max\{\lfloor 32 - \frac{11}{3}\log_{10}(|n - e| + 1)\rfloor, 0\}$ points. [b]p35.[/b] We define a graph $G$ as a set $V (G)$ of vertices and a set $E(G)$ of distinct edges connecting those vertices. A graph $H$ is a subgraph of $G$ if the vertex set $V (H)$ is a subset of $V (G)$ and the edge set $E(H)$ is a subset of $E(G)$. Let $ex(k, H)$ denote the maximum number of edges in a graph with $k$ vertices without a subgraph of $H$. If $K_i$ denotes a complete graph on $i$ vertices, that is, a graph with $i$ vertices and all ${i \choose 2}$ edges between them present, determine $$n =\sum_{i=2}^{2018} ex(2018, K_i).$$ An estimate of $e$ gives $\max\{\lfloor 32 - 3\log_{10}(|n - e| + 1)\rfloor, 0\}$ points. [b]p36.[/b] Write down an integer between $1$ and $100$, inclusive. This number will be denoted as $n_i$ , where your Team ID is $i$. Let $S$ be the set of Team ID’s for all teams that submitted an answer to this problem. For every ordered triple of distinct Team ID’s $(a, b, c)$ such that a, b, c ∈ S, if all roots of the polynomial $x^3 + n_ax^2 + n_bx + n_c$ are real, then the teams with ID’s $a, b, c$ will each receive one virtual banana. If you receive $v_b$ virtual bananas in total and $|S| \ge 3$ teams submit an answer to this problem, you will be awarded $$\left\lfloor \frac{32v_b}{3(|S| - 1)(|S| - 2)}\right\rfloor$$ points for this problem. If $|S| \le 2$, the team(s) that submitted an answer to this problem will receive $32$ points for this problem. PS. You had better use hide for answers. First sets have been posted [url=https://artofproblemsolving.com/community/c4h2777264p24369138]here[/url].Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The numbers $1,2,\dots, 2013$ are written on $2013$ stones weighing $1,2,\dots, 2013$ grams such that each number is used exactly once. We have a two-pan balance that shows the difference between the weights at the left and the right pans. No matter how the numbers are written, if it is possible to determine in $k$ weighings whether the weight of each stone is equal to the number that is written on the stone, what is the least possible value of $k$? $ \textbf{(A)}\ 15 \qquad\textbf{(B)}\ 12 \qquad\textbf{(C)}\ 10 \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ \text{None of above} $

Let $n$ be a natural number. The graph $G$ has $10n$ vertices. They are separated into $10$ groups with $n$ vertices and we know that there is an edge between two of them if and only if they belong to two different groups. What’s the greatest number of edges a subgraph of $G$ can have, so that there are no 4-cliques in it?

Every day, Kaori flips a fair coin. She practices her violin if and only if the coin comes up heads. The probability that she practices at least five days this week can be written in simplest form as $\frac{m}{n}$. Compute $m + n$

Given $n \ge 4$ points in the plane such that any four of them are the vertices of a convex quadrilateral, prove that these points are the vertices of a convex polygon.

Given a paper on which the numbers $1,2,3\dots ,14,15$ are written. Andy and Bobby are bored and perform the following operations, Andy chooses any two numbers (say $x$ and $y$) on the paper, erases them, and writes the sum of the numbers on the initial paper. Meanwhile, Bobby writes the value of $xy(x+y)$ in his book. They were so bored that they both performed the operation until only $1$ number remained. Then Bobby adds up all the numbers he wrote in his book, let’s call $k$ as the sum. $a$. Prove that $k$ is constant which means it does not matter how they perform the operation, $b$. Find the value of $k$.

suppose that $\mathcal F\subseteq p(X)$ and $|X|=n$. prove that if $|\mathcal F|>\sum_{i=0}^{k-1}\dbinom{n}{i}$ then there exist $Y\subseteq X$ with $|Y|=k$ such that $p(Y)=\mathcal F\cap Y$ that $\mathcal F\cap Y=\{F\cap Y:F\in \mathcal F\}$(20 points) you can see this problem also here: COMBINATORIAL PROBLEMS AND EXERCISES-SECOND EDITION-by LASZLO LOVASZ-AMS CHELSEA PUBLISHING- chapter 13- problem 10(c)!!!

$n$ vertices from a regular polygon with $2n$ sides are chosen and coloured red. The other $n$ vertices are coloured blue. Afterwards, the $\binom{n}{2}$ lengths of the segments formed with all pairs of red vertices are ordered in a non-decreasing sequence, and the same procedure is done with the $\binom{n}{2}$ lengths of the segments formed with all pairs of blue vertices. Prove that both sequences are identical.

2016 circles with radius 1 are lying on the plane. Among these 2016 circles, show that one can select a collection $C$ of 27 circles satisfying the following: either every pair of two circles in $C$ intersect or every pair of two circles in $C$ does not intersect.

A cube of dimensions $20 \times 20 \times 20$ is constructed with blocks of $1 \times 2 \times 2$. Prove that there is a line that passes through the cube but not any block.

A collection of short stories written by Papadiamantis contains $70$ short stories, one of $1$ page, one of $2$ pages, ... one of $70$ pages . and not nessecarily in that order. Every short story starts on a new page and numbering of pages of the book starts from the first page . What is the maximum number of short stories that start on page with odd number?

Per and Kari each have $n$ pieces of paper. They both write down the numbers from $1$ to $2n$ in an arbitrary order, one number on each side. Afterwards, they place the pieces of paper on a table showing one side. Prove that they can always place them so that all the numbers from $1$ to $2n$ are visible at once.

Pick a $3$-digit number $abc$, which contains no $0$'s. The probability that this is a winning number is $\frac1a\cdot\frac1b\cdot\frac1c$. However, the BMT problem writer tries to balance out the chances for the numbers in the following ways: [list] [*] For the lowest digit $n$ in the number, he rolls an $n$-sided die for each time that the digit appears, and gives the number $0$ probability of winning if an $n$ is rolled. [*] For the largest digit $m$ in the number, he rolls an $m$-sided die once and scales the probability of winning by that die roll. [/list] If you choose optimally, what is the probability that your number is a winning number?

[b]p1.[/b] A Slavic dragon has three heads. A knight fights the dragon. If the knight cuts off one dragon’s head three new heads immediately grow. Is it possible that the dragon has $2018$ heads at some moment of the fight? [b]p2.[/b] Peter has two squares $3\times 3$ and $4\times 4$. He must cut one of them or both of them in no more than four parts in total. Is Peter able to assemble a square using all these parts? [b]p3.[/b] Usually, dad picks up Constantine after his music lessons and they drive home. However, today the lessons have ended earlier and Constantine started walking home. He met his dad $14$ minutes later and they drove home together. They arrived home $6$ minutes earlier than usually. Home many minutes earlier than usual have the lessons ended? Please, explain your answer. [b]p4.[/b] All positive integers from $1$ to $2018$ are written on a blackboard. First, Peter erased all numbers divisible by $7$. Then, Natalie erased all remaining numbers divisible by $11$. How many numbers did Natalie remove? Please, explain your answer. [b]p5.[/b] $30$ students took part in a mathematical competition consisting of four problems. $25$ students solved the first problem, $24$ students solved the second problem, $22$ students solved the third, and, finally, $21$ students solved the fourth. Show that there are at least two students who solved all four problems. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The numbers 1, 2 and 3 are written on a board. Two friends are playing the following game. A player writes a number that doesn't exceed 2022 and isn't already on the board and is a sum or a product of two numbers that are written on the board. They take turns writing numbers and the winner is the player who writes 2022 on the board. Which player has a winning strategy and why? [i]Proposed by Ilija Jovcheski[/i]

Let $n$ be an integer greater than $1$. In how many ways can we fill all the numbers $1, 2,..., 2n$ in the boxes of a grid of $2\times n$, one in each box, so that any two consecutive numbers are they in squares that share one side of the grid?

Two squids are forced to participate in a game. Before it begins, they will be informed of all the rules, and can discuss their strategies freely. Then, they will be locked in separate rooms, and be given distinct positive integers no larger than $2023$ as their IDs respectively. The two squids then take turns alternatively; on one's turn, the squid chooses one of the following: 1. announce a positive integer, which will be heard by the other squid; 2. declare which squid has the larger ID. If correct, they win and are released together; otherwise, they lose and are fried together. Find the smallest positive integer $N$ so that, no matter what IDs the squids have been given, they can always win in a finite number of turns, and the sum of the numbers announced during the game is no larger than $N$.

For which integers $n \ge 5$ is it possible to color the vertices of a regular$ n$-gon using at most $6$ colors in such a way that any $5$ consecutive vertices have different colors?

There are $n$ lamps and $k$ switches in a room. Initially, each lamp is either turned on or turned off. Each lamp is connected by a wire with $2020$ switches. Switching a switch changes the state of a lamp, that is connected to it, to the opposite state. It is known that one can switch the switches so that all lamps will be turned on. Prove, that it is possible to achieve the same result by switching the switches no more than $ \left \lfloor \dfrac{k}{2} \right \rfloor$ times. [i]Proposed by T. Zimanov[/i]

$15$ ladies and $30$ gentlemen attend a luxurious party. At the start of the party, each one of the ladies shakes hands with a random gentleman. At the end of the party, each of the ladies shakes hands with another random gentleman. A lady may shake hands with the same gentleman twice (first at the start and then at the end of the party), and no two ladies shake hands with the same gentleman at the same time. Let $m$ and $n$ be relatively prime positive integers such that $\frac{m}{n}$ is the probability that the collection of ladies and gentlemen that shook hands at least once can be arranged in a single circle such that each lady is directly adjacent to someone if and only if she shook hands with that person. Find the remainder when $m$ is divided by $10000$.