The square polynomial $f(x)=ax^2+bx+c$ is of such a sort, that the equation $f(x)=x$ does not have real roots. Prove that the equation $f(f(x))=0$ does not have real roots also.

Let $x,y,z$ be complex numbers satisfying \begin{align*} z^2 + 5x &= 10z \\ y^2 + 5z &= 10y \\ x^2 + 5y &= 10x \end{align*} Find the sum of all possible values of $z$. [i]Proposed by Aaron Lin[/i]

[u]Round 1[/u] [b]p1.[/b] The fractal T-shirt for this year's Duke Math Meet is so complicated that the printer broke trying to print it. Thus, we devised a method for manually assembling each shirt - starting with the full-size 'base' shirt, we paste a smaller shirt on top of it. And then we paste an even smaller shirt on top of that one. And so on, infinitely many times. (As you can imagine, it took a while to make all the shirts.) The completed T-shirt consists of the original 'base' shirt along with all of the shirts we pasted onto it. Now suppose the base shirt requires $2011$ $cm^2$ of fabric to make, and that each pasted-on shirt requires $4/5$ as much fabric as the previous one did. How many $cm^2$ of fabric in total are required to make one complete shirt? [b]p2.[/b] A dog is allowed to roam a yard while attached to a $60$-meter leash. The leash is anchored to a $40$-meter by $20$-meter rectangular house at the midpoint of one of the long sides of the house. What is the total area of the yard that the dog can roam? [b]p3.[/b] $10$ birds are chirping on a telephone wire. Bird $1$ chirps once per second, bird $2$ chirps once every $2$ seconds, and so on through bird $10$, which chirps every $10$ seconds. At time $t = 0$, each bird chirps. Define $f(t)$ to be the number of birds that chirp during the $t^{th}$ second. What is the smallest $t > 0$ such that $f(t)$ and $f(t + 1)$ are both at least $4$? [u]Round 2[/u] [b]p4.[/b] The answer to this problem is $3$ times the answer to problem 5 minus $4$ times the answer to problem 6 plus $1$. [b]p5.[/b] The answer to this problem is the answer to problem 4 minus $4$ times the answer to problem 6 minus $1$. [b]p6.[/b] The answer to this problem is the answer to problem 4 minus $2$ times the answer to problem 5. [u]Round 3[/u] [b]p7.[/b] Vivek and Daniel are playing a game. The game ends when one person wins $5$ rounds. The probability that either wins the first round is $1/2$. In each subsequent round the players have a probability of winning equal to the fraction of games that the player has lost. What is the probability that Vivek wins in six rounds? [b]p8.[/b] What is the coefficient of $x^8y^7$ in $(1 + x^2 - 3xy + y^2)^{17}$? [b]p9.[/b] Let $U(k)$ be the set of complex numbers $z$ such that $z^k = 1$. How many distinct elements are in the union of $U(1),U(2),...,U(10)$? [u]Round 4[/u] [b]p10.[/b] Evaluate $29 {30 \choose 0}+28{30 \choose 1}+27{30 \choose 2}+...+0{30 \choose 29}-{30\choose 30}$. You may leave your answer in exponential format. [b]p11.[/b] What is the number of strings consisting of $2a$s, $3b$s and $4c$s such that $a$ is not immediately followed by $b$, $b$ is not immediately followed by $c$ and $c$ is not immediately followed by $a$? [b]p12.[/b] Compute $\left(\sqrt3 + \tan (1^o)\right)\left(\sqrt3 + \tan (2^o)\right)...\left(\sqrt3 + \tan (29^o)\right)$. [u]Round 5[/u] [b]p13.[/b] Three massless legs are randomly nailed to the perimeter of a massive circular wooden table with uniform density. What is the probability that the table will not fall over when it is set on its legs? [b]p14.[/b] Compute $$\sum^{2011}_{n=1}\frac{n + 4}{n(n + 1)(n + 2)(n + 3)}$$ [b]p15.[/b] Find a polynomial in two variables with integer coefficients whose range is the positive real numbers. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]7.[/b] Let $V$ be a finite-dimensional subspace of $C[0,1]$ such that every nonzero $f\in V$ attains positive value at some point. Prove that there exists a polynomial $P$ that is strictly positive on $[0,1]$ and orthogonal to $V$, that is, for every $f \in V$, $\int_{0}^{1} f(x)P(x)dx =0$ ([b]F.39[/b]) [A. Pinkus, V. Totik]

A quadratic polynomial with positive integer coefficients and rational roots can be written as $196x^2+Bx + 135$ for some integer $B.$ What is the sum of all possible values of $B$ such that $\gcd(B, 196 \cdot 135) = 1$?

Let $M=\bigoplus_{i \in \mathbb{Z}} \mathbb{C}e_i$ be an infinite dimensional $\mathbb{C}$-vector space, and let $\text{End}(M)$ denote the $\mathbb{C}$-algebra of $\mathbb{C}$-linear endomorphisms of $M$. Let $A$ and $B$ be two commuting elements in $\text{End}(M)$ satisfying the following condition: there exist integers $m \le n<0<p \le q$ satisfying $\text{gd}(-m,p)=\text{gcd}(-n,q)=1$, and such that for every $j \in \mathbb{Z}$, one has \[Ae_j=\sum_{i=j+m}^{j+n} a_{i,j}e_i, \quad \text{with } a_{i,j} \in \mathbb{C}, a_{j+m,j}a_{j+n,j} \ne 0,\] \[Be_j=\sum_{i=j+p}^{j+q} b_{i,j}e_i, \quad \text{with } b_{i,j} \in \mathbb{C}, b_{j+p,j}b_{j+q,j} \ne 0.\] Let $R \subset \text{End}(M)$ be the $\mathbb{C}$-subalgebra generated by $A$ and $B$. Note that $R$ is commutative and $M$ can be regarded as an $R$-module. (a) Show that $R$ is an integral domain and is isomorphic to $R \cong \mathbb{C}[x,y]/f(x,y)$, where $f(x,y)$ is a non-zero polynomial such that $f(A,B)=0$. (b) Let $K$ be the fractional field of $R$. Show that $M \otimes_R K$ is a $1$-dimensional vector space over $K$.

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$.

Given is the equation: \[x^2+mx+2022=0\] a) Find all the values of the parameter $m$, such that the two solutions of the equation $x_1, x_2$ are $\textbf{natural}$ numbers b)Find all the values of the parameter $m$, such that the two solutions of the equation $x_1, x_2$ are $\textbf{integer}$ numbers

For each real coefficient polynomial $f(x)={{a}_{0}}+{{a}_{1}}x+\cdots +{{a}_{n}}{{x}^{n}}$, let $$\Gamma (f(x))=a_{0}^{2}+a_{1}^{2}+\cdots +a_{m}^{2}.$$ Let be given polynomial $P(x)=(x+1)(x+2)\ldots (x+2020).$ Prove that there exists at least $2019$ pairwise distinct polynomials ${{Q}_{k}}(x)$ with $1\le k\le {{2}^{2019}}$ and each of it satisfies two following conditions: i) $\deg {{Q}_{k}}(x)=2020.$ ii) $\Gamma \left( {{Q}_{k}}{{(x)}^{n}} \right)=\Gamma \left( P{{(x)}^{n}} \right)$ for all positive initeger $n$.

Find all pairs of solutions $(x,y)$: \[ x^3 + x^2y + xy^2 + y^3 = 8(x^2 + xy + y^2 + 1). \]

Find all positive integers $n$ such that there exist a permutation $\sigma$ on the set $\{1,2,3, \ldots, n\}$ for which \[\sqrt{\sigma(1)+\sqrt{\sigma(2)+\sqrt{\ldots+\sqrt{\sigma(n-1)+\sqrt{\sigma(n)}}}}}\] is a rational number.

Let be given three quadratic polynomials: $P_1(x) = x^2 + p_1x+q_1, P_2(x) = x^2+ p_2x+q_2, P_3(x) = x^2 + p_3x+q_3$. Prove that the equation $|P_1(x)|+|P_2(x)| = |P_3(x)|$ has at most eight real roots.

Given the polynomial $p(x) = x^2 + x - 70$, do there exist integers $0<m<n$, so that $p(m)$ is divisible by $n$ and $p(m+1)$ is divisible by $n+1$? [i]Proposed by Nairy Sedrakyan[/i]

Let $P(x)=x^n +a_1x^{n-1}+a_2x^{n-2}+\ldots+a_{n-1}x+a_n$ be a polynomial of degree $n$ and $n$ real roots, all of them in the interval $(0,1)$. Prove that for all $k=\overline{1,n}$ the following inequality holds: \[(-1)^k(a_k+a_{k+1}+\ldots+a_n)>0.\] [i]Proposed by N. Safaei (Iran)[/i]

[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].