For any odd prime $p$ and any integer $n,$ let $d_p (n) \in \{ 0,1, \dots, p-1 \}$ denote the remainder when $n$ is divided by $p.$ We say that $(a_0, a_1, a_2, \dots)$ is a [i]p-sequence[/i], if $a_0$ is a positive integer coprime to $p,$ and $a_{n+1} =a_n + d_p (a_n)$ for $n \geqslant 0.$ (a) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_n >b_n$ for infinitely many $n,$ and $b_n > a_n$ for infinitely many $n?$ (b) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_0 <b_0,$ but $a_n >b_n$ for all $n \geqslant 1?$ [I]United Kingdom[/i]

[u]Fermi Questions[/u] [b]p1.[/b] What is $\sin (1000)$? (note: that's $1000$ radians, not degrees) [b]p2.[/b] In liters, what is the volume of $10$ million US dollars' worth of gold? [b]p3.[/b] How many trees are there on Earth? [b]p4.[/b] How many prime numbers are there between $10^8$ and $10^9$? [b]p5.[/b] What is the total amount of time spent by humans in spaceflight? [b]p6.[/b] What is the global domestic product (total monetary value of all goods and services produced in a country's borders in a year) of Bangladesh in US dollars? [b]p7.[/b] How much time does the average American spend eating during their lifetime, in hours? [b]p8.[/b] How many CHMMC-related emails did the directors receive or send in the last month? [u]Suspiciously Familiar. . .[/u] [b]p9.[/b] Suppose a farmer learns that he will die at the end of the year (day $365$, where today is day $0$) and that he has $100$ sheep. He decides to sell all his sheep on one day, and that his utility is given by $ab$ where $a$ is the money he makes by selling the sheep (which always have a fixed price) and $b$ is the number of days he has left to enjoy the profit; i.e., $365 - k$ where $k$ is the day number. If every day his sheep breed and multiply their numbers by $(421 + b)/421$ (yes, there are small, fractional sheep), on which day should he sell out? [b]p10.[/b] Suppose in your sock drawer of $14$ socks there are $5$ different colors and $3$ different lengths present. One day, you decide you want to wear two socks that have either different colors or different lengths but not both. Given only this information, what is the maximum number of choices you might have? [u]I'm So Meta Even This Acronym[/u] [b]p11.[/b] Let $\frac{s}{t}$ be the answer of problem $13$, written in lowest terms. Let $\frac{p}{q}$ be the answer of problem $12$, written in lowest terms. If player $1$ wins in problem $11$, let $n = q$. Otherwise, let $n = p$. Two players play a game on a connected graph with $n$ vertices and $t$ edges. On each player's turn, they remove one edge of the graph, and lose if this causes the graph to become disconnected. Which player (first or second) wins? [b]p12.[/b] Let $\frac{s}{t}$ be the answer of problem $13$, written in lowest terms. If player $1$ wins in problem $11$, let $n = t$. Otherwise, let $n = s$. Find the maximum value of $$\frac{x^n}{1 + \frac12 x + \frac14 x^2 + ...+ \frac{1}{2^{2n}} x^{2n}}$$ for $x > 0$. [b]p13.[/b] Let $\frac{p}{q}$ be the answer of problem $12$, written in lowest terms. Let $y$ be the largest integer such that $2^y$ divides $p$. If player $1$ wins in problem $11$, let $z = q$. Otherwise, let $z = p$. Suppose that $a_1 = 1$ and $$a_{n+1} = a_n -\frac{z}{n + 2}+\frac{2z}{n + 1}-\frac{z}{n}$$ What is $a_y$? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find the number of positive integer solutions of $(x^2 + 2)(y^2 + 3)(z^2 + 4) = 60xyz$.

i) $ABCD$ is a rhombus. A tangent to the inscribed circle meets $AB, DA, BC, CD$ at $M, N, P, Q$ respectively. Find a relationship between $BM$ and $DN$. ii) $ABCD$ is a rhombus and $P$ a point inside. The circles through $P$ with centers $A, B, C, D$ meet the four sides $AB, BC, CD, DA$ in eight points. Find a property of the resulting octagon. Use it to construct a regular octagon. iii) Rotate the figure about the line $AC$ to form a solid. State a similar result.

$p$ is a prime. Find all relatively prime positive integers $m$, $n$ such that \[ \frac{m}{n}+\frac{1}{p^2}=\frac{m+p}{n+p} \]

In chess, a king threatens another king if, and only if, they are on neighboring squares, whether horizontally, vertically, or diagonally . Find the greatest amount of kings that can be placed on a $12 \times 12$ board such that each king threatens just another king. Here, we are not considering part colors, that is, consider that the king are all, say, white, and that kings of the same color can threaten each other.

The center of circle $\omega_1$ of radius $6$ lies on circle $\omega_2$ of radius $6$. The circles intersect at points $K$ and $W$. Let point $U$ lie on the major arc $\overarc{KW}$ of $\omega_2$, and point $I$ be the center of the largest circle that can be inscribed in $\triangle KWU$. If $KI+WI=11$, find $KI\cdot WI$. [i]Proposed by Bradley Guo[/i]

Find all $ 3$-digit numbers such that placing to the right side of the number its successor we get a $ 6$-digit number which is a perfect square.

Justine has two fair dice, one with sides labeled $1,2,\ldots, m$ and one with sides labeled $1,2,\ldots, n.$ She rolls both dice once. If $\tfrac{3}{20}$ is the probability that at least one of the numbers showing is at most 3, find the sum of all distinct possible values of $m+n$. [i]Proposed by Justin Stevens[/i]

A positive real number $a$ and two rays wich intersect at point $A$ are given. Show that all the circles which pass through $A$ and intersect these rays at points $B$ and $C$ where $|AB|+|AC|=a$ have a common point other than $A$.

Each rational point on a real line is assigned an integer. Prove that there is a segment such that the sum of the numbers at its endpoints does not exceed twice the number at its midpoint.

$(GDR 5)$ Given a ring $G$ in the plane bounded by two concentric circles with radii $R$ and $\frac{R}{2}$, prove that we can cover this region with $8$ disks of radius $\frac{2R}{5}$. (A region is covered if each of its points is inside or on the border of some disk.)

Let $A_1 A_2...A_n$ be a convex $n$-gon. What’s the number of $m$-gons with vertices from $A_1,A_2,...,A_n$ such that between each two adjacent vertices of the $m$-gon there are at least $k$ vertices from the $n$-gon?

If $ 10^{\log_{10}9} \equal{} 8x \plus{} 5$ then $ x$ equals: $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ \frac {1}{2} \qquad \textbf{(C)}\ \frac {5}{8} \qquad \textbf{(D)}\ \frac {9}{8} \qquad \textbf{(E)}\ \frac {2\log_{10}3 \minus{} 5}{8}$

Find the area of the set of points of the plane whose coordinates $(x, y)$ satisfy $x^2 + y^2 \le 4|x| + 4|y|$.

Consider the polynomial $p(x) = x^4 + ax^3 + bx^2 + cx + d$. It is given that $p(x)$ has its only root at $x = r$ i.e $p(r) = 0$. $\textbf{(a)}$ Show that if $a, b, c, d$ are rational then $r$ is rational. $\textbf{(b)}$ Show that if $a, b, c, d$ are integers then $r$ is an integer. [hide=Hint](Hint: Consider the roots of $p'(x)$ )[/hide]

A block of size $ a\times b\times c$ is composed of $ 1\times 1\times 2$ domino blocks. Assuming that each of the three possible directions of domino blocks occurs equally many times, what are the possible values of $ a$, $ b$, $ c$?

The incircle of triangle $ABC$ tangents $BC$, $CA$, $AB$ at $D$, $E$, $F$, respectively. Let the tangents of $E$, $F$ with respect to $\odot(AEF)$ intersect at $P$, and $X$ be a point on $BC$ such that $EF$, $DP$, $AX$ are concurrent. Define $Q$, $Y$ and $R$, $Z$ similarly. Show that $X$, $Y$, $Z$ are collinear.

$110$ teams participate in a volleyball tournament. Every team has played every other team exactly once (there are no ties in volleyball). Turns out that in any set of $55$ teams, there is one which has lost to no more than $4$ of the remaining $54$ teams. Prove that in the entire tournament, there is a team that has lost to no more than $4$ of the remaining $109$ teams.

Consider the set of cuboids: the three edges $a, b, c$ from a common vertex satisfy the condition \[\frac ab = \frac{a^2}{c^5}\] (i) Prove that there are $100$ pairs of cuboids in this set with equal volumes in each pair. (ii) For each pair of the above cuboids, find the ratio of the sum of their edges.

Prove that for every positive integer $n$ there are positive integers $a$ and $b$ exist with $n | 4a^2 + 9b^2 -1$.

In a triangle $ABC$ with an angle $\angle CAB =30^o$ draw median $CD$. If the formed $\vartriangle ACD$ is isosceles, find tan $\angle DCB$.

On a chessboard, Po controls a white queen and plays, in alternate turns, against an invisible black king (there are only those two pieces on the board). The king cannot move to a square where he would be in check, neither capture the queen. Every time the king makes a move, Po receives a message from beyond that tells which direction the king has moved (up, right, up-right, etc). His goal is to make the king unable to make a movement. Can Po reach his goal with at most $150$ moves, regardless the starting position of the pieces?

Let $N$ be a positive integer and $A = a_1, a_2, ... , a_N$ be a sequence of real numbers. Define the sequence $f(A)$ to be $$f(A) = \left( \frac{a_1 + a_2}{2},\frac{a_2 + a_3}{2}, ...,\frac{a_{N-1} + a_N}{2},\frac{a_N + a_1}{2}\right)$$ and for $k$ a positive integer define $f^k (A)$ to be$ f$ applied to $A$ consecutively $k$ times (i.e. $f(f(... f(A)))$) Find all sequences $A = (a_1, a_2,..., a_N)$ of integers such that $f^k (A)$ contains only integers for all $k$.

Call a polynomial $f$ with positive integer coefficients [i]triangle-compatible[/i] if any three coefficients of $f$ satisfy the triangle inequality. For instance, $3x^3 + 4x^2 + 6x + 5$ is triangle-compatible, but $3x^3 + 3x^2 + 6x + 5$ is not. Given that $f$ is a degree $20$ triangle-compatible polynomial with $-20$ as a root, what is the least possible value of $f(1)$?