[u]Round 5[/u] [b]p13.[/b] Find all ordered pairs of real numbers $(x, y)$ satisfying the following equations: $$\begin{cases} \dfrac{1}{xy} + \dfrac{y}{x}= 2 \\ \dfrac{1}{xy^2} + \dfrac{y^2}{x} = 7 \end{cases}$$ [b]p14.[/b] An egg plant is a hollow prism of negligible thickness, with height $2$ and an equilateral triangle base. Inside the egg plant, there is enough space for four spherical eggs of radius $1$. What is the minimum possible volume of the egg plant? [b]p15.[/b] How many ways are there for Farmer James to color each square of a $2\times 6$ grid with one of the three colors eggshell, cream, and cornsilk, so that no two adjacent squares are the same color? [u]Round 6[/u] [b]p16.[/b] In a triangle $ABC$, $\angle A = 45^o$, and let $D$ be the foot of the perpendicular from $A$ to segment $BC$. $BD = 2$ and $DC = 4$. Let $E$ be the intersection of the line $AD$ and the perpendicular line from $B$ to line $AC$. Find the length of $AE$. [b]p17.[/b] Find the largest positive integer $n$ such that there exists a unique positive integer $m$ satisfying $$\frac{1}{10} \le \frac{m}{n} \le \frac19$$ [b]p18.[/b] How many ordered pairs $(A,B)$ of positive integers are there such that $A+B = 10000$ and the number $A^2 + AB + B$ has all distinct digits in base $10$? [u]Round 7[/u] [b]p19.[/b] Pentagon $JAMES$ satisfies $JA = AM = ME = ES = 2$. Find the maximum possible area of $JAMES$. [b]p20.[/b] $P(x)$ is a monic polynomial (a polynomial with leading coecient $1$) of degree $4$, such that $P(2^n+1) =8^n + 1$ when $n = 1, 2, 3, 4$. Find the value of $P(1)$. [b]p21[/b]. PEAcock and Zombie Hen Hao are at the starting point of a circular track, and start running in the same direction at the same time. PEAcock runs at a constant speed that is $2018$ times faster than Zombie Hen Hao's constant speed. At some point in time, Farmer James takes a photograph of his two favorite chickens, and he notes that they are at different points along the track. Later on, Farmer James takes a second photograph, and to his amazement, PEAcock and Zombie Hen Hao have now swapped locations from the first photograph! How many distinct possibilities are there for PEAcock and Zombie Hen Hao's positions in Farmer James's first photograph? (Assume PEAcock and Zombie Hen Hao have negligible size.) [u]Round 8[/u] [b]p22.[/b] How many ways are there to scramble the letters in $EGGSEATER$ such that no two consecutive letters are the same? [b]p23.[/b] Let $JAMES$ be a regular pentagon. Let $X$ be on segment $JA$ such that $\frac{JX}{XA} = \frac{XA}{JA}$ . There exists a unique point $P$ on segment $AE$ such that $XM = XP$. Find the ratio $\frac{AE}{PE}$ . [b]p24.[/b] Find the minimum value of the function $$f(x) = \left|x - \frac{1}{x} \right|+ \left|x - \frac{2}{x} \right| + \left|x - \frac{3}{x} \right|+... + \left|x - \frac{9}{x} \right|+ \left|x - \frac{10}{x} \right|$$ over all nonzero real numbers $x$. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2949191p26406082]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n > 10$ be an odd integer. Determine the number of ways to place the numbers $1, 2, \ldots , n$ around a circle so that each number in the circle divides the sum its two neighbors. (Two configurations such that one can be obtained from the other per rotation are to be counted only once.)

In a permutation $(x_1, x_2, \dots , x_n)$ of the set $1, 2, \dots , n$ we call a pair $(x_i, x_j )$ discordant if $i < j$ and $x_i > x_j$. Let $d(n, k)$ be the number of such permutations with exactly $k$ discordant pairs. Find $d(n, 2)$ and $d(n, 3).$

Sitting at a desk, Alice writes a nonnegative integer $N$ on a piece of paper, with $N \le 10^{10}$. Interestingly, Celia, sitting opposite Alice at the desk, is able to properly read the number upside-down and gets the same number $N$, without any leading zeros. (Note that the digits 2, 3, 4, 5, and 7 will not be read properly when turned upside-down.) Find the number of possible values of $N$. [i]Proposed by Yannick Yao[/i]

A positive integer $n\geq 2$ and a set $S$ consisting of $2n$ disting positive integers smaller or equal to $n^2$ are given. Prove that there exists a positive integer $r\in \{1, 2, ..., n\}$ that can be written in the form $r=a-b$, for $a, b\in \mathbb{S}$ in at least $3$ different ways.

There is a lamp in space.(Consider lamp a point) Do there exist finite number of equal sphers in space that the light of the lamp can not go to the infinite?(If a ray crash in a sphere it stops)

All arrangements of letters $VNNWHTAAIE$ are listed in lexicographic (dictionary) order. If $AAEHINNTVW$ is the first entry, what entry number is $VANNAWHITE$?

$n$ lines are given in the plane so that no three of them concur and no two are parallel. Show that there is a non-self-intersecting path consisting of $n$ straight segments so that each of the given lines contains exactly one of the segments of the path.

What is the minimum number of squares that is necessary to draw on a white sheet to obtain a square grid of side $n$?

On a bookcase there are $ n \geq 3$ books side by side by different authors. A librarian considers the first and second book from left and exchanges them iff they are not alphabetically sorted. Then he is doing the same operation with the second and third book from left etc. Using this procedure he iterates through the bookcase three times from left to right. Considering all possible initial book configurations how many of them will then be alphabetically sorted?

In an election between $\text{A}$ and $\text{B}$, during the counting of the votes, neither candidate was more than $2$ votes ahead, and the vote ended in a tie, $6$ votes to $6$ votes. Two votes for the same candidate are indistinguishable. In how many orders could the votes have been counted? One possibility is $\text{AABBABBABABA}$.

A pawn is put on each of $2n$ arbitrary selected cells of an $n\times n$ board ($n>1$). Prove that there are four cells that are marked with pawns and whose centers form a parallelogram.

[u]Round 1[/u] [b]1.1.[/b] Suppose a certain menu has $3$ sandwiches and $5$ drinks. How many ways are there to pick a meal so that you have exactly a drink and a sandwich? [b]1.2.[/b] If $a + b = 4$ and $a + 3b = 222222$, find $10a + b$. [b]1.3.[/b] Compute $$\left\lfloor \frac{2019 \cdot 2017}{2018} \right\rfloor $$ where $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$. [u]Round 2[/u] [b]2.1.[/b] Andrew has $10$ water bottles, each of which can hold at most $10$ cups of water. Three bottles are thirty percent filled, five are twenty-four percent filled, and the rest are empty. What is the average amount of water, in cups, contained in the ten water bottles? [b]2.2.[/b] How many positive integers divide $195$ evenly? [b]2.3.[/b] Square $A$ has side length $\ell$ and area $128$. Square $B$ has side length $\ell/2$. Find the length of the diagonal of Square $B$. [u]Round 3[/u] [b]3.1.[/b] A right triangle with area $96$ is inscribed in a circle. If all the side lengths are positive integers, what is the area of the circle? Express your answer in terms of $\pi$. [b]3.2.[/b] A circular spinner has four regions labeled $3, 5, 6, 10$. The region labeled $3$ is $1/3$ of the spinner, $5$ is $1/6$ of the spinner, $6$ is $1/10$ of the spinner, and the region labeled $10$ is $2/5$ of the spinner. If the spinner is spun once randomly, what is the expected value of the number on which it lands? [b]3.3.[/b] Find the integer k such that $k^3 = 8353070389$ [u]Round 4[/u] [b]4.1.[/b] How many ways are there to arrange the letters in the word [b]zugzwang [/b] such that the two z’s are not consecutive? [b]4.2.[/b] If $O$ is the circumcenter of $\vartriangle ABC$, $AD$ is the altitude from $A$ to $BC$, $\angle CAB = 66^o$ and $\angle ABC = 44^o$, then what is the measure of $\angle OAD$ ? [b]4.3.[/b] If $x > 0$ satisfies $x^3 +\frac{1}{x^3} = 18$, find $x^5 +\frac{1}{x^5}$ [u]Round 5[/u] [b]5.1.[/b] Let $C$ be the answer to Question $3$. Neethen decides to run for school president! To be entered onto the ballot, however, Neethen needs $C + 1$ signatures. Since no one else will support him, Neethen gets the remaining $C$ other signatures through bribery. The situation can be modeled by $k \cdot N = 495$, where $k$ is the number of dollars he gives each person, and $N$ is the number of signatures he will get. How many dollars does Neethen have to bribe each person with to get exactly C signatures? [b]5.2.[/b] Let $A$ be the answer to Question $1$. With $3A - 1$ total votes, Neethen still comes short in the election, losing to Serena by just $1$ vote. Darn! Neethen sneaks into the ballot room, knowing that if he destroys just two ballots that voted for Serena, he will win the election. How many ways can Neethen choose two ballots to destroy? [b]5.3.[/b] Let $B$ be the answer to Question $2$. Oh no! Neethen is caught rigging the election by the principal! For his punishment, Neethen needs to run the perimeter of his school three times. The school is modeled by a square of side length $k$ furlongs, where $k$ is an integer. If Neethen runs $B$ feet in total, what is $k + 1$? (Note: one furlong is $1/8$ of a mile). [u]Round 6[/u] [b]6.1.[/b] Find the unique real positive solution to the equation $x =\sqrt{6 + 2\sqrt6 + 2x}- \sqrt{6 - 2\sqrt6 - 2x} -\sqrt6$. [b]6.2.[/b] Consider triangle ABC with $AB = 13$ and $AC = 14$. Point $D$ lies on $BC$, and the lengths of the perpendiculars from $D$ to $AB$ and $AC$ are both $\frac{56}{9}$. Find the largest possible length of $BD$. [b]6.3.[/b] Let $f(x, y) = \frac{m}{n}$, where $m$ is the smallest positive integer such that $x$ and $y$ divide $m$, and $n$ is the largest positive integer such that $n$ divides both $x$ and $y$. If $S = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\}$, what is the median of the distinct values that $f(a, b)$ can take, where $a, b \in S$? [u]Round 7[/u] [b]7.1.[/b] The polynomial $y = x^4 - 22x^2 - 48x - 23$ can be written in the form $$y = (x - \sqrt{a} - \sqrt{b} - \sqrt{c})(x - \sqrt{a} +\sqrt{b} +\sqrt{c})(x +\sqrt{a} -\sqrt{b} +\sqrt{c})(x +\sqrt{a} +\sqrt{b} -\sqrt{c})$$ for positive integers $a, b, c$ with $a \le b \le c$. Find $(a + b)\cdot c$. [b]7.2.[/b] Varun is grounded for getting an $F$ in every class. However, because his parents don’t like him, rather than making him stay at home they toss him onto a number line at the number $3$. A wall is placed at $0$ and a door to freedom is placed at $10$. To escape the number line, Varun must reach 10, at which point he walks through the door to freedom. Every $5$ minutes a bell rings, and Varun may walk to a different number, and he may not walk to a different number except when the bell rings. Being an $F$ student, rather than walking straight to the door to freedom, whenever the bell rings Varun just randomly chooses an adjacent integer with equal chance and walks towards it. Whenever he is at $0$ he walks to $ 1$ with a $100$ percent chance. What is the expected number of times Varun will visit $0$ before he escapes through the door to freedom? [b]7.3.[/b] Let $\{a_1, a_2, a_3, a_4, a_5, a_6\}$ be a set of positive integers such that every element divides $36$ under the condition that $a_1 < a_2 <... < a_6$. Find the probability that one of these chosen sets also satisfies the condition that every $a_i| a_j$ if $i|j$. [u]Round 8[/u] [b]8.[/b] How many numbers between $1$ and $100, 000$ can be expressed as the product of at most $3$ distinct primes? Your answer will be scored according to the following formula, where $X$ is the correct answer and $I$ is your input. $$max \left\{ 0, \left\lceil min \left\{13 - \frac{|I-X|}{0.1 |I|}, 13 - \frac{|I-X|}{0.1 |I-2X|} \right\} \right\rceil \right\}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n\geq 3$ a positive integer. In each cell of a $n\times n$ chessboard one must write $1$ or $2$ in such a way the sum of all written numbers in each $2\times 3$ and $3\times 2$ sub-chessboard is even. How many different ways can the chessboard be completed?

Do there exist a circle and an infinite set of points on it such that the distance between any two of the points is rational?

In a $10 \times 10$ table some cells(at least one) are marked such that in every $3 \times 3$ subtable an even number of cells are marked. What is the minimal possible amount of marked cells?

Let $n$ be a positive integer. Consider the sum $x_1y_1 + x_2y_2 +\cdots + x_ny_n$, where that values of the variables $x_1, x_2,\ldots, x_n, y_1, y_2,\ldots, y_n$ are either 0 or 1. Let $I(n)$ be the number of 2$n$-tuples $(x_1, x_2,\ldots, x_n, y_1, y_2,\ldots, y_n)$ such that the sum of the number is odd, and let $P(n)$ be the number of 2$n$-tuples $(x_1, x_2,\ldots, x_n, y_1, y_2,\ldots, y_n)$ such that the sum is an even number. Show that: \[ \frac{P(n)}{I(n)}=\frac{2^n+1}{2^n-1} \]

A machine gives out five pennies for each nickel inserted into it and five nickels for each penny. Can Peter , who starts out with one penny, use the machine several times in such a way as to end up with an equal number of nickels and pennies? (F. Nazarov, Leningrad Olympiad, 1987)

Consider $ 16 $ pairwise distinct natural numbers smaller than $ 1597. $ [b]a)[/b] Prove that among these, there are three numbers having the property that the sum of any two of them is bigger than the third. [b]b)[/b] If one of these numbers is $ 1597, $ is still true the fact from subpoint [b]a)[/b]? [i]Teodor Radu[/i]

A physicist encounters $2015$ atoms called usamons. Each usamon either has one electron or zero electrons, and the physicist can't tell the difference. The physicist's only tool is a diode. The physicist may connect the diode from any usamon $A$ to any other usamon $B$. (This connection is directed.) When she does so, if usamon $A$ has an electron and usamon $B$ does not, then the electron jumps from $A$ to $B$. In any other case, nothing happens. In addition, the physicist cannot tell whether an electron jumps during any given step. The physicist's goal is to isolate two usamons that she is sure are currently in the same state. Is there any series of diode usage that makes this possible? [i]Proposed by Linus Hamilton[/i]

Let $ p$ and $ q$ be relatively prime positive integers. A subset $ S$ of $ \{0, 1, 2, \ldots \}$ is called [b]ideal[/b] if $ 0 \in S$ and for each element $ n \in S,$ the integers $ n \plus{} p$ and $ n \plus{} q$ belong to $ S.$ Determine the number of ideal subsets of $ \{0, 1, 2, \ldots \}.$

Consider an arrangement of tokens in the plane, not necessarily at distinct points. We are allowed to apply a sequence of moves of the following kind: select a pair of tokens at points $A$ and $B$ and move both of them to the midpoint of $A$ and $B$. We say that an arrangement of $n$ tokens is [i]collapsible[/i] if it is possible to end up with all $n$ tokens at the same point after a finite number of moves. Prove that every arrangement of $n$ tokens is collapsible if and only if $n$ is a power of $2$.

$n$ real numbers are written in increasing order in a line. The same numbers are written in the second line below in unknown order. The third line contains the sums of the pairs of numbers above from two previous lines. It comes out, that the third line is arranged in increasing order. Prove that the second line coincides with the first one.

Alice and Bob play a game where they start from a complete graph with $n$ vertices and take turns removing a single edge from the graph, with Alice taking the first turn. The first player to disconnect the graph loses. Compute the sum of all $n$ between $2$ and $100$ inclusive such that Alice has a winning strategy. (A complete graph is one where there is an edge between every pair of vertices.)

The bell number $b_n$ is the number of ways to partition the set $\{1,2,\ldots,n\}$. For example $b_3=5$. Find a recurrence for $b_n$ and show that $b_n=e^{-1}\sum_{k\geq 0} \frac{k^n}{k!}$. Using a combinatorial proof show that the number of ways to partition $\{1,2,\ldots,n\}$, such that now two consecutive numbers are in the same block, is $b_{n-1}$.