[u]Round 9[/u] [b]p25.[/b] Find the largest prime factor of $1031301$. [b]p26.[/b] Let $ABCD$ be a trapezoid such that $AB \parallel CD$, $\angle ABC = 90^o$ , $AB = 5$, $BC = 20$, $CD = 15$. Let $X$, $Y$ be the intersection of the circle with diameter $BC$ and segment $AD$. Find the length of $XY$. [b]p27.[/b] A string consisting of $1$’s, $2$’s, and $3$’s is said to be a superpermutation of the string $123$ if it contains every permutation of $123$ as a contiguous substring. Find the smallest possible length of such a superpermutation. [u]Round 10[/u] [b]p28.[/b] Suppose that we have a function $f (x) = x^3 -3x^2 +3x$, and for all $n \ge 1$, $f^n(x)$ is defined by the function $f$ applied $n$ times to $x$. Find the remainder when $f^5(2019)$ is divided by $100$. [b]p29.[/b] A function $f : {1,2, . . . ,10} \to {1,2, . . . ,10}$ is said to be happy if it is a bijection and for all $n \in {1,2, . . . ,10}$, $|n - f (n)| \le 1$. Compute the number of happy functions. [b]p30.[/b] Let $\vartriangle LMN$ have side lengths $LM = 15$, $MN = 14$, and $NL = 13$. Let the angle bisector of $\angle MLN$ meet the circumcircle of $\vartriangle LMN$ at a point $T \ne L$. Determine the area of $\vartriangle LMT$ . [u]Round 11[/u] [b]p31.[/b] Find the value of $$\sum_{d|2200} \tau (d),$$ where $\tau (n)$ denotes the number of divisors of $n$, and where $a|b$ means that $\frac{b}{a}$ is a positive integer. [b]p32.[/b] Let complex numbers $\omega_1,\omega_2, ...,\omega_{2019}$ be the solutions to the equation $x^{2019}-1 = 0$. Evaluate $$\sum^{2019}_{i=1} \frac{1}{1+ \omega_i}.$$ [b]p33.[/b] Let $M$ be a nonnegative real number such that $x^{x^{x^{...}}}$ diverges for all $x >M$, and $x^{x^{x^{...}}}$ converges for all $0 < x \le M$. Find $M$. [u]Round 12[/u] [b]p34.[/b] Estimate the number of digits in ${2019 \choose 1009}$. If your estimate is $E$ and the actual value is $A$, your score for this problem will be $$\max \, \left( 0, \left \lfloor 15-10 \cdot \left|\log_{10} \left( \frac{A}{E} \right) \right| \right \rfloor \right).$$ [b]p35.[/b] You may submit any integer $E$ from $1$ to $30$. Out of the teams that submit this problem, your score will be $$\frac{E}{2 \, (the\,\, number\,\, of\,\, teams\,\, who\,\, chose\,\, E)}$$ [b]p36.[/b] We call a $m \times n$ domino-tiling a configuration of $2\times 1$ dominoes on an $m\times n$ cell grid such that each domino occupies exactly $2$ cells of the grid and all cells of the grid are covered. How many $8 \times 8$ domino-tilings are there? If your estimate is $E$ and the actual value is $A$, your score for this problem will be $$\max \, \left( 0, \left \lfloor 15-10 \cdot \left|\log_{10} \left( \frac{A}{E} \right) \right| \right \rfloor \right).$$ PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3166016p28809598]here [/url] and 5-8 [url=https://artofproblemsolving.com/community/c3h3166019p28809679]here[/url].Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all real polynomials $ f$ with $ x,y \in \mathbb{R}$ such that \[ 2 y f(x \plus{} y) \plus{} (x \minus{} y)(f(x) \plus{} f(y)) \geq 0. \]

Find all functions $f : \mathbb{N} \rightarrow \mathbb{R}$ such that for all triples $a,b,c$ of positive integers the following holds : $$f(ac)+f(bc)-f(c)f(ab) \ge 1$$ Proposed by [i]Mojtaba Zare[/i]

Each of the quadratic polynomials $P(x), Q(x)$ and $P(x)+Q(x)$ with real coefficients has a repeated root. Is it guaranteed that those roots coincide? [i]Boris Frenkin[/i]

$S$ is the set of functions $f:\mathbb{N} \to \mathbb{R}$ that satisfy the following conditions: [b]I.[/b] $f(1) = 2$ [b]II.[/b] $f(n+1) \geq f(n) \geq \frac{n}{n + 1} f(2n)$ for $n = 1, 2, \ldots$ Find the smallest $M \in \mathbb{N}$ such that for any $f \in S$ and any $n \in \mathbb{N}, f(n) < M$.

What is the sum of real roots of the equation $x^4-7x^3+14x^2-14x+4=0$? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

Find all monotonic functions $u:\mathbb{R}\rightarrow\mathbb{R}$ which have the property that there exists a strictly monotonic function $f:\mathbb{R}\rightarrow\mathbb{R}$ such that \[f(x+y)=f(x)u(x)+f(y) \] for all $x,y\in\mathbb{R}$. [i]Vasile Pop[/i]

Let $m,n \in Z, m\ne n, m \ne 0, n \ne 0$ . Find all $f: Z \to R$ such that $f(mx+ny)=mf(x)+nf(y)$ for all $x,y \in Z$ .

Find all $f : \mathbb{R}\to \mathbb{R}$ , bounded in $(0,1)$ and satisfying: $x^2 f(x) - y^2 f(y) = (x^2-y^2) f(x+y) -xy f(x-y)$ for all $x,y \in \mathbb{R}$ [i]Proposed by Nikolay Nikolov[/i]

Let $n\geq 2$ be an integer. For each $k$-tuple of positive integers $a_1, a_2, \ldots, a_k$ such that $a_1+a_2+\cdots +a_k=n$, consider the sums $S_i=1+2+\ldots +a_i$ for $1\leq i\leq k$. Determine, in terms of $n$, the maximum possible value of the product $S_1S_2\cdots S_k$. [i]Proposed by Misael Pelayo[/i]

Find the minimum of $\sum\limits_{k=0}^{40} \left(x+\frac{k}{2}\right)^2$ where $x$ is a real numbers

For a finite set $ X$ of positive integers, let $ \Sigma(X) \equal{} \sum_{x \in X} \arctan \frac{1}{x}.$ Given a finite set $ S$ of positive integers for which $ \Sigma(S) < \frac{\pi}{2},$ show that there exists at least one finite set $ T$ of positive integers for which $ S \subset T$ and $ \Sigma(S) \equal{} \frac{\pi}{2}.$ [i]Kevin Buzzard, United Kingdom[/i]

Let $a_1,a_2,\cdots,a_n$ be a sequence of real numbers lying between $1$ and $-1$, i.e. $-1<a_i<1$, for $1\leq i \leq n$ and such that (i) $a_1+a_2+\cdots+a_n=0$ (ii) $a_1^2+a_2^2+\cdots+a_n^2=40$ Determine the smallest possible value of $n$

Six real numbers $x_1<x_2<x_3<x_4<x_5<x_6$ are given. For each triplet of distinct numbers of those six Vitya calculated their sum. It turned out that the $20$ sums are pairwise distinct; denote those sums by $$s_1<s_2<s_3<\cdots<s_{19}<s_{20}.$$ It is known that $x_2+x_3+x_4=s_{11}$, $x_2+x_3+x_6=s_{15}$ and $x_1+x_2+x_6=s_{m}$. Find all possible values of $m$.

Two sums, each consisting of $n$ addends , are shown below: $S = 1 + 2 + 3 + 4 + ...$ $T = 100 + 98 + 96 + 94 +...$ . For what value of $n$ is it true that $S = T$ ?

[u]Round 9[/u] [b]p25.[/b] For how many nonempty subsets of $\{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16\}$ is the sum of the elements divisble by $32$? [b]p26.[/b] America declared independence in $1776$. Take the sum of the cubes of the digits of $1776$ and let that equal $S_1$. Sum the cubes of the digits of $S_1$ to get $S_2$. Repeat this process $1776$ times. What is $S_{1776}$? [b]p27.[/b] Every Golden Grahams box contains a randomly colored toy car, which is one of four colors. What is the expected number of boxes you have to buy in order to obtain one car of each color? [u]Round 10[/u] [b]p28.[/b] Let $B$ be the answer to Question $29$ and $C$ be the answer to Question $30$. What is the sum of the square roots of $B$ and $C$? [b]p29.[/b] Let $A$ be the answer to Question $28$ and $C$ be the answer to Question $30$. What is the sum of the sums of the digits of $A$ and $C$? [b]p30.[/b] Let $A$ be the answer to Question $28$ and $B$ be the answer to Question $29$. What is $A + B$? [u]Round 11[/u] [b]p31.[/b] If $x + \frac{1}{x} = 4$, find $x^6 + \frac{1}{x^6}$. [b]p32.[/b] Given a positive integer $n$ and a prime $p$, there is are unique nonnegative integers $a$ and $b$ such that $n = p^b \cdot a$ and $gcd (a, p) = 1$. Let $v_p(n)$ denote this uniquely determined $a$. Let $S$ denote the set of the first 20 primes. Find $\sum_{ p \in S} v_p \left(1 + \sum^{100}_{i=0} p^i \right)$. [b]p33. [/b] Find the maximum value of n such that $n+ \sqrt{(n - 1) +\sqrt{(n - 2) + ... +\sqrt{1}}} < 49$ (Note: there would be $n - 1$ square roots and $n$ total terms). [u]Round 12[/u] [b]p34.[/b] Give two numbers $a$ and $b$ such that $2015^a < 2015! < 2015^b$. If you are incorrect you get $-5$ points; if you do not answer you get $0$ points; otherwise you get $\max \{20-0.02(|b - a| - 1), 0\}$ points, rounded down to the nearest integer. [b]p35.[/b] Twin primes are prime numbers whose difference is $2$. Let $(a, b)$ be the $91717$-th pair of twin primes, with $a < b$. Let $k = a^b$, and suppose that $j$ is the number of digits in the base $10$ representation of $k$. What is $j^5$? If the correct answer is $n$ and you say $m$, you will receive $\max \left(20 - | \log \left(| \frac{m}{n} |\right), 0 \right)$ points, rounded down to the nearest integer. [b]p36.[/b] Write down any positive integer. Let the sum of the valid submissions (i.e. positive integer submissions) for all teams be $S$. One team will be chosen randomly, according to the following distribution: if your team's submission is $n$, you will be chosen with probability $\frac{n}{S}$ . The amount of points that the chosen team will win is the greatest integer not exceeding $\min \{K, \frac{ 10000}{S} \}$. $K$ is a predetermined secret value. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3157009p28696627]here [/url] and 5-8 [url=https://artofproblemsolving.com/community/c3h3157013p28696685]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a$ be the root of the equation $x^3-x-1=0$. Find an equation of the third degree with integer coefficients whose root is $a^3$.

Let $\alpha \in \left( 0, \dfrac{\pi}{2}\right)$.Find the minimum value of the expression $$ P = (1+\cos\alpha)\left(1+\frac{1}{\sin \alpha} \right)+(1+\sin \alpha)\left(1+\frac{1}{\cos \alpha} \right) .$$

In chess, there are two types of minor pieces, the bishop and the knight. A bishop may move along a diagonal, as long as there are no pieces obstructing its path. A knight may jump to any lattice square $\sqrt{5}$ away as long as it isn't occupied. One day, a bishop and a knight were on squares in the same row of an infinite chessboard, when a huge meteor storm occurred, placing a meteor in each square on the chessboard independently and randomly with probability $p$. Neither the bishop nor the knight were hit, but their movement may have been obstructed by the meteors. The value of $p$ that would make the expected number of valid squares that the bishop can move to and the number of squares that the knight can move to equal can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a, b$. Compute $100a + b$. [i]Proposed by Lewis Chen[/i]

For how many integers $a$ with $|a| \leq 2005$, does the system $x^2=y+a$ $y^2=x+a$ have integer solutions?

$a$ and $b$ are natural numbers such that $b > a > 1$, and $a$ does not divide $b$. The sequence of natural numbers $\{b_n\}_{n=1}^\infty$ satisfies $b_{n + 1} \geq 2b_n \forall n \in \mathbb{N}$. Does there exist a sequence $\{a_n\}_{n=1}^\infty$ of natural numbers such that for all $n \in \mathbb{N}$, $a_{n + 1} - a_n \in \{a, b\}$, and for all $m, l \in \mathbb{N}$ ($m$ may be equal to $l$), $a_m + a_l \not\in \{b_n\}_{n=1}^\infty$?

Find all triples of non-negative integers $(a,b,c)$ which simultaneously satisfy the conditions: [list] [*] $1\leq a<b<c\leq 100$, [*] $b$ is the geometric mean of $a$ and $c$, [*] $\{\sqrt{b}\}$ is the arithmetic mean of $\{\sqrt{a}\}$ and $\{\sqrt{c}\}$.

Let the sequence $a_1,a_2,\ldots,a_n,\ldots$ is defined by the conditions: $a_1=2$ and $a_{n+1}=a_n^2-a_n+1$ $(n=1,2,\ldots)$. Prove that: (a) $a_m$ and $a_n$ are relatively prime numbers when $m\ne n$. (b) $\lim_{n\to\infty}\sum_{k=1}^n\frac1{a_k}=1$ [i]I. Tonov[/i]

Given a sequence $a_1,a_2,a_3,\ldots $ of positive integers in which every positive integer occurs exactly once. Prove that there exist integers $\ell $ and $m,\ 1<\ell <m$, such that $a_1+a_m=2a_{\ell}$.

Let $ABCD$ be a rectangle with: $AB=a$, $BC=b$. Inside the rectangle we have to exteriorly tangents circles such that one is tangent to the sides $AB$ and $AD$,the other is tangent to the sides $CB$ and $CD$. 1. Find the distance between the centers of the circles(using $a$ and $b$). 2. When the radiums of both circles change the tangency point between both of them changes, and describes a locus. Find that locus.