[u]Round 1[/u] [b]p1.[/b] How many distinct ways are there to scramble the letters in $EXETER$? [b]p2.[/b] Given that $\frac{x - y}{x - z}= 3$, find $\frac{x - z}{y - z}$. [b]p3.[/b] When written in base $10$, $9^9 =\overline{ABC420DEF}.$ Find the remainder when $A + B + C + D + E + F$ is divided by $9$. [u]Round 2[/u] [b]p4.[/b] How many positive integers, when expressed in base $7$, have exactly $3$ digits, but don't contain the digit $3$? [b]p5.[/b] Pentagon $JAMES$ is such that its internal angles satisfy $\angle J = \angle A = \angle M = 90^o$ and $\angle E = \angle S$. If $JA = AM = 4$ and $ME = 2$, what is the area of $JAMES$? [b]p6.[/b] Let $x$ be a real number such that $x = \frac{1+\sqrt{x}}{2}$ . What is the sum of all possible values of $x$? [u]Round 3[/u] [b]p7.[/b] Farmer James sends his favorite chickens, Hen Hao and PEAcock, to compete at the Fermi Estimation All Star Tournament (FEAST). The first problem at the FEAST requires the chickens to estimate the number of boarding students at Eggs-Eater Academy given the number of dorms $D$ and the average number of students per dorm $A$. Hen Hao rounds both $D$ and $A$ down to the nearest multiple of $10$ and multiplies them, getting an estimate of $1200$ students. PEAcock rounds both $D$ and $A$ up to the nearest multiple of $10$ and multiplies them, getting an estimate of $N$ students. What is the maximum possible value of $N$? [b]p8.[/b] Farmer James has decided to prepare a large bowl of egg drop soup for the Festival of Eggs-Eater Annual Soup Tasting (FEAST). To flavor the soup, Hen Hao drops eggs into it. Hen Hao drops $1$ egg into the soup in the first hour, $2$ eggs into the soup in the second hour, and so on, dropping $k$ eggs into the soup in the $k$th hour. Find the smallest positive integer $n$ so that after exactly n hours, Farmer James finds that the number of eggs dropped in his egg drop soup is a multiple of $200$. [b]p9.[/b] Farmer James decides to FEAST on Hen Hao. First, he cuts Hen Hao into $2018$ pieces. Then, he eats $1346$ pieces every day, and then splits each of the remaining pieces into three smaller pieces. How many days will it take Farmer James to eat Hen Hao? (If there are fewer than $1346$ pieces remaining, then Farmer James will just eat all of the pieces.) [u]Round 4[/u] [b]p10.[/b] Farmer James has three baskets, and each basket has one magical egg. Every minute, each magical egg disappears from its basket, and reappears with probability $\frac12$ in each of the other two baskets. Find the probability that after three minutes, Farmer James has all his eggs in one basket. [b]p11.[/b] Find the value of $\frac{4 \cdot 7}{\sqrt{4 +\sqrt7} +\sqrt{4 -\sqrt7}}$. [b]p12.[/b] Two circles, with radius $6$ and radius $8$, are externally tangent to each other. Two more circles, of radius $7$, are placed on either side of this configuration, so that they are both externally tangent to both of the original two circles. Out of these $4$ circles, what is the maximum distance between any two centers? PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2949222p26406222]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine all positive integers $n$ such that $4k^2 +n$ is a prime number for all non-negative integer $k$ smaller than $n$.

Prove: There exists a positive integer $n$ with $2021$ prime divisors, satisfying $n|2^n+1$.

Prove that for any positive integer $k$ there exist $k$ pairwise distinct integers for which the sum of their squares equals the sum of their cubes.

The sequence of real numbers $a_1, a_2, a_3, ...$ is defined as follows: $a_1 = 2019$, $a_2 = 2020$, $a_3 = 2021$ and for all $n \ge 1$ $$a_{n+3} = 5a^6_{n+2} + 3a^3_{n+1} + a^2_n.$$ Show that this sequence does not contain numbers of the form $m^6$ where $m$ is a positive integer.

Find all three-digit numbers that are \( 5 \) times greater than the product of their digits.

Let $a_1$, $a_2$, ..., $a_{10}$ be positive integers such that $a_1<a_2<...<a_{10}$. For every $k$, denote by $b_k$ the greatest divisor of $a_k$ such that $b_k<a_k$. Assume that $b_1>b_2>...>b_{10}$. Show that $a_{10}>500$.

Find all triplets of positive integers $(x, y, z)$ such that $2^x+1=7^y+2^z$.

The number $2^{1997}$ has $m$ decimal digits, while the number $5^{1997}$ has $n$ digits. Evaluate $m+n$.

For positive integer $k>1$, let $f(k)$ be the number of ways of factoring $k$ into product of positive integers greater than $1$ (The order of factors are not countered, for example $f(12)=4$, as $12$ can be factored in these $4$ ways: $12,2\cdot 6,3\cdot 4, 2\cdot 2\cdot 3$. Prove: If $n$ is a positive integer greater than $1$, $p$ is a prime factor of $n$, then $f(n)\leq \frac{n}{p}$

A sequence of integers $a_1,a_2,\ldots $ is such that $a_1=1,a_2=2$ and for $n\ge 1$, \[a_{n+2}=\left\{\begin{array}{cl}5a_{n+1}-3a_{n}, &\text{if}\ a_n\cdot a_{n+1}\ \text{is even},\\ a_{n+1}-a_{n}, &\text{if}\ a_n\cdot a_{n+1}\ \text{is odd},\end{array}\right. \] Prove that $a_n\not= 0$ for all $n$.

[u]Round 4[/u] [b]p10.[/b] How many divisors of $10^{11}$ have at least half as many divisors that $10^{11}$ has? [b]p11.[/b] Let $f(x, y) = \frac{x}{y}+\frac{y}{x}$ and $g(x, y) = \frac{x}{y}-\frac{y}{x} $. Then, if $\underbrace{f(f(... f(f(}_{2021 fs} f(f(1, 2), g(2,1)), 2), 2)... , 2), 2)$ can be expressed in the form $a + \frac{b}{c}$, where $a$, $b$,$c$ are nonnegative integers such that $b < c$ and $gcd(b,c) = 1$, find $a + b + \lceil (\log_2 (\log_2 c)\rceil $ [b]p12.[/b] Let $ABC$ be an equilateral triangle, and let$ DEF$ be an equilateral triangle such that $D$, $E$, and $F$ lie on $AB$, $BC$, and $CA$, respectively. Suppose that $AD$ and $BD$ are positive integers, and that $\frac{[DEF]}{[ABC]}=\frac{97}{196}$. The circumcircle of triangle $DEF$ meets $AB$, $BC$, and $CA$ again at $G$, $H$, and $I$, respectively. Find the side length of an equilateral triangle that has the same area as the hexagon with vertices $D, E, F, G, H$, and $I$. [u]Round 5 [/u] [b]p13.[/b] Point $X$ is on line segment $AB$ such that $AX = \frac25$ and $XB = \frac52$. Circle $\Omega$ has diameter $AB$ and circle $\omega$ has diameter $XB$. A ray perpendicular to $AB$ begins at $X$ and intersects $\Omega$ at a point $Y$. Let $Z$ be a point on $\omega$ such that $\angle YZX = 90^o$. If the area of triangle $XYZ$ can be expressed as $\frac{a}{b}$ for positive integers $a, b$ with $gcd(a, b) = 1$, find $a + b$. [b]p14.[/b] Andrew, Ben, and Clayton are discussing four different songs; for each song, each person either likes or dislikes that song, and each person likes at least one song and dislikes at least one song. As it turns out, Andrew and Ben don't like any of the same songs, but Clayton likes at least one song that Andrew likes and at least one song that Ben likes! How many possible ways could this have happened? [b]p15.[/b] Let triangle $ABC$ with circumcircle $\Omega$ satisfy $AB = 39$, $BC = 40$, and $CA = 25$. Let $P$ be a point on arc $BC$ not containing $A$, and let $Q$ and $R$ be the reflections of $P$ in $AB$ and $AC$, respectively. Let $AQ$ and $AR$ meet $\Omega$ again at $S$ and $T$, respectively. Given that the reflection of $QR$ over $BC$ is tangent to $\Omega$ , $ST$ can be expressed as $\frac{a}{b}$ for positive integers $a, b$ with $gcd(a,b)= 1$. Find $a + b$. PS. You should use hide for answers. Rounds 1-3 have been posted [url=https://artofproblemsolving.com/community/c4h3131401p28368159]here [/url] and 6-7 [url=https://artofproblemsolving.com/community/c4h3131434p28368604]here [/url],Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[u]Round 1[/u] [b]p1.[/b] Alice and Bob compiled a list of movies that exactly one of them saw, then Cindy and Dale did the same. To their surprise, these two lists were identical. Prove that if Alice and Cindy list all movies that exactly one of them saw, this list will be identical to the one for Bob and Dale. [b]p2.[/b] Several whole rounds of cheese were stored in a pantry. One night some rats sneaked in and consumed $10$ of the rounds, each rat eating an equal portion. Some were satisfied, but $7$ greedy rats returned the next night to finish the remaining rounds. Their portions on the second night happened to be half as large as on the first night. How many rounds of cheese were initially in the pantry? [b]p3.[/b] You have $100$ pancakes, one with a single blueberry, one with two blueberries, one with three blueberries, and so on. The pancakes are stacked in a random order. Count the number of blueberries in the top pancake, and call that number N. Pick up the stack of the top N pancakes, and flip it upside down. Prove that if you repeat this counting-and-flipping process, the pancake with one blueberry will eventually end up at the top of the stack. [b]p4.[/b] There are two lemonade stands along the $4$-mile-long circular road that surrounds Sour Lake. $100$ children live in houses along the road. Every day, each child buys a glass of lemonade from the stand that is closest to her house, as long as she does not have to walk more than one mile along the road to get there. A stand's [u]advantage [/u] is the difference between the number of glasses it sells and the number of glasses its competitor sells. The stands are positioned such that neither stand can increase its advantage by moving to a new location, if the other stand stays still. What is the maximum number of kids who can't buy lemonade (because both stands are too far away)? [b]p5.[/b] Merlin uses several spells to move around his $64$-room castle. When Merlin casts a spell in a room, he ends up in a different room of the castle. Where he ends up only depends on the room where he cast the spell and which spell he cast. The castle has the following magic property: if a sequence of spells brings Merlin from some room $A$ back to room $A$, then from any other room $B$ in the castle, that same sequence brings Merlin back to room $B$. Prove that there are two different rooms $X$ and $Y$ and a sequence of spells that both takes Merlin from $X$ to $Y$ and from $Y$ to $X$. [u]Round 2[/u] [b]p6.[/b] Captains Hook, Line, and Sinker are deciding where to hide their treasure. It is currently buried at the $X$ in the map below, near the lairs of the three pirates. Each pirate would prefer that the treasure be located as close to his own lair as possible. You are allowed to propose a new location for the treasure to the pirates. If at least two out of the three pirates prefer the new location (because it moves closer to their own lairs), then the treasure will be moved there. Assuming the pirates’ lairs form an acute triangle, is it always possible to propose a sequence of new locations so that the treasure eventually ends up in your backyard (wherever that is)? [img]https://cdn.artofproblemsolving.com/attachments/c/c/a9e65624d97dec612ef06f8b30be5540cfc362.png[/img] [b]p7.[/b] Homer went on a Donut Diet for the month of May ($31$ days). He ate at least one donut every day of the month. However, over any stretch of $7$ consecutive days, he did not eat more than $13$ donuts. Prove that there was some stretch of consecutive days over which Homer ate exactly $30$ donuts. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $p \neq 13$ be a prime number of the form $8k+5$ such that $39$ is a quadratic non-residue modulo $p$. Prove that the equation $$x_1^4+x_2^4+x_3^4+x_4^4 \equiv 0 \pmod p$$ has a solution in integers such that $p\nmid x_1x_2x_3x_4$.

Given coprime positive integers $p,q>1$, call all positive integers that cannot be written as $px+qy$(where $x,y$ are non-negative integers) [i]bad[/i], and define $S(p,q)$ to be the sum of all bad numbers raised to the power of $2019$. Prove that there exists a positive integer $n$, such that for any $p,q$ as described, $(p-1)(q-1)$ divides $nS(p,q)$.

For any positive integer $n$ define $$E(n)=n(n+1)(2n+1)(3n+1)\cdots (10n+1).$$ Find the greatest common divisor of $E(1),E(2),E(3),\dots ,E(2009).$

Three natural numbers are such that the product of any two of them is divided by the sum of these two numbers. Prove that these three numbers have a common divisor greater than one.

Prove that the product of five consecutive positive integers cannot be a perfect square.

Determine the number of positive integers $n \leq 1000$ such that the sum of the digits of $5n$ and the sum of the digits of $n$ are the same.

For all positive integers $a$ and $b$, we dene $a @ b = \frac{a - b}{gcd(a, b)}$ . Show that for every integer $n > 1$, the following holds: $n$ is a prime power if and only if for all positive integers $m$ such that $m < n$, it holds that $gcd(n, n @m) = 1$.

Suppose that the measurement of time during the day is converted to the metric system so that each day has $10$ metric hours, and each metric hour has $100$ metric minutes. Digital clocks would then be produced that would read $9{:}99$ just before midnight, $0{:}00$ at midnight, $1{:}25$ at the former $3{:}00$ $\textsc{am}$, and $7{:}50$ at the former $6{:}00$ $\textsc{pm}$. After the conversion, a person who wanted to wake up at the equivalent of the former $6{:}36$ $\textsc{am}$ would have to set his new digital alarm clock for $\text{A:BC}$, where $\text{A}$, $\text{B}$, and $\text{C}$ are digits. Find $100\text{A} + 10\text{B} + \text{C}$.

Find all the integer pairs $ (x,y)$ such that: \[ x^2\minus{}y^4\equal{}2009\]

Let $a,b,c$ be positive integers. Prove that $a^2+b^2+c^2$ is divisible by $4$, if and only if $a,b,c$ are even.

Find all pairs $(p,q)$ of prime numbers such that $$ p(p^2 - p - 1) = q(2q + 3) .$$

For every pair $(m, n)$ of positive integers, a positive real number $a_{m, n}$ is given. Assume that \[a_{m+1, n+1} = \frac{a_{m, n+1} a_{m+1, n} + 1}{a_{m, n}}\] for all positive integers $m$ and $n$. Suppose further that $a_{m, n}$ is an integer whenever $\min(m, n) \le 2$. Prove that $a_{m, n}$ is an integer for all positive integers $m$ and $n$.