[u]Round 1[/u] [b]p1.[/b] Compute $(1 - 2(3 - 4(5 - 6)))(7 - (8 - 9))$. [b]p2.[/b] How many numbers are in the set $\{20, 21, 22, ..., 88, 89\}$? [b]p3.[/b] Three times the complement of the supplement of an angle is equal to $60$ degrees less than the angle itself. Find the measure of the angle in degrees. [u]Round 2[/u] [b]p4.[/b] A positive number is decreased by $10\%$, then decreased by $20\%$, and finally increased by $30\%$. By what percent has this number changed from the original? Give a positive answer for a percent increase and a negative answer for a percent decrease. [b]p5.[/b] What is the area of the triangle with vertices at $(2, 3)$, $(8, 11)$, and $(13, 3)$? [b]p6.[/b] There are three bins, each containing red, green, and/or blue pens. The first bin has $0$ red, $0$ green, and $3$ blue pens, the second bin has $0$ red, $2$ green, and $4$ blue pens, and the final bin has $1$ red, $5$ green, and $6$ blue pens. What is the probability that if one pen is drawn from each bin at random, one of each color pen will be drawn? [u]Round 3[/u] [b]p7.[/b] If a and b are positive integers and $a^2 - b^2 = 23$, what is the value of $a$? [b]p8.[/b] Find the prime factorization of the greatest common divisor of $2^3\cdot 3^2\cdot 5^5\cdot 7^4$ and $2^4\cdot 3^1\cdot 5^2\cdot 7^6$. [b]p9.[/b] Given that $$a + 2b + 3c = 5$$ $$2a + 3b + c = -2$$ $$3a + b + 2c = 3,$$ find $3a + 3b + 3c$. [u]Round 4[/u] [b]p10.[/b] How many positive integer divisors does $11^{20}$ have? [b]p11.[/b] Let $\alpha$ be the answer to problem $10$. Find the real value of $x$ such that $2^{x-5} = 64^{x/\alpha}$. [b]p12.[/b] Let $\beta$ be the answer to problem $11$. Triangle $LMT$ has a right angle at $M$, $LM = \beta$, and $LT = 4\beta - 3$. If $Z$ is the midpoint of $LT$, what is the length$ MZ$? PS. You should use hide for answers. Rounds 5-8 are [url=https://artofproblemsolving.com/community/c3h3133709p28395558]here[/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3134133p28400917]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

We draw $n$ convex quadrilaterals in the plane. They divide the plane into regions (one of the regions is infinite). Determine the maximal possible number of these regions.

Is it possible to partition $3$-dimensional Euclidean space into $1979$ mutually isometric subsets?

How many ways are there to color the vertices of a cube red, blue, or green such that no edge connects two vertices of the same color? Rotations and reflections are considered distinct colorings.

[u]Round 5[/u] [i]Each of the three problems in this round depends on the answer to two of the other problems. There is only one set of correct answers to these problems; however, each problem will be scored independently, regardless of whether the answers to the other problems are correct. [/i] [b]p13.[/b] Let $B$ be the answer to problem $14$, and let $C$ be the answer to problem $15$. A quadratic function $f(x)$ has two real roots that sum to $2^{10} + 4$. After translating the graph of $f(x)$ left by $B$ units and down by $C$ units, the new quadratic function also has two real roots. Find the sum of the two real roots of the new quadratic function. [b]p14.[/b] Let $A$ be the answer to problem $13$, and let $C$ be the answer to problem $15$. In the interior of angle $\angle NOM = 45^o$, there is a point $P$ such that $\angle MOP = A^o$ and $OP = C$. Let $X$ and $Y$ be the reflections of $P$ over $MO$ and $NO$, respectively. Find $(XY)^2$. [b]p15.[/b] Let $A$ be the answer to problem $13$, and let $B$ be the answer to problem $14$. Totoro hides a guava at point $X$ in a flat field and a mango at point $Y$ different from $X$ such that the length $XY$ is $B$. He wants to hide a papaya at point $Z$ such that $Y Z$ has length $A$ and the distance $ZX$ is a nonnegative integer. In how many different locations can he hide the papaya? [u]Round 6[/u] [b]p16.[/b] Let $ABCD$ be a trapezoid such that $AB$ is parallel to $CD$, $AB = 4$, $CD = 8$, $BC = 5$, and $AD = 6$. Given that point $E$ is on segment $CD$ and that $AE$ is parallel to $BC$, find the ratio between the area of trapezoid $ABCD$ and the area of triangle $ABE$. [b]p17.[/b] Find the maximum possible value of the greatest common divisor of $\overline{MOO}$ and $\overline{MOOSE}$, given that $S$, $O$, $M$, and $E$ are some nonzero digits. (The digits $S$, $O$, $M$, and $E$ are not necessarily pairwise distinct.) [b]p18.[/b] Suppose that $125$ politicians sit around a conference table. Each politician either always tells the truth or always lies. (Statements of a liar are never completely true, but can be partially true.) Each politician now claims that the two people beside them are both liars. Suppose that the greatest possible number of liars is $M$ and that the least possible number of liars is $N$. Determine the ordered pair $(M,N)$. [u]Round 7[/u] [b]p19.[/b] Define a [i]lucky [/i] number as a number that only contains $4$s and $7$s in its decimal representation. Find the sum of all three-digit lucky numbers. [b]p20.[/b] Let line segment $AB$ have length $25$ and let points $C$ and $D$ lie on the same side of line $AB$ such that $AC = 15$, $AD = 24$, $BC = 20$, and $BD = 7$. Given that rays $AC$ and $BD$ intersect at point $E$, compute $EA + EB$. [b]p21.[/b] A $3\times 3$ grid is filled with positive integers and has the property that each integer divides both the integer directly above it and directly to the right of it. Given that the number in the top-right corner is $30$, how many distinct grids are possible? [u]Round 8[/u] [b]p22.[/b] Define a sequence of positive integers $s_1, s_2, ... , s_{10}$ to be [i]terrible [/i] if the following conditions are satisfied for any pair of positive integers $i$ and $j$ satisfying $1 \le i < j \le 10$: $\bullet$ $s_i > s_j $ $\bullet$ $j - i + 1$ divides the quantity $s_i + s_{i+1} + ... + s_j$ Determine the minimum possible value of $s_1 + s_2 + ...+ s_{10}$ over all terrible sequences. [b]p23.[/b] The four points $(x, y)$ that satisfy $x = y^2 - 37$ and $y = x^2 - 37$ form a convex quadrilateral in the coordinate plane. Given that the diagonals of this quadrilateral intersect at point $P$, find the coordinates of $P$ as an ordered pair. [b]p24.[/b] Consider a non-empty set of segments of length $1$ in the plane which do not intersect except at their endpoints. (In other words, if point $P$ lies on distinct segments $a$ and $b$, then $P$ is an endpoint of both $a$ and $b$.) This set is called $3$-[i]amazing [/i] if each endpoint of a segment is the endpoint of exactly three segments in the set. Find the smallest possible size of a $3$-amazing set of segments. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2934024p26255963]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

We have a $n\times n$ table and we’ve written numbers $0,+1 \ or \ -1$ in each $1\times1$ square such that in every row or column, there is only one $+1$ and one $-1$. Prove that by swapping the rows with each other and the columns with each other finitely, we can swap $+1$s with $-1$s.

Find all positive integers $ n$ for which the numbers in the set $ S \equal{} \{1,2, \ldots,n \}$ can be colored red and blue, with the following condition being satisfied: The set $ S \times S \times S$ contains exactly $ 2007$ ordered triples $ \left(x, y, z\right)$ such that: [b](i)[/b] the numbers $ x$, $ y$, $ z$ are of the same color, and [b](ii)[/b] the number $ x \plus{} y \plus{} z$ is divisible by $ n$. [i]Author: Gerhard Wöginger, Netherlands[/i]

A $3000\times 3000$ square is tiled by dominoes (i. e. $1\times 2$ rectangles) in an arbitrary way. Show that one can color the dominoes in three colors such that the number of the dominoes of each color is the same, and each dominoe $d$ has at most two neighbours of the same color as $d$. (Two dominoes are said to be [i]neighbours[/i] if a cell of one domino has a common edge with a cell of the other one.)

Let $a_n=1+n!(\frac{1}{0!}+\frac{1}{1!}+\frac{1}{2!}+...+\frac{1}{n!})$ for any $n\in \mathbb{Z}^{+}$. Consider $a_n$ points in the plane,no $3$ of them collinear.The segments between any $2$ of them are colored in one of $n$ colors. Prove that among them there exist $3$ points forming a monochromatic triangle.

[b]p1[/b]. Points $P_1,P_2,P_3,... ,P_n$ lie on a plane such that $P_aP_b = 1$,$P_cP_d = 2$, and $P_eP_f = 2018$ for not necessarily distinct indices $a,b,c,d,e, f \in \{1, 2,... ,n\}$. Find the minimum possible value of $n$. [b]p2.[/b] Find the coefficient of the $x^2y^4$ term in the expansion of $(3x +2y)^6$. [b]p3.[/b] Find the number of positive integers $n < 1000$ such that $n$ is a multiple of $27$ and the digit sum of $n$ is a multiple of $11$. [b]p4.[/b] How many times do the minute hand and hour hand of a $ 12$-hour analog clock overlap in a $366$-day leap year? [b]p5.[/b] Find the number of ordered triples of integers $(a,b,c)$ such that $(a +b)(b +c)(c + a) = 2018$. [b]p6.[/b] Let $S$ denote the set of the first $2018$ positive integers. Call the score of a subset the sum of its maximal element and its minimal element. Find the sum of score $(x)$ over all subsets $s \in S$ [b]p7.[/b] How many ordered pairs of integers $(a,b)$ exist such that $1 \le a,b \le 20$ and $a^a$ divides $b^b$? [b]p8.[/b] Let $f$ be a function such that for every non-negative integer $p$, $f (p)$ equals the number of ordered pairs of positive integers $(a,n)$ such that $a^n = a^p \cdot n$. Find $\sum^{2018}_{p=0}f (p)$. [b]p9.[/b] A point $P$ is randomly chosen inside a regular octagon $A_1A_2A_3A_4A_5A_6A_7A_8$. What is the probability that the projections of $P$ onto the lines $\overleftrightarrow{A_i A_{i+1}}$ for $i = 1,2,... ,8$ lie on the segments $\overline{A_iA_{i+1}}$ for $i = 1,2,... ,8$ (where indices are taken $mod \,\, 8$)? [b]p10. [/b]A person keeps flipping an unfair coin until it flips $3$ tails in a row. The probability of it landing on heads is $\frac23$ and the probability it lands on tails is $\frac13$ . What is the expected value of the number of the times the coin flips? PS. You had better use hide for answers.

In Mexico City, to limit traffic flow, each private car is set two days of the week on which it cannot go out onto the city streets. A family needs to have at least 10 cars at its disposal every day. What is the smallest number of cars can get by with the seven if its members can choose forbidden days for your cars?

Alice, Bob, Cindy, David, and Emily sit in a circle. Alice refuses to sit to the right of Bob, and Emily sits next to Cindy. If David sits next to two girls, determine who could sit immediately to the right of Alice.

Vitya cut the chessboard along the borders of the cells into pieces of the same perimeter. It turned out that not all of the received parts are equal. What is the largest possible number of parts that Vitya could get?

On each of the 2006 cards a natural number is written. Cards are placed arbitrarily in a row. 2 players take in turns a card from any end of the row until all the cards are taken. After that each player calculates sum of the numbers written of his cards. If the sum of the first player is not less then the sum of the second one then the first player wins. Show that there's a winning strategy for the first player.

Let $N$ be an integer, $N>2$. Arnold and Bernold play the following game: there are initially $N$ tokens on a pile. Arnold plays first and removes $k$ tokens from the pile, $1\le k < N$. Then Bernold removes $m$ tokens from the pile, $1\le m\le 2k$ and so on, that is, each player, on its turn, removes a number of tokens from the pile that is between $1$ and twice the number of tokens his opponent took last. The player that removes the last token wins. For each value of $N$, find which player has a winning strategy and describe it.

Let $n$ be a positive integer. Define a chameleon to be any sequence of $3n$ letters, with exactly $n$ occurrences of each of the letters $a, b,$ and $c$. Define a swap to be the transposition of two adjacent letters in a chameleon. Prove that for any chameleon $X$ , there exists a chameleon $Y$ such that $X$ cannot be changed to $Y$ using fewer than $3n^2/2$ swaps.

For a class of $20$ students several field trips were arranged. In each trip at least four students participated. Prove that there was a field trip such that each student who participated in it took part in at least $1/17$-th of all field trips.

In a sequence $a_1, a_2, . . . , a_{1000}$ consisting of $1000$ distinct numbers a pair $(a_i, a_j )$ with $i < j$ is called [i]ascending [/i] if $a_i < a_j$ and [i]descending[/i] if $a_i > a_j$ . Determine the largest positive integer $k$ with the property that every sequence of $1000$ distinct numbers has at least $k$ non-overlapping ascending pairs or at least $k$ non-overlapping descending pairs.

Determine all pairs of $(m, n)$ such that is possible to tile the table $ m \times n$ with figure ”corner” as in figure with condition that in that tilling does not exist rectangle (except $m \times n$) regularly covered with figures.

Finite number of $2017$ units long sticks are fixed on a plate. Each stick has a bead that can slide up and down on it. Beads can only stand on integer heights $( 1, 2, 3,..., 2017 )$. Some of the bead pairs are connected with elastic bands. $The$ $young$ $ant$ can go to every bead, starting from any bead by using the elastic bands. $The$ $old$ $ant$ can use an elastic band if the difference in height of the beads which are connected by the band, is smaller than or equal to $1$. If the heights of the beads which are connected to each other are different, we call it $valid$ $situation$. If there exists at least one $valid$ $situation$, prove that we can create a $valid$ $situation$, by arranging the heights of the beads, in which $the$ $old$ $ant$ can go to every bead, starting from any bead.

The vertices of 100-gon (i.e., polygon with 100 sides) are colored alternately white or black. One of the vertices contains a checker. Two players in turn do two things: move the checker into other vertice along the side of 100-gon and then erase some side. The game ends when it is impossible to move the checker. At the end of the game if the checker is in the white vertice then the first player wins. Otherwise the second player wins. Does any of the players have winning strategy? If yes, then who? [i]Remark.[/i] The answer may depend on initial position of the checker.

At a math contest there are $2n$ students participating. Each of them submits a problem to the jury, which thereafter gives each students one of the $2n$ problems submitted. One says that the contest is [i]fair[/i] is there are $n$ participants which receive their problems from the other $n$ participants. Prove that the number of distributions of the problems in order to obtain a fair contest is a perfect square.

How many ways can we pick four $3$-element subsets of $\{1, 2, ..., 6\}$ so that each pair of subsets share exactly one element?

A subsum of $n$ real numbers $a_1,\dots,a_n$ is a sum of elements of a subset of the set $\{a_1,\dots,a_n\}$. In other words a subsum is $\epsilon_1a_1+\dots+\epsilon_na_n$ in which for each $1\leq i \leq n$ ,$\epsilon_i$ is either $0$ or $1$. Years ago, there was a valuable list containing $n$ real not necessarily distinct numbers and their $2^n-1$ subsums. Some mysterious creatures from planet Tarator has stolen the list, but we still have the subsums. (a) Prove that we can recover the numbers uniquely if all of the subsums are positive. (b) Prove that we can recover the numbers uniquely if all of the subsums are non-zero. (c) Prove that there's an example of the subsums for $n=1392$ such that we can not recover the numbers uniquely. Note: If a subsum is sum of element of two different subsets, it appears twice. Time allowed for this question was 75 minutes.

Maria and Bilyana play the following game. Maria has $2024$ fair coins and Bilyana has $2023$ fair coins. They toss every coin they have. Maria wins if she has strictly more heads than Bilyana, otherwise Bilyana wins. What is the probability of Maria winning this game?