Does there exist an infinite sequence $\{x_{n}\}$ of reals satisfying the following conditions i)$|x_{n}|\leq 0,666$ for all $n=1,2,...$ ii)$|x_{m}-x_{n}|\geq \frac{1}{n(n+1)}+\frac{1}{m(m+1)}$ for all $m\not = n$?

[u]Round 5[/u] [b]p13.[/b] Simplify $\frac11+\frac13+\frac16+\frac{1}{10}+\frac{1}{15}+\frac{1}{21}$. [b]p14.[/b] Given that $x + y = 7$ and $x^2 + y^2 = 29$, what is the sum of the reciprocals of $x$ and $y$? [b]p15.[/b] Consider a rectangle $ABCD$ with side lengths $AB = 3$ and $BC = 4$. If circles are inscribeδ in triangles $ABC$ and $BCD$, how far are the centers of the circles from each other? [u]Round 6[/u] [b]p16.[/b] Evaluate $\frac{2!}{1!} +\frac{3!}{2!} +\frac{4!}{3!} + ... +\frac{99!}{98!}+\frac{100!}{99!}$ . [b]p17.[/b] Let $ABCD$ be a square of side length $2$. A semicircle is drawn with diameter $\overline{AC}$ that passes through point $B$. Find the area of the region inside the semicircle but outside the square. [b]p18.[/b] For how many positive integer values of $k$ is $\frac{37k - 30}{k}$ a positive integer? [u]Round 7[/u] [b]p19.[/b] Two parallel planar slices across a sphere of radius $25$ create cross sections of area $576\pi$ and $225\pi$. What is the maximum possible distance between the two slices? [b]p20.[/b] How many positive integers cannot be expressed in the form $3\ell + 4m + 5t$, where $\ell$, $m$, and $t$ are nonnegative integers? [b]p21.[/b] In April, a fool is someone who is fooled by a classmate. In a class of $30$ students, $14$ people were fooled by someone else and $29$ people fooled someone else. What is the largest positive integer $n$ for which we can guarantee that at least one person was fooled by at least $n$ other people? [u]Round 8[/u] [b]p22.[/b] Let $$S = 4 + \dfrac{12}{4 +\dfrac{ 12}{4 +\dfrac{ 12}{4+ ...}}}.$$ Evaluate $4 +\frac{ 12}{S}.$ [b]p23.[/b] Jonathan is buying bananagram sets for $\$11$ each and flip-flops for $\$17$ each. If he spends $\$227$ on purchases for bananagram sets and flip-flops, what is the total number of bananagram sets and flip-flops he bought? [b]p24.[/b] Alan has a $3 \times 3$ array of squares. He starts removing the squares one at a time such that each time he removes one square, all remaining squares share a side with at least two other remaining squares. What is the maximum number of squares Alan can remove? PS. You should use hide for answers. Rounds 1-4 are [url=https://artofproblemsolving.com/community/c3h2952214p26434209]here[/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3134133p28400917]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a, b, c$ be the side-lengths of triangle $ABC$ with $a+b+c = 12$. Determine the smallest value of $M =\frac{a}{b + c - a}+\frac{4b}{c + a - b}+\frac{9c}{a + b - c}$.

Find all integers $ (x,y,z)$, satisfying equality: $ x^2(y \minus{} z) \plus{} y^2(z \minus{} x) \plus{} z^2(x \minus{} y) \equal{} 2$

Let $a$ be a real number in the open interval $(0,1)$. Let $n\geq 2$ be a positive integer and let $f_n\colon\mathbb{R}\to\mathbb{R}$ be defined by $f_n(x) = x+\frac{x^2}{n}$. Show that \[\frac{a(1-a)n^2+2a^2n+a^3}{(1-a)^2n^2+a(2-a)n+a^2}<(f_n \circ\ \cdots\ \circ f_n)(a)<\frac{an+a^2}{(1-a)n+a}\] where there are $n$ functions in the composition.

We say that a real $a\geq-1$ is philosophical if there exists a sequence $\epsilon_1,\epsilon_2,\dots$, with $\epsilon_i \in\{-1,1\}$ for all $i\geq1$, such that the sequence $a_1,a_2,a_3,\dots$, with $a_1=a$, satisfies $$a_{n+1}=\epsilon_{n}\sqrt{a_{n}+1},\forall n\geq1$$ and is periodic. Find all philosophical numbers.

Let $f : [0, 1] \to \mathbb R$ be continuous and satisfy: \[ \begin{cases}bf(2x) = f(x), &\mbox{ if } 0 \leq x \leq 1/2,\\ f(x) = b + (1 - b)f(2x - 1), &\mbox{ if } 1/2 \leq x \leq 1,\end{cases}\] where $b = \frac{1+c}{2+c}$, $c > 0$. Show that $0 < f(x)-x < c$ for every $x, 0 < x < 1.$

A sequence $(G_n)_{n=0}^{\infty}$ satisfies $G(0) = 0$ and $G(n) = n-G(G(n-1))$ for each $n \in N$. Show that (a) $G(k) \ge G(k -1)$ for every $k \in N$; (b) there is no integer $k$ for which $G(k -1) = G(k) = G(k +1)$.

Find the smallest value of the expression $$(x -y)^2 + (z - u)^2,$$ if $$(x -1)^2 + (y -4)^2 + (z-3)^2 + (u-2)^2 = 1.$$

Given integers $a$, $ b$ and $c$, $c\ne b$. It is known that the square trinomials $ax^2 + bx + c$ and $(c-b)x^2 + (c- a)x + (a + b)$ have a common root (not necessarily integer). Prove that $a+b+2c$ is divisible by $3$.

Find the number of polynomials $f(x)=ax^3+bx$ satisfying both following conditions: (i) $a,b\in\{1,2,\ldots,2013\}$; (ii) the difference between any two of $f(1),f(2),\ldots,f(2013)$ is not a multiple of $2013$.

If $0 <x_1,x_2,...,x_n\le 1$, where $n \ge 1$, show that $$\frac{x_1}{1+(n-1)x_1}+\frac{x_2}{1+(n-1)x_2}+...+\frac{x_n}{1+(n-1)x_n}\le 1$$

Let $P(x)$ be a polynomial with integer coefficients. We denote $\deg(P)$ its degree which is $\geq 1.$ Let $n(P)$ be the number of all the integers $k$ for which we have $(P(k))^{2}=1.$ Prove that $n(P)- \deg(P) \leq 2.$

The fraction $\tfrac1{2015}$ has a unique "(restricted) partial fraction decomposition'' of the form \[\dfrac1{2015}=\dfrac a5+\dfrac b{13}+\dfrac c{31},\] where $a$, $b$, and $c$ are integers with $0\leq a<5$ and $0\leq b<13$. Find $a+b$.

Let $a=1+10^{-4}$. Consider some $2023\times 2023$ matrix with each entry a real in $[1,a]$. Let $x_i$ be the sum of the elements of the $i$-th row and $y_i$ be the sum of the elements of the $i$-th column for each integer $i\in [1,n]$. Find the maximum possible value of $\dfrac{y_1y_2\cdots y_{2023}}{x_1x_2\cdots x_{2023}}$ (the answer may be expressed in terms of $a$).

Isosceles triangles $T$ and $T'$ are not congruent but have the same area and the same perimeter. The sides of $T$ have lengths $5$, $5$, and $8$, while those of $T'$ have lengths $a$, $a$, and $b$. Which of the following numbers is closest to $b$? $\textbf{(A) }3\qquad\textbf{(B) }4\qquad\textbf{(C) }5\qquad\textbf{(D) }6\qquad\textbf{(E) }8$

[u]Round 5[/u] [b]p13.[/b] For a square pyramid whose base has side length $9$, a square is formed by connecting the centroids of the four triangular faces. What is the area of the square formed by the centroids? [b]p14.[/b] Farley picks a real number p uniformly at random in the range $\left( \frac13, \frac23 \right)$. She then creates a special coin that lands on heads with probability $p$ and tails with probability $1 - p$. She flips this coin, and it lands on heads. What is the probability that $p > \frac12$? [b]p15.[/b] Let $ABCD$ be a quadrilateral with $\angle A = \angle C = 90^o$. Extend $AB$ and $CD$ to meet at point $P$. Given that $P B = 3$, $BA = 21$, and $P C = 1$, find $BD^2$ [u]Round 6[/u] [b]p16.[/b] Three congruent, mutually tangent semicircles are inscribed in a larger semicircle, as shown in the diagram below. If the larger semicircle has a radius of $30$ units, what is the radius of one of the smaller semicircles? [img]https://cdn.artofproblemsolving.com/attachments/5/e/1b73791e95dc4ed6342f0151f3f63e1b31ae3c.png[/img] [b]p17.[/b] In isosceles trapezoid $ABCD$ with $BC \parallel AD$, the distances from $A$ and $B$ to line $CD$ are $3$ and $9$, respectively. If the distance between the two bases of trapezoid $ABCD$ is $5$, find the area of quadrilateral $ABCD$. [b]p18.[/b] How many ways are there to tile the “$E$” shape below with dominos? A domino covers two adjacent squares. [img]https://cdn.artofproblemsolving.com/attachments/b/b/82bdb8d8df8bc3d00b9aef9eb39e55358c4bc6.png[/img] [u]Round 7[/u] [b]p19.[/b] In isoceles triangle $ABC$, $AC = BC$ and $\angle ACB = 20^o$. Let $\Omega$ be the circumcircle of triangle $ABC$ with center $O$, and let $M$ be the midpoint of segment $BC$. Ray $\overrightarrow{OM}$ intersects $\Omega$ at $D$. Let $\omega$ be the circle with diameter $OD$. $AD$ intersects $\omega$ again at a point $X$ not equal to $D$. Given $OD = 2$, find the area of triangle $OXD$. [b]p20.[/b] Find the smallest odd prime factor of $2023^{2029} + 2026^{2029} - 1$. [b]p21.[/b] Achyuta, Alan, Andrew, Anish, and Ava are playing in the EMCC games. Each person starts with a paper with their name taped on their back. A person is eliminated from the game when anybody rips their paper off of their back. The game ends when one person remains. The remaining person then rips their paper off of their own back. At the end of the game, each person collects the papers that they ripped off. How many distinct ways can the papers be distributed at the end of the game? [u]Round 8[/u] [b]p22.[/b] Anthony has three random number generators, labelled $A$, $B$ and $C$. $\bullet$ Generator$ A$ returns a random number from the set $\{12, 24, 36, 48, 60\}$. $\bullet$ Generator $B$ returns a random number from the set $ \{15, 30, 45, 60\}$. $\bullet$ Generator $C$ returns a random number from the set $\{20, 40, 60\}$. He uses generator $A$, $B$, and then $C$ in succession, and then repeats this process indefinitely. Anthony keeps a running total of the sum of all previously generated numbers, writing down the new total every time he uses a generator. After he uses each machine $10 $ times, what is the average number of multiples of $60$ that Anthony will have written down? [b]p23.[/b] A laser is shot from one of the corners of a perfectly reflective room shaped like an equilateral triangle. The laser is reflected 2497 times without shining into a corner of the room, but after the 2497th reflection, it shines directly into the corner it started from. How many different angles could the laser have been initially pointed? [b]p24.[/b] We call a k-digit number blissful if the number of positive integers $n$ such that $n^n$ ends in that $k$-digit number happens to be nonzero and finite. What is the smallest value of $k$ such that there exists a blissful $k$-digit number? PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3131523p28369592]here[/url].. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The function $ f : \mathbb{N} \to \mathbb{Z}$ is defined by $ f(0) \equal{} 2$, $ f(1) \equal{} 503$ and $ f(n \plus{} 2) \equal{} 503f(n \plus{} 1) \minus{} 1996f(n)$ for all $ n \in\mathbb{N}$. Let $ s_1$, $ s_2$, $ \ldots$, $ s_k$ be arbitrary integers not smaller than $ k$, and let $ p(s_i)$ be an arbitrary prime divisor of $ f\left(2^{s_i}\right)$, ($ i \equal{} 1, 2, \ldots, k$). Prove that, for any positive integer $ t$ ($ t\le k$), we have $ 2^t \Big | \sum_{i \equal{} 1}^kp(s_i)$ if and only if $ 2^t | k$.

Find all functions $f,g,h: \mathbb{R} \mapsto \mathbb{R}$ such that $f(x) - g(y) = (x-y) \cdot h(x+y)$ for $x,y \in \mathbb{R}.$

Let $\mathbb{Z}$ be the set of integers. Find all functions $f : \mathbb{Z} \rightarrow \mathbb{Z}$ such that \[xf(2f(y)-x)+y^2f(2x-f(y))=\frac{f(x)^2}{x}+f(yf(y))\] for all $x, y \in \mathbb{Z}$ with $x \neq 0$.

Find, with proof, all functions $f : R - \{0\} \to R$ such that $$f(x)^2 - f(y)f(z) = x(x + y + z)(f(x) + f(y) + f(z))$$ for all real $x, y, z$ such that $xyz = 1$.

Let $a_1,a_2,...,a_{2020}$ be positive real numbers. Prove that: $$\max{(a^2_1-a_2,a^2_2-a_3,...,a^2_{2020}-a_1)}\ge\max{(a^2_1-a_1,a^2_2-a_2,...,a^2_{2020}-a_{2020})}$$

Find all functions $f : R \to R$ such that $x^2f(yf(x))= y^2f(x)f(f(x))$ for all real numbers $x$ and $y$.

For all triplets $a,b,c$ of (pairwise) distinct real numbers, prove the inequality $$ \left | \dfrac {a} {b-c} \right | + \left | \dfrac {b} {c-a} \right | + \left | \dfrac {c} {a-b} \right | \geq 2$$ and determine all cases of equality. Prove that if we also impose $a,b,c$ positive, then all equality cases disappear, but the value $2$ remains the best constant possible. ([i]Dan Schwarz[/i])

Find all complex solutions to the system \begin{align*} (a+ic)^3+(ia+b)^3+(-b+ic)^3&=-6,\\ (a+ic)^2+(ia+b)^2+(-b+ic)^2&=6,\\ (1+i)a+2ic&=0.\end{align*}