In $\triangle ABC,$ a point $E$ is on $\overline{AB}$ with $AE=1$ and $EB=2.$ Point $D$ is on $\overline{AC}$ so that $\overline{DE} \parallel \overline{BC}$ and point $F$ is on $\overline{BC}$ so that $\overline{EF} \parallel \overline{AC}.$ What is the ratio of the area of $CDEF$ to the area of $\triangle ABC?$ [asy] size(7cm); pair A,B,C,DD,EE,FF; A = (0,0); B = (3,0); C = (0.5,2.5); EE = (1,0); DD = intersectionpoint(A--C,EE--EE+(C-B)); FF = intersectionpoint(B--C,EE--EE+(C-A)); draw(A--B--C--A--DD--EE--FF,black+1bp); label("$A$",A,S); label("$B$",B,S); label("$C$",C,N); label("$D$",DD,W); label("$E$",EE,S); label("$F$",FF,NE); label("$1$",(A+EE)/2,S); label("$2$",(EE+B)/2,S); [/asy] $\textbf{(A) } \frac{4}{9} \qquad \textbf{(B) } \frac{1}{2} \qquad \textbf{(C) } \frac{5}{9} \qquad \textbf{(D) } \frac{3}{5} \qquad \textbf{(E) } \frac{2}{3}$

[u]Round 5[/u] [b]5.1[/b] A circle with a radius of $1$ is inscribed in a regular hexagon. This hexagon is inscribed in a larger circle. If the area that is outside the hexagon but inside the larger circle can be expressed as $\frac{a\pi}{b} - c\sqrt{d}$, where $a, b, c, d$ are positive integers, $a, b$ are relatively prime, and no prime perfect square divides into $d$. find the value of $a + b + c + d$. [b]5.2[/b] At a dinner party, $10$ people are to be seated at a round table. If person A cannot be seated next to person $B$ and person $C$ must be next to person $D$, how many ways can the 10 people be seated? Consider rotations of a configuration identical. [b]5.3[/b] Let $N$ be the sum of all the positive integers that are less than $2022$ and relatively prime to $1011$. Find $\frac{N}{2022}$. [u]Round 6[/u] [b]6.1[/b] The line $y = m(x - 6)$ passes through the point $ A$ $(6, 0)$, and the line $y = 8 -\frac{x}{m}$ pass through point $B$ $(0,8)$. The two lines intersect at point $C$. What is the largest possible area of triangle $ABC$? [b]6.2[/b] Let $N$ be the number of ways there are to arrange the letters of the word MATHEMATICAL such that no two As can be adjacent. Find the last $3$ digits of $\frac{N}{100}$. [b]6.3[/b] Find the number of ordered triples of integers $(a, b, c)$ such that $|a|, |b|, |c| \le 100$ and $3abc = a^3 + b^3 + c^3$. [u]Round 7[/u] [b]7.1[/b] In a given plane, let $A, B$ be points such that $AB = 6$. Let $S$ be the set of points such that for any point $C$ in $S$, the circumradius of $\vartriangle ABC$ is at most $6$. Find $a + b + c$ if the area of $S$ can be expressed as $a\pi + b\sqrt{c}$ where $a, b, c$ are positive integers, and $c$ is not divisible by the square of any prime. [b]7.2[/b] Compute $\sum_{1\le a<b<c\le 7} abc$. [b]7.3[/b] Three identical circles are centered at points $A, B$, and $C$ respectively and are drawn inside a unit circle. The circles are internally tangent to the unit circle and externally tangent to each other. A circle centered at point $D$ is externally tangent to circles $A, B$, and $C$. If a circle centered at point $E$ is externally tangent to circles $A, B$, and $D$, what is the radius of circle $E$? The radius of circle $E$ can be expressed as $\frac{a\sqrt{b}-c}{d}$ where $a, b, c$, and d are all positive integers, gcd(a, c, d) = 1, and b is not divisible by the square of any prime. What is the sum of $a + b + c + d$? [u]Round 8[/u] [b]8.[/b] Let $A$ be the number of unused Algebra problems in our problem bank. Let $B$ be the number of times the letter ’b’ appears in our problem bank. Let M be the median speed round score. Finally, let $C$ be the number of correct answers to Speed Round $1$. Estimate $$A \cdot B + M \cdot C.$$ 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/c3h2826128p24988676]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ABCD$ be a quadrilateral and let $\Gamma$ be a circle of center $O$ that is internally tangent to its four sides. If $M$ is the midpoint of $AC$ and $N$ is the midpoint of $BD$, prove that $M,O, N$ are collinear.

A sequence of numbers starts with $ 1$, $ 2$, and $ 3$. The fourth number of the sequence is the sum of the previous three numbers in the sequence: $ 1\plus{}2\plus{}3\equal{}6$. In the same way, every number after the fourth is the sum of the previous three numbers. What is the eighth number in the sequence? $ \textbf{(A)}\ 11 \qquad \textbf{(B)}\ 20 \qquad \textbf{(C)}\ 37 \qquad \textbf{(D)}\ 68 \qquad \textbf{(E)}\ 99$

Let $\omega$ be an incircle of triangle $ABC$. Let $D$ be a point on segment $BC$, which is tangent to $\omega$. Let $X$ be an intersection of $AD$ and $\omega$ against $D$. If $AX : XD : BC = 1 : 3 : 10$, a radius of $\omega$ is $1$, find the length of segment $XD$. Note that $YZ$ expresses the length of segment $YZ$.

Let $f : R \to R$ be a function from the set $R$ of real numbers to itself. Find all such functions $f$ satisfying the two properties: (a) $f(x + f(y)) = y + f(x)$ for all $x, y \in R$, (b) the set $\{ \frac{f(x)}{x} :x$ is a nonzero real number $\}$ is finite

Find $$\lim_{N\to\infty}\frac{\ln^2 N}{N} \sum_{k=2}^{N-2} \frac{1}{\ln k \cdot \ln (N-k)}$$

Prove that if $m$ and $n$ are positive integers such that $m^2 + n^2 - m$ is divisible by $2mn$, then $m$ is a perfect square.

For non-negative real numbers $x_1, x_2, \ldots, x_n$ which satisfy $x_1 + x_2 + \cdots + x_n = 1$, find the largest possible value of $\sum_{j = 1}^{n} (x_j^{4} - x_j^{5})$.

Let $n > 3$ be a positive integer. Suppose that $n$ children are arranged in a circle, and $n$ coins are distributed between them (some children may have no coins). At every step, a child with at least 2 coins may give 1 coin to each of their immediate neighbors on the right and left. Determine all initial distributions of the coins from which it is possible that, after a finite number of steps, each child has exactly one coin.

Let $N = a_1a_2...a_n$ in binary. Show that if $a_1-a_2 + a_3 -... + (-1)^{n-1}a_n = 0$ mod $3$, then $N = 0$ mod $3$.

Let $ S \equal{} \{x_1, x_2, \ldots, x_{k \plus{} l}\}$ be a $ (k \plus{} l)$-element set of real numbers contained in the interval $ [0, 1]$; $ k$ and $ l$ are positive integers. A $ k$-element subset $ A\subset S$ is called [i]nice[/i] if \[ \left |\frac {1}{k}\sum_{x_i\in A} x_i \minus{} \frac {1}{l}\sum_{x_j\in S\setminus A} x_j\right |\le \frac {k \plus{} l}{2kl}\] Prove that the number of nice subsets is at least $ \dfrac{2}{k \plus{} l}\dbinom{k \plus{} l}{k}$. [i]Proposed by Andrey Badzyan, Russia[/i]

Find all prime $x,y$ and $z,$ such that $x^5 +y^3 -(x+y)^2=3z^3$

Beter Pai wants to tell you his fastest $40$-line clear time in Tetris, but since he does not want Qep to realize she is better at Tetris than he is, he does not tell you the time directly. Instead, he gives you the following requirements, given that the correct time is t seconds: $\bullet$ $t < 100$. $\bullet$ $t$ is prime. $\bullet$ $t -1$ has 5 proper factors. $\bullet$ all prime factors of $t +1$ are single digits. $\bullet$ $t -2$ is a multiple of $3$. $\bullet$ $t +2$ has $2$ factors. Find t.

Find all triples of natural numbers $ a $, $ b $, $ c $ such that $$ \gcd (a ^ 2, b ^ 2) + \gcd (a, bc) +\gcd (b, ac) +\gcd (c, ab) = 239 ^ 2 = ab + c . $$

Let $ m$ be a positive integer and define $ f(m)$ to be the number of factors of $ 2$ in $ m!$ (that is, the greatest positive integer $ k$ such that $ 2^k|m!$). Prove that there are infinitely many positive integers $ m$ such that $ m \minus{} f(m) \equal{} 1989.$

Let $N$ is the set of all positive integers. Determine all mappings $f: N-\{1\} \to N$ such that for every $n \ne m$ the following equation is true $$f(n)f(m)=f\left((nm)^{2021}\right)$$

Determine the number of subset $S$ of the set $T = {1, 2,..., 2005}$ such that the sum of elements in $s$ is congruent to 2006 modulo 2048.

Show that there is no continuous function $f:\mathbb{R}\rightarrow \mathbb{R}$ such that for every real number $x$ \[f(x-f(x)) = \dfrac x2.\]

Eddy is traveling to England and needs to exchange USD to GBP (US dollars to British pounds). The current exchange rate is $1.3$ USD for $1$ GBP. He exchanges $x$ USD to GBP and while in England, uses $\tfrac{x}{2}$ GBP. When he returns, the value of the British pound has changed so that $1$ GBP equals $\alpha$ USD. After exchanging all his remaining GBP, he notes that he has $\tfrac{x}{2}$ USD left. What is $\alpha$?

You are given a positive integer $n > 1$. What is the largest possible number of integers that can be chosen from the set $\{1, 2, 3, \ldots, 2^n\}$ so that for any two different chosen integers $a, b$, the value $a^k + b^k$ is not divisible by $2^n$ for any positive integer $k$? [i]Proposed by Oleksii Masalitin[/i]

The cells of an $n \times n$ chessboard are coloured in several colours so that no $2\times 2$ square contains four cells of the same colour. A [i]proper path [/i] of length $m$ is a sequence $a_1,a_2,..., a_m$ of distinct cells in which the cells $a_i$ and $a_{i+1}$ have a common side and are coloured in different colours for all $1 \le i < m$. Show that there exists a proper path of length $n$.

Let $a,b,c$ be positive integers such that $a|b^2, b|c^2$ and $c|a^2$. Prove that $abc|(a+b+c)^{7}$

Each square in a $3 \times 3$ grid is randomly filled with one of the $4$ gray-and-white tiles shown below on the right.[asy] size(5.663333333cm); draw((0,0)--(3,0)--(3,3)--(0,3)--cycle,gray); draw((1,0)--(1,3)--(2,3)--(2,0),gray); draw((0,1)--(3,1)--(3,2)--(0,2),gray); fill((6,.33)--(7,.33)--(7,1.33)--cycle,mediumgray); draw((6,.33)--(7,.33)--(7,1.33)--(6,1.33)--cycle,gray); fill((6,1.67)--(7,2.67)--(6,2.67)--cycle,mediumgray); draw((6,1.67)--(7,1.67)--(7,2.67)--(6,2.67)--cycle,gray); fill((7.33,.33)--(8.33,.33)--(7.33,1.33)--cycle,mediumgray); draw((7.33,.33)--(8.33,.33)--(8.33,1.33)--(7.33,1.33)--cycle,gray); fill((8.33,1.67)--(8.33,2.67)--(7.33,2.67)--cycle,mediumgray); draw((7.33,1.67)--(8.33,1.67)--(8.33,2.67)--(7.33,2.67)--cycle,gray); [/asy] What is the probability that the tiling will contain a large gray diamond in one of the smaller $2\times 2$ grids? Below is an example of one such tiling. [asy] size(2cm); fill((1,0)--(0,1)--(0,2)--(1,1)--cycle,mediumgray); fill((2,0)--(3,1)--(2,2)--(1,1)--cycle,mediumgray); fill((1,2)--(1,3)--(0,3)--cycle,mediumgray); fill((1,2)--(2,2)--(2,3)--cycle,mediumgray); fill((3,2)--(3,3)--(2,3)--cycle,mediumgray); draw((0,0)--(3,0)--(3,3)--(0,3)--cycle,gray); draw((1,0)--(1,3)--(2,3)--(2,0),gray); draw((0,1)--(3,1)--(3,2)--(0,2),gray); [/asy] $\textbf{(A) } \frac{1}{1024} \qquad \textbf{(B) } \frac{1}{256} \qquad \textbf{(C) } \frac{1}{64} \qquad \textbf{(D) } \frac{1}{16} \qquad \textbf{(E) } \frac{1}{4}$

Prove that any integer greater than or equal to $7$ can be written as a sum of two relatively prime integers, both greater than 1. (Two integers are relatively prime if they share no common positive divisor other than $1$. For example, $22$ and 15 are relatively prime, and thus $37 = 22+15$ represents the number 37 in the desired way.)