3. Let us call a bi-squared card $2 \times 1$ regular, if two positive integers are written on it and the number in the upper square is less than the number in the lower square. It is allowed at each move to change both numbers in the following manner: either add the same integer (possibly negative) to both numbers, or multiply each number by the same positive integer, or divide each number by the same positive integer. The card must remain regular after any changes made. What minimal number of moves is sufficient to get any regular card from any other regular card? Alexey Glebov

How many finite sequences $x_1,x_2,\ldots,x_m$ are there such that $x_i=1$ or $2$ and $\sum_{i=1}^mx_i=10$? $\textbf{(A)}~89$ $\textbf{(B)}~73$ $\textbf{(C)}~107$ $\textbf{(D)}~119$

Non-zero numbers are arranged in $n \times n$ square ($n>2$). Every number is exactly $k$ times less than the sum of all the other numbers in the same cross (i.e., $2n-2$ numbers written in the same row or column with this number). Find all possible $k$. [i]Proposed by D. Rostovsky, A. Khrabrov, S. Berlov [/i]

[center][u]Guts Round[/u] / [u]Set 7[/u][/center] [b]p19.[/b] Let $N_{21}$ be the answer to question 21. Suppose a jar has $3N_{21}$ colored balls in it: $N_{21}$ red, $N_{21}$ green, and $N_{21}$ blue balls. Jonathan takes one ball at a time out of the jar uniformly at random without replacement until all the balls left in the jar are the same color. Compute the expected number of balls left in the jar after all balls are the same color. [b]p20.[/b] Let $N_{19}$ be the answer to question 19. For every non-negative integer $k$, define $$f_k(x) = x(x - 1) + (x + 1)(x - 2) + ...+ (x + k)(x - k - 1),$$ and let $r_k$ and $s_k$ be the two roots of $f_k(x)$. Compute the smallest positive integer $m$ such that $|r_m - s_m| > 10N_{19}$. [b]p21.[/b] Let $N_{20}$ be the answer to question 20. In isosceles trapezoid $ABCD$ (where $\overline{BC}$ and $\overline{AD}$ are parallel to each other), the angle bisectors of $A$ and $D$ intersect at $F$, and the angle bisectors of points $B$ and $C$ intersect at $H$. Let $\overline{BH}$ and $\overline{AF}$ intersect at $E$, and let $\overline{CH}$ and $\overline{DF}$ intersect at $G$. If $CG = 3$, $AE = 15$, and $EG = N_{20}$, compute the area of the quadrilateral formed by the four tangency points of the largest circle that can fit inside quadrilateral $EFGH$.

On the board, we write the integers $1, 2, 3, \dots, 2019$. At each minute, we pick two numbers on the board $a$ and $b$, delete them, and write down the number $s(a + b)$ instead, where $s(n)$ denotes the sum of the digits of the integer $n$. Let $N$ be the last number on the board at the end. [list=a] [*] Is it possible to get $N = 19$? [*] Is it possible to get $N = 15$? [/list]

We divide the plane in squares shaped of side 1, tracing straight lines parallel bars to the coordinate axles. Each square is painted of black white or. To each as, we recolor all simultaneously squares, in accordance with the following rule: each square $Q$ adopts the color that more appears in the configuration of five squares indicated in the figure. The recoloration process is repeated indefinitely. Determine if exists an initial coloration with black a finite amount of squares such that always has at least one black square, not mattering how many seconds if had passed since the beginning of the process.

Oh no! While playing Mario Party, Theo has landed inside the Bowser Zone. If his next roll is between $1$ and $5$ inclusive, Bowser will shoot his ``Zero Flame" that sets a player's coin and star counts to zero. Fortunately, Theo has a double dice block, which lets him roll two fair $10$-sided dice labeled $1$-$10$ and take the sum of the rolls as his "roll". If he uses his double dice block, what is the probability he escapes the Bowser zone without losing his coins and stars? [i]Proposed by Connor Gordon[/i]

In a company of people some pairs are enemies. A group of people is called [i]unsociable[/i] if the number of members in the group is odd and at least $3$, and it is possible to arrange all its members around a round table so that every two neighbors are enemies. Given that there are at most $2015$ unsociable groups, prove that it is possible to partition the company into $11$ parts so that no two enemies are in the same part. [i]Proposed by Russia[/i]

It is given regular $n$-sided polygon, $n \geq 6$. How many triangles they are inside the polygon such that all of their sides are formed by diagonals of polygon and their vertices are vertices of polygon?

Let $P$ be a polynomial with integer coefficients of degree $d$. For the set $A = \{ a_1, a_2, ..., a_k\}$ of positive integers we denote $S (A) = P (a_1) + P (a_2) + ... + P (a_k )$. The natural numbers $m, n$ are such that $m ^{d+ 1} | n$. Prove that the set $\{1, 2, ..., n\}$ can be subdivided into $m$ disjoint subsets $A_1, A_2, ..., A_m$ with the same number of elements such that $S (A_1) = S(A_2) = ... = S (A_m )$.

Suppose $S=\{1,2,3,...,2017\}$,for every subset $A$ of $S$,define a real number $f(A)\geq 0$ such that: $(1)$ For any $A,B\subset S$,$f(A\cup B)+f(A\cap B)\leq f(A)+f(B)$; $(2)$ For any $A\subset B\subset S$, $f(A)\leq f(B)$; $(3)$ For any $k,j\in S$,$$f(\{1,2,\ldots,k+1\})\geq f(\{1,2,\ldots,k\}\cup \{j\});$$ $(4)$ For the empty set $\varnothing$, $f(\varnothing)=0$. Confirm that for any three-element subset $T$ of $S$,the inequality $$f(T)\leq \frac{27}{19}f(\{1,2,3\})$$ holds.

In the plane, $10^6$ points are marked, no three of which are collinear. All possible segments between them are drawn. Grisha assigned to each drawn segment a real number with absolute value no greater than $1$. For every group of $6$ marked points, he calculated the sum of the numbers on all $15$ connecting segments. It turned out that the absolute value of each such sum is at least \(C\), and there are both positive and negative such sums. What is the maximum possible value of \(C\)?

Let $n \ge 1$ be a fixed positive integer. We consider all the sets $S$ which consist of sub-sequences of the sequence $0, 1,2, ..., n$ satisfying the following conditions: i) If $(a_i)_{i=0}^k$ belongs to $S$, then $a_0 = 0$, $a_k = n$ and $a_{i+1} - a_i \le 2$ for all $0 \le i \le k - 1$. ii) If $(a_i)_{i=0}^k$ and $(b_j)^h_{j=0}$ both belong to $S$, then there exist $0 \le i_0 \le k - 1$ and $0 \le j_0 \le h - 1$ such that $a_{i_0} = b_{j_0}$ and $a_{i_0+1} = b_{j_0+1}$. Find the maximum value of $|S|$ (among all the above-mentioned sets $S$).

$S$ is an infinite set of points in the plane. The distance between any two points of $S$ is integral. Prove that $S$ is a subset of a straight line.

Ephram Chun is a senior and math captain at Lexington High School. He is well-loved by the freshmen, who seem to only listen to him. Other than being the father figure that the freshmen never had, Ephramis also part of the Science Bowl and Science Olympiad teams along with being part of the highest orchestra LHS has to offer. His many hobbies include playing soccer, volleyball, and the many forms of chess. We hope that he likes the questions that we’ve dedicated to him! [b]p1.[/b] Ephram is scared of freshmen boys. How many ways can Ephram and $4$ distinguishable freshmen boys sit together in a row of $5$ chairs if Ephram does not want to sit between $2$ freshmen boys? [b]p2.[/b] Ephram, who is a chess enthusiast, is trading chess pieces on the black market. Pawns are worth $\$100$, knights are worth $\$515$, and bishops are worth $\$396$. Thirty-four minutes ago, Ephrammade a fair trade: $5$ knights, $3$ bishops, and $9$ rooks for $8$ pawns, $2$ rooks, and $11$ bishops. Find the value of a rook, in dollars. [b]p3.[/b] Ephramis kicking a volleyball. The height of Ephram’s kick, in feet, is determined by $$h(t) = - \frac{p}{12}t^2 +\frac{p}{3}t ,$$ where $p$ is his kicking power and $t$ is the time in seconds. In order to reach the height of $8$ feet between $1$ and $2$ seconds, Ephram’s kicking power must be between reals $a$ and $b$. Find is $100a +b$. [b]p4.[/b] Disclaimer: No freshmen were harmed in the writing of this problem. Ephram has superhuman hearing: He can hear sounds up to $8$ miles away. Ephramstands in the middle of a $8$ mile by $24$ mile rectangular grass field. A freshman falls from the sky above a point chosen uniformly and randomly on the grass field. The probability Ephram hears the freshman bounce off the ground is $P\%$. Find $P$ rounded to the nearest integer. [img]https://cdn.artofproblemsolving.com/attachments/4/4/29f7a5a709523cd563f48176483536a2ae6562.png[/img] [b]p5.[/b] Ephram and Brandon are playing a version of chess, sitting on opposite sides of a $6\times 6$ board. Ephram has $6$ white pawns on the row closest to himself, and Brandon has $6$ black pawns on the row closest to himself. During each player’s turn, their only legal move is to move one pawn one square forward towards the opposing player. Pawns cannot move onto a space occupied by another pawn. Players alternate turns, and Ephram goes first (of course). Players take turns until there are no more legal moves for the active player, at which point the game ends. Find the number of possible positions the game can end in. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given three planes and a ball in space. In space, find the number of different ways of placing another ball so that it would be tangent the three given planes and the given ball. It is assumed that the balls can only touch externally.

Cells of a $2000\times2000$ board are colored according to the following rules: 1)At any moment a cell can be colored, if none of its neighbors are colored 2)At any moment a $1\times2$ rectangle can be colored, if exactly two of its neighbors are colored. 3)At any moment a $2\times2$ squared can be colored, if 8 of its neighbors are colored (Two cells are considered to be neighboring, if they share a common side). Can the entire $2000\times2000$ board be colored? [I]Proposed by K. Kohas[/i]

Let $N_7$ be the answer to problem 7. Each side of a regular $N_7$-gon is colored with a single color from a set of two given colors. Two colorings that can be obtained from one another by a rotation or a reflection of the entire figure are considered the same. Compute the number of possible different colorings.

The positive integers are partitioned into two infinite sets so that the sum of any $2023$ distinct integers in one set is also in that set. Prove that one set contains all the odd positive integers, and one set contains all the even positive integers. [i]Proposed by Evan Chang (squareman), USA[/i]

On the blackboard are written the $400$ integers $1, 2, 3, \cdots , 399, 400$. Luis erases $100$ of these numbers, then Martin erases another $100$. Martin wins if the sum of the $200$ erased numbers equals the sum of those not deleted; otherwise, he wins Luis. Which of the two has a winning strategy? What if Luis deletes $101$ numbers and Martín deletes $99$? In each case, explain how the player with the winning strategy can ensure victory.

Let $2561$ given points on a circle be colored either red or green. In each step, all points are recolored simultaneously in the following way: if both direct neighbors of a point $P$ have the same color as $P$, then the color of $P$ remains unchanged, otherwise $P$ obtains the other color. Starting with the initial coloring $F_1$, we obtain the colorings $F_2, F_3,\dots$ after several recoloring steps. Determine the smallest number $n$ such that, for any initial coloring $F_1$, we must have $F_n = F_{n+2}$.

The Olcommunity consists of the next seven people: Christopher Took, Humberto Brandybuck, German son of Isildur, Leogolas, Argimli, Samzamora and Shago Baggins. This community needs to travel from the Olcomashire to Olcomordor to save the world. Each person can take with them a total of $4$ day-provisions, that can be transferred to other people that are on the same day of traveling, as long as nobody holds more than $4$ day-provisions at the time. If a person returns to Olcomashire, they will be too tired to go out again. What is the farthest away Olcomordor can be from Olcomashire, so that Shago Baggins can get to Olcomordor, and the rest of the Olcommunity can return save to Olcomashire? Note: All the members of the Olcommunity should eat exactly one day-provision while they are away from Olcomashire. The members only travel an integer number of days on each direction. Members of the Olcommunity may leave Olcomashire on different days.

Given a regular hexagon with a side of $100$. Each side is divided into one hundred equal parts. Through the division points and vertices of the hexagon, all sorts of straight lines parallel to its sides are drawn. These lines divided the hexagon into single regular triangles. Consider covering a hexagon with equal rhombuses. Each rhombus is made up of two triangles. (These rhombuses cover the entire hexagon and do not overlap.) Among the lines that form our grid, we select those that intersect exactly to the rhombuses (intersect diagonally). How many such lines will there be if: a) $k = 101$; b) $k = 100$; c) $k = 87$?

A cake is prepared for a dinner party to which only $p$ or $q$ persons will come ($p$ and $q$ are given co-prime integers). Find the minimum number of pieces (not necessarily equal) into which the cake must be cut in advance so that the cake may be equally shared between the persons in either case. (D. Fomin, Leningrad)

A mysterious machine contains a secret combination of $2016$ integer numbers $x_1,x_2,\ldots,x_{2016}$. It is known that all the numbers in the combination are equal but one. One may ask questions to the machine by giving to it a sequence of $2016$ integer numbers $y_1,\ldots,y_{2016}$, and the machine answers by telling the value of the sum \[ x_1y_1+\dots+x_{2016}y_{2016}. \] After answering the first question, the machine accepts a second question and then a third one, and so on. Determine how many questions are necessary to determine the combination: (a) knowing that the number which is different from the others is equal to zero; (b) not knowing what the number different from the others is.