Draw on the coordinate plane a set of points $M(a, b)$ such that the equation $x^4+ax+b=0$ has a unique root satisfying the condition $0 \le x \le 1$.

Let $n \ge 3$ be an integer. A frog is to jump along the real axis, starting at the point $0$ and making $n$ jumps: one of length $1$, one of length $2$, $\dots$ , one of length $n$. It may perform these $n$ jumps in any order. If at some point the frog is sitting on a number $a \le 0$, its next jump must be to the right (towards the positive numbers). If at some point the frog is sitting on a number $a > 0$, its next jump must be to the left (towards the negative numbers). Find the largest positive integer $k$ for which the frog can perform its jumps in such an order that it never lands on any of the numbers $1, 2, \dots , k$.

Let $ a,b,c$ be positive reals with $ ab \plus{} bc \plus{} ca \equal{} 3$. Prove that: \[ \frac {1}{1 \plus{} a^2(b \plus{} c)} \plus{} \frac {1}{1 \plus{} b^2(a \plus{} c)} \plus{} \frac {1}{1 \plus{} c^2(b \plus{} a)}\le \frac {1}{abc}. \]

Prove that there exists a polynomial with integer coefficients satisfying the following conditions: (a)$f(x)=0$ has no rational root. (b) For any positive integer $n$, there always exists an integer $m$ such that $n\mid f(m)$.

For positive integers $a$ and $b$, let $M(a,b) = \tfrac{\text{lcm}(a,b)}{\gcd(a,b)},$ and for each positive integer $n \ge 2,$ define \[x_n = M(1, M(2, M(3, \dots , M(n - 2, M(n - 1, n))\cdots))).\] Compute the number of positive integers $n$ such that $2 \le n \le 2021$ and $5x_n^2 + 5x_{n+1}^2 = 26x_nx_{n+1}.$

Let $A$ be an $n\times n$ complex matrix such that $A \ne \lambda I_{n}$ for all $\lambda \in \mathbb{C}$. Prove that $A$ is similar to a matrix having at most one non-zero entry on the maindiagonal.

Let $f$ be a continuous function on $[0,1]$ such that for every $x\in [0,1]$, we have $\int_{x}^{1}f(t)dt \geq\frac{1-x^{2}}{2}$. Show that $\int_{0}^{1}f(t)^{2}dt \geq \frac{1}{3}$.

On a circle, Alina draws $2019$ chords, the endpoints of which are all different. A point is considered [i]marked[/i] if it is either $\text{(i)}$ one of the $4038$ endpoints of a chord; or $\text{(ii)}$ an intersection point of at least two chords. Alina labels each marked point. Of the $4038$ points meeting criterion $\text{(i)}$, Alina labels $2019$ points with a $0$ and the other $2019$ points with a $1$. She labels each point meeting criterion $\text{(ii)}$ with an arbitrary integer (not necessarily positive). Along each chord, Alina considers the segments connecting two consecutive marked points. (A chord with $k$ marked points has $k-1$ such segments.) She labels each such segment in yellow with the sum of the labels of its two endpoints and in blue with the absolute value of their difference. Alina finds that the $N + 1$ yellow labels take each value $0, 1, . . . , N$ exactly once. Show that at least one blue label is a multiple of $3$. (A chord is a line segment joining two different points on a circle.)

Find all differentiable functions $f:(0,\infty) \to \mathbb{R}$ such that $$f(b)-f(a)=(b-a)f’(\sqrt{ab}) \qquad \text{for all}\qquad a,b>0.$$ [i]Proposed by Orif Ibrogimov, National University of Uzbekistan[/i]

[u]Round 6[/u] [b]p16.[/b] Given that $x$ and $y$ are positive real numbers such that $x^3+y = 20$, the maximum possible value of $x + y$ can be written as $\frac{a\sqrt{b}}{c}$ +d where $a$, $b$, $c$, and $d$ are positive integers such that $gcd(a,c) = 1$ and $b$ is square-free. Find $a +b +c +d$. [b]p17.[/b] In $\vartriangle DRK$ , $DR = 13$, $DK = 14$, and $RK = 15$. Let $E$ be the intersection of the altitudes of $\vartriangle DRK$. Find the value of $\lfloor DE +RE +KE \rfloor$. [b]p18.[/b] Subaru the frog lives on lily pad $1$. There is a line of lily pads, numbered $2$, $3$, $4$, $5$, $6$, and $7$. Every minute, Subaru jumps from his current lily pad to a lily pad whose number is either $1$ or $2$ greater, chosen at random from valid possibilities. There are alligators on lily pads $2$ and $5$. If Subaru lands on an alligator, he dies and time rewinds back to when he was on lily pad number $1$. Find the expected number of jumps it takes Subaru to reach pad $7$. [u]Round 7[/u] This set has problems whose answers depend on one another. [b]p19.[/b] Let $B$ be the answer to Problem $20$ and let $C$ be the answer to Problem $21$. Given that $$f (x) = x^3-Bx-C = (x-r )(x-s)(x-t )$$ where $r$, $s$, and $t$ are complex numbers, find the value of $r^2+s^2+t^2$. [b]p20.[/b] Let $A$ be the answer to Problem $19$ and let $C$ be the answer to Problem $21$. Circles $\omega_1$ and $\omega_2$ meet at points $X$ and $Y$ . Let point $P \ne Y$ be the point on $\omega_1$ such that $PY$ is tangent to $\omega_2$, and let point $Q \ne Y$ be the point on $\omega_2$ such that $QY$ is tangent to $\omega_1$. Given that $PX = A$ and $QX =C$, find $XY$ . [b]p21.[/b] Let $A$ be the answer to Problem $19$ and let $B$ be the answer to Problem $20$. Given that the positive difference between the number of positive integer factors of $A^B$ and the number of positive integer factors of $B^A$ is $D$, and given that the answer to this problem is an odd prime, find $\frac{D}{B}-40$. [u]Round 8[/u] [b]p22.[/b] Let $v_p (n)$ for a prime $p$ and positive integer $n$ output the greatest nonnegative integer $x$ such that $p^x$ divides $n$. Find $$\sum^{50}_{i=1}\sum^{i}_{p=1} { v_p (i )+1 \choose 2},$$ where the inner summation only sums over primes $p$ between $1$ and $i$ . [b]p23.[/b] Let $a$, $b$, and $c$ be positive real solutions to the following equations. $$\frac{2b^2 +2c^2 -a^2}{4}= 25$$ $$\frac{2c^2 +2a^2 -b^2}{4}= 49$$ $$\frac{2a^2 +2b^2 -c^2}{4}= 64$$ The area of a triangle with side lengths $a$, $b$, and $c$ can be written as $\frac{x\sqrt{y}}{z}$ where $x$ and $z$ are relatively prime positive integers and $y$ is square-free. Find $x + y +z$. [b]p24.[/b] Alan, Jiji, Ina, Ryan, and Gavin want to meet up. However, none of them know when to go, so they each pick a random $1$ hour period from $5$ AM to $11$ AM to meet up at Alan’s house. Find the probability that there exists a time when all of them are at the house at one time. [b]Round 9 [/b] [b]p25.[/b] Let $n$ be the number of registered participantsin this $LMT$. Estimate the number of digits of $\left[ {n \choose 2} \right]$ in base $10$. If your answer is $A$ and the correct answer is $C$, then your score will be $$\left \lfloor \max \left( 0,20 - \left| \ln \left( \frac{A}{C}\right) \cdot 5 \right|\right| \right \rfloor.$$ [b]p26.[/b] Let $\gamma$ be theminimum value of $x^x$ over all real numbers $x$. Estimate $\lfloor 10000\gamma \rfloor$. If your answer is $A$ and the correct answer is $C$, then your score will be $$\left \lfloor \max \left( 0,20 - \left| \ln \left( \frac{A}{C}\right) \cdot 5 \right|\right| \right \rfloor.$$ [b]p27.[/b] Let $$E = \log_{13} 1+log_{13}2+log_{13}3+...+log_{13}513513.$$ Estimate $\lfloor E \rfloor$. If your answer is $A$ and the correct answer is $C$, your score will be $$\left \lfloor \max \left( 0,20 - \left| \ln \left( \frac{A}{C}\right) \cdot 5 \right|\right| \right \rfloor.$$ PS. You should use hide for answers. Rounds 1-5 have been posted [url=https://artofproblemsolving.com/community/c3h3167127p28823220]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In a mathematical challenge, positive real numbers $a_{1}\geq a_{2} \geq ... \geq a_{n}$ and an initial sequence of positive real numbers $(b_{1}, b_{2},...,b_{n+1})$ are given to Secco. Let $C$ a non-negative real number. In a sequence $(x_{1},x_{2},...,x_{n+1})$, consider the following operation: Subtract $1$ of some $x_{j}$, $j \in \{1,2,...,n+1\}$, add $C$ to $x_{n+1}$ and replace $(x_{1},x_{2},...,x_{j-1})$ for $(x_{1}+a_{\sigma (1)}, x_{2}+a_{\sigma (2)}, ..., x_{j-1}+a_{\sigma (j-1)})$, where $\sigma$ is a permutation of $(1,2,...,j-1)$. Secco's goal is to make all terms of sequence $(b_{k})$ negative after a finite number of operations. Find all values of $C$, depending of $a_{1}, a_{2},..., a_{n}, b_{1}, b_{2}, ..., b_{n+1}$, for which Secco can attain his goal.

For what positive numbers $m$ and $n$ do there exist points $A_1, ..., Am$ and $B_1 ..., B_n$ in the plane such that, for any point $P$, the equation $$|PA_1|^2 +... + |PA_m|^2 =|PB_1|^2+...+|PA_n|^2 $$ holds true?

Let $ABCD$ be a cyclic quadrilaterla and let $E$ be the point of intersection of its diagonals $AC$ and $BD$. Suppose $AD$ and $BC$ meet in $F$. Let the midpoints of $AB$ and $CD$ be $G$ and $H$ respectively. If $\Gamma $ is the circumcircle of triangle $EGH$, prove that $FE$ is tangent to $\Gamma $.

Let $ABC$ be an acute, non isosceles triangle with the orthocenter $H$, circumcenter $O$ and $AD$ is the diameter of $(O)$. Suppose that the circle $(AHD)$ meets the lines $AB, AC$ at $F$, respectively. Denote $J, K$ as orthocenter and nine- point center of $AEF$. Prove that $HJ \parallel BC$ and $KO = KH$.

In the puzzle below, dots are placed in some of the empty squares (one dot per square) so that each number gives the combined number of dots in its row and column. How many dots must be placed to complete the puzzle? [asy] size(5cm,0); draw((0,0)--(5,0)); draw((0,1)--(5,1)); draw((0,2)--(5,2)); draw((0,3)--(5,3)); draw((0,4)--(5,4)); draw((0,5)--(5,5)); draw((0,0)--(0,5)); draw((1,0)--(1,5)); draw((2,0)--(2,5)); draw((3,0)--(3,5)); draw((4,0)--(4,5)); draw((5,0)--(5,5)); label("$1$",(2.5,4.5)); label("$2$",(4.5,4.5)); label("$3$",(2.5,1.5)); label("$4$",(2.5,3.5)); label("$5$",(4.5,3.5)); label("$6$",(0.5,2.5)); label("$7$",(3.5,0.5)); [/asy]

The polynomial $f(x)=x^3-4\sqrt{3}x^2+13x-2\sqrt{3}$ has three real roots, $a$, $b$, and $c$. Find $$\max\{a+b-c,a-b+c,-a+b+c\}.$$