Compute the limit: \[ \lim_{n\to\infty} \frac{1}{n^2}\sum\limits_{1\leq i <j\leq n}\sin \frac{i+j}{n}\].

For which of the following integers $b$ is the base-$b$ number $2021_b - 221_b$ not divisible by $3$? $\textbf{(A) } 3 \qquad \textbf{(B) } 4 \qquad \textbf{(C) } 6 \qquad \textbf{(D) } 7 \qquad \textbf{(E) } 8$

Let $\triangle ABC$ be a right triangle at the vertex $A$ such that the side $AB$ is shorter than the side $AC$. Let $D$ be the foot of the altitude from $A$ to $BC$ and $M$ the midpoint of $BC$. Let $E$ be a point on the ray $AB$, outside of the segment $AB$. Line $ED$ intersects the segment $AM$ at the point $F$. Point $H$ is on the side $AC$ such that $\angle EFH=90^{\circ}$. Suppose that $ED=FH$. Find the measure of the angle $\angle AED$.

$ 2007^2$ unit squares are arranged forming a $ 2007\times 2007$ table. Arnold and Bernold play the following game: each move by Arnold consists of taking four unit squares that forms a $ 2\times 2$ square; each move by Bernold consists of taking a single unit square. They play anternatively, Arnold being the first. When Arnold is not able to perform his move, Bernold takes all the remaining unit squares. The person with more unit squares in the end is the winner. Is it possible to Bernold to win the game, no matter how Arnold play?

Show that any two points lying inside a regular $ n\minus{}$gon $ E$ can be joined by two circular arcs lying inside $ E$ and meeting at an angle of at least $ \left(1 \minus{} \frac{2}{n} \right) \cdot \pi.$

[u]Round 5[/u] [b]5.1.[/b] In a triangle $\vartriangle ABC$ with $AB = 48$, let the angle bisectors of $\angle BAC$ and $\angle BCA$ meet at $I$. Given $\frac{[ABI]}{[BCI]}=\frac{24}{7}$ and $\frac{[ACI]}{[ABI]}=\frac{25}{24}$ , find the area of $\vartriangle ABC$. [b]5.2.[/b] At a dinner party, $9$ people are to be seated at a round table. If person $A$ cannot be seated next to person $B$ and person $C$ cannot be next to person $D$, how many ways can the $9$ people be seated? Rotations of the table are indistinguishable. [b]5.3.[/b] Let $f(x)$ be a monic cubic polynomial such that $f(1) = f(7) = f(10) = a$ and $f(2) = f(5) = f(11) = b$. Find $|a - b|$. [u]Round 6[/u] [b]6.1.[/b] If $N$ has $16$ positive integer divisors and the sum of all divisors of $N$ that are multiples of $3$ is $39$ times the sum of divisors of $N$ that are not multiples of $3$, what is the smallest value of $N$? [b]6.2.[/b] In the two parabolas $y = x^2/16$ and $x = y^2/16$, the single line tangent to both parabolas intersects the parabolas at $A$ and $B$. If the parabolas intersect each other at $C$ which is not the origin, find the area of $\vartriangle ABC$. [b]6.3.[/b] Five distinguishable noncollinear points are drawn. How many ways are there to draw segments connecting the points, such that there are exactly two disjoint groups of connected points? Note that a single point can be considered a connected group of points. [u]Round 7[/u] [b]7.1.[/b] Let $a, b$ be positive integers, and $1 = d_1 < d_2 < d_3 < ... < d_n = a$ be the divisors of $a$, and $1 = e_1 < e_2 <e_3 < ... < e_m = b$ be the divisors of b. Given $gcd(a, b) = d_2 = e_6$, find the smallest possible value of $a + b$. [b]7.2.[/b] Let $\vartriangle ABC$ be a triangle such that $AB = 2$ and $AC = 3$. Let X be the point on $BC$ such that $m \angle BAX =\frac13 m\angle BAC$. Given that $AX = 1$, the sum of all possible values of $CX^2$ can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a, b$. Find $a + b$. [b]7.3.[/b] Bob has a playlist of $6$ different songs in some order, and he listens to his playlist repeatedly. Every time he finishes listening to the third song in the playlist, he randomly shuffles his playlist and listens to the playlist starting with the new first song. The expected number of times Bob shuffles his songs before he listens each one of his $6$ songs at least once can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a$ and $b$. Find $a+b$. [u]Round 8[/u] [b]8.1.[/b] $\underline{A}, \underline{B}, \underline{C}, \underline{D}, \underline{E}, \underline{F}, \underline{G}, \underline{H}, \underline{I}$, and $\underline{J}$ represent distinct digits ($0$ to $9$) in the equation $\underline{FBGA} - \underline{ABAC} = \underline{DCE}$ (where $\underline{ABAC}$ and $\underline{F BGA}$ are four-digit numbers, and $\underline{DCE }$ is a three-digit number). If $\underline{A} < \underline{B} < \underline{C} < \underline{D}$ and $\underline{ABCDEF GHIJ}$ is minimized, find $\underline{ABCD} + \underline{EF G} + \underline{HI} + \underline{J}$. [b]8.2.[/b] $\underline{A}, \underline{B}, \underline{C}, \underline{D}, \underline{E}$,,, and $\underline{F}$ represent distinct digits ($0$ to $9$) in the equations $\underline{ABC} \cdot \underline{C} = \underline{DEA}, \underline{ABC} \cdot \underline{D} = \underline{BAF E}$, and $ \underline{DEA} + \underline{BAF E}0 = \underline{BF ACA}$ (where $\underline{ABC}$ and $\underline{DEA}$ are three-digit numbers, $\underline{BAF E}$ is a four-digit number, and $\underline{BF ACA}$ is a five-digit number). Find $\underline{ABC} + \underline{DE} + \underline{F}$. [b]8.3.[/b] $\underline{A}, \underline{B}, \underline{C}, \underline{D}, \underline{E}, \underline{F}, \underline{G}$, and $\underline{H}$ represent distinct digits ($0$ to $9$) in the equations $\underline{ABC } \cdot \underline{D} = \underline{AF GE}$, $\underline{ABC } \cdot \underline{C} = \underline{GHC}$, $\underline{GHC} + \underline{HF F} = \underline{AEHC}$, and $\underline{AF GE}0 + \underline{AEHC} = \underline{AEABC}$ (where $\underline{ABC}$, $\underline{GHC}$ and $\underline{HF F}$ are three-digit numbers, $\underline{AF GE}$ is a four-digit number, and $\underline{AEABC}$ is a five-digit number). Find $\underline{ABCD} + \underline{EF GH}$. [u]Round 9[/u] Estimate the arithmetic mean of all answers to this question. Only integer answers between $0$ to $100, 000$ will count for credit and count toward the average. 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.05 |I|}, 13 - \frac{|I-X|}{0.05|I-2X|} \right\} \right\rceil \right\}$$ PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3129699p28347299]here [/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Solve the equation in $\mathbb{R}$ $$\left\{\left\{\frac{x^2-x}{2021}\right \}-\left\{\frac{x^2+x}{2022}\right \} \right \}=0.$$

Let $\mathbb{Q}$ denote the set of rational numbers. A nonempty subset $S$ of $\mathbb{Q}$ has the following properties: (a) $0$ is not in $S$; (b) for each $s_1,s_2$ in $S$, the rational number $s_1/s_2$ is in $S$; (c) there exists a nonzero number $q\in \mathbb{Q} \backslash S$ that has the property that every nonzero number in $\mathbb{Q} \backslash S$ is of the form $qs$ for some $s$ in $S$. Prove that if $x$ belongs to $S$, then there exists elements $y,z$ in $S$ such that $x=y+z$.

$AB$ is the diameter of a circle centered at $O$. $C$ is a point on the circle such that angle $BOC$ is $60^\circ$. If the diameter of the circle is $5$ inches, the length of chord $AC$, expressed in inches, is: $\text{(A)} \ 3 \qquad \text{(B)} \ \frac{5\sqrt{2}}{2} \qquad \text{(C)} \frac{5\sqrt3}{2} \ \qquad \text{(D)} \ 3\sqrt3 \qquad \text{(E)} \ \text{none of these}$

If you pick a random $3$-digit number, what is the probability that its hundreds digit is triple the ones digit?

Denote $g(k)$ as the greatest odd divisor of $k$. Put $f(k) = \dfrac{k}{2} + \dfrac{k}{g(k)}$ for $k$ even, and $2^{(k+1)/2}$ for $k$ odd. Define the sequence $x_1, x_2, x_3, ...$ by $x_1 = 1$, $x_{n+1} = f(x_n)$. Find $n$ such that $x_n = 800$.

Let's call the positive integer $x$ interesting, if there exists integer $y$ such that the following equation holds: $(x + y)^y = (x - y)^x.$ Suppose we list all interesting integers in increasing order. An interesting integer is considered very interesting if it is not relatively prime with any other interesting integer preceding it. Find the second very interesting integer. [i]Note: It is assumed that the first interesting integer is not very interesting.[/i] [i]Proposed by Zurab Aghdgomelashvili, Georgia[/i]

A board has $2$, $4$, and $6$ written on it. A person repeatedly selects (not necessarily distinct) values for $x$, $y$, and $z$ from the board, and writes down $xyz+xy+yz+zx+x+y+z$ if and only if that number is not yet on the board and is also less than or equal to $2013$. This person repeats this process until no more numbers can be written. How many numbers will be written at the end of the process?

Let $n > 3$ be a natural number, and let $x_1$, $x_2$, ..., $x_n$ be $n$ positive real numbers whose product is $1$. Prove the inequality \[ \frac {1}{1 + x_1 + x_1\cdot x_2} + \frac {1}{1 + x_2 + x_2\cdot x_3} + ... + \frac {1}{1 + x_n + x_n\cdot x_1} > 1. \]

Suppose $a_1,a_2,\ldots,a_n>0 $, where $n>1$ and $\sum_{i=1}^{n}a_i=1$. For each $i=1,2,\ldots,n $, let $b_i=\frac{a^2_i}{\sum\limits_{j=1}^{n}a^2_j}$. Prove that \[\sum_{i=1}^{n}\frac{a_i}{1-a_i}\le \sum_{i=1}^{n}\frac{b_i}{1-b_i} .\] When does equality occur ?

Consider 26 letters $A,..., Z$. A string is a finite sequence consisting of those letters. We say that a string $s$ is nice if it contains each of the 26 letters at least once, and each permutation of letters $A,..., Z$ occurs in $s$ as a subsequences the same number of times. Prove that: (a) There exists a nice string. (b) Any nice string contains at least $2022$ letters.