Let $P(x)$ be a polynomial with integer coefficients such that $P(0)=1$, and let $c > 1$ be an integer. Define $x_0=0$ and $x_{i+1} = P(x_i)$ for all integers $i \ge 0$. Show that there are infinitely many positive integers $n$ such that $\gcd (x_n, n+c)=1$. [i]Proposed by Milan Haiman and Carl Schildkraut[/i]

Let $f(w) = w^3 - rw^2 + sw - \frac{4\sqrt2}{27}$ denote a polynomial, where $r^2 =\left(\frac{8\sqrt2+10}{7}\right) s$. The roots of $f$ correspond to the sides of a right triangle. Compute the smallest possible area of this triangle

Let $P(X) = a_n X^n + a_{n-1} X^{n-1} + \cdots + a_1 X + a_0$ be a polynomial with real coefficients such that $0 \leqslant a_i \leqslant a_0$ for $i = 1, 2, \ldots, n$. Prove that, if $P(X)^2 = b_{2n} X^{2n} + b_{2n-1} X^{2n-1} + \cdots + b_{n+1} X^{n+1} + \cdots + b_1 X + b_0$, then $4 b_{n+1} \leqslant P(1)^2$.

Let $\varphi(n)$ denotes the number of positive integers less than or equal to $n$ which are relatively prime to $n$. Determine the number of positive integers $2\leq n\leq 50$ such that all coefficients of the polynomial \[ \left(x^{\varphi(n)} - 1\right) - \prod_{\substack{1\leq k\leq n\\\gcd(k,n) = 1}}(x-k) \] are divisible by $n$.

In a rectangular coordinate system we call a horizontal line parallel to the $x$ -axis triangular if it intersects the curve with equation \[y = x^4 + px^3 + qx^2 + rx + s\] in the points $A,B,C$ and $D$ (from left to right) such that the segments $AB, AC$ and $AD$ are the sides of a triangle. Prove that the lines parallel to the $x$ - axis intersecting the curve in four distinct points are all triangular or none of them is triangular.

Let $d$ and $m$ be two fixed positive integers. Pinocchio and Geppetto know the values of $d$ and $m$ and play the following game: In the beginning, Pinocchio chooses a polynomial $P$ of degree at most $d$ with integer coefficients. Then Geppetto asks him questions of the following form "What is the value of $P(n)$?'' for $n \in \mathbb{Z}$. Pinocchio usually says the truth, but he can lie up to $m$ times. What is, as a function of $d$ and $m$, the minimal number of questions that Geppetto needs to ask to be sure to determine $P$, no matter how Pinocchio chooses to reply?

Given the polynomial $ P(x) = \frac{1}{2} - \frac{1}{3}x + \frac{1}{6}x^2 $. Let $ Q(x) = \sum_{k=0}^{m} b_k x^k $ be a polynomial given by $$ Q(x) = P(x) \cdot P(x^3) \cdot P(x^9) \cdot P(x^{27}) \cdot P(x^{81}). $$ Calculate $ \sum_{k=0}^m |b_k| $.

A quadratic polynomial $p(x)$ with integer coefficients satisfies $p(41) = 42$. For some integers $a, b > 41$, $p(a) = 13$ and $p(b) = 73$. Compute the value of $p(1)$. [i]Proposed by Aaron Lin[/i]

Let $b$, $c$ be integer numbers, and define $f(x)=(x+b)^2-c$. i) If $p$ is a prime number such that $c$ is divisible by $p$ but not by $p^{2}$, show that for every integer $n$, $f(n)$ is not divisible by $p^{2}$. ii) Let $q \neq 2$ be a prime divisor of $c$. If $q$ divides $f(n)$ for some integer $n$, show that for every integer $r$ there exists an integer $n'$ such that $f(n')$ is divisible by $qr$.

[u]Set 6[/u] [b]p16.[/b] Let $n! = n \times (n - 1) \times ... \times 2 \times 1$. Find the maximum positive integer value of $x$ such that the quotient $\frac{160!}{160^x}$ is an integer. [b]p17.[/b] Let $\vartriangle OAB$ be a triangle with $\angle OAB = 90^o$ . Draw points $C, D, E, F, G$ in its plane so that $$\vartriangle OAB \sim \vartriangle OBC \sim \vartriangle OCD \sim \vartriangle ODE \sim \vartriangle OEF \sim \vartriangle OFG,$$ and none of these triangles overlap. If points $O, A, G$ lie on the same line, then let $x$ be the sum of all possible values of $\frac{OG}{OA }$. Then, $x$ can be expressed in the form $m/n$ for relatively prime positive integers $m, n$. Compute $m + n$. [b]p18.[/b] Let $f(x)$ denote the least integer greater than or equal to $x^{\sqrt{x}}$. Compute $f(1)+f(2)+f(3)+f(4)$. [u]Set 7[/u] The Fibonacci sequence $\{F_n\}$ is defined as $F_0 = 0$, $F_1 = 1$ and $F_{n+2} = F_{n+1} + F_n$ for all integers $n \ge 0$. [b]p19.[/b] Find the least odd prime factor of $(F_3)^{20} + (F_4)^{20} + (F_5)^{20}$. [b]p20.[/b] Let $$S = \frac{1}{F_3F_5}+\frac{1}{F_4F_6}+\frac{1}{F_5F_7}+\frac{1}{F_6F_8}+...$$ Compute $420S$. [b]p21.[/b] Consider the number $$Q = 0.000101020305080130210340550890144... ,$$ the decimal created by concatenating every Fibonacci number and placing a 0 right after the decimal point and between each Fibonacci number. Find the greatest integer less than or equal to $\frac{1}{Q}$. [u]Set 8[/u] [b]p22.[/b] In five dimensional hyperspace, consider a hypercube $C_0$ of side length $2$. Around it, circumscribe a hypersphere $S_0$, so all $32$ vertices of $C_0$ are on the surface of $S_0$. Around $S_0$, circumscribe a hypercube $C_1$, so that $S_0$ is tangent to all hyperfaces of $C_1$. Continue in this same fashion for $S_1$, $C_2$, $S_2$, and so on. Find the side length of $C_4$. [b]p23.[/b] Suppose $\vartriangle ABC$ satisfies $AC = 10\sqrt2$, $BC = 15$, $\angle C = 45^o$. Let $D, E, F$ be the feet of the altitudes in $\vartriangle ABC$, and let $U, V , W$ be the points where the incircle of $\vartriangle DEF$ is tangent to the sides of $\vartriangle DEF$. Find the area of $\vartriangle UVW$. [b]p24.[/b] A polynomial $P(x)$ is called spicy if all of its coefficients are nonnegative integers less than $9$. How many spicy polynomials satisfy $P(3) = 2019$? [i]The next set will consist of three estimation problems.[/i] [u]Set 9[/u] Points will be awarded based on the formulae below. Answers are nonnegative integers that may exceed $1,000,000$. [b]p25.[/b] Suppose a circle of radius $20192019$ has area $A$. Let s be the side length of a square with area $A$. Compute the greatest integer less than or equal to $s$. If $n$ is the correct answer, an estimate of $e$ gives $\max \{ 0, \left\lfloor 1030 ( min \{ \frac{n}{e},\frac{e}{n}\}^{18}\right\rfloor -1000 \}$ points. [b]p26.[/b] Given a $50 \times 50$ grid of squares, initially all white, define an operation as picking a square and coloring it and the four squares horizontally or vertically adjacent to it blue, if they exist. If a square is already colored blue, it will remain blue if colored again. What is the minimum number of operations necessary to color the entire grid blue? If $n$ is the correct answer, an estimate of $e$ gives $\left\lfloor \frac{180}{5|n-e|+6}\right\rfloor$ points. [b]p27.[/b] The sphere packing problem asks what percent of space can be filled with equally sized spheres without overlap. In three dimensions, the answer is $\frac{\pi}{3\sqrt2} \approx 74.05\%$ of space (confirmed as recently as $2017!$), so we say that the packing density of spheres in three dimensions is about $0.74$. In fact, mathematicians have found optimal packing densities for certain other dimensions as well, one being eight-dimensional space. Let d be the packing density of eight-dimensional hyperspheres in eightdimensional hyperspace. Compute the greatest integer less than $10^8 \times d$. If $n$ is the correct answer, an estimate of e gives $\max \left\{ \lfloor 30-10^{-5}|n - e|\rfloor, 0 \right\}$ points. PS. You had better use hide for answers. First sets have be posted [url=https://artofproblemsolving.com/community/c4h2777330p24370124]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ \varphi(x)$ be a cubic polynomial with integer coefficients. Given that $ \varphi(x)$ has have 3 distinct real roots $u,v,w $ and $u,v,w $ are not rational number. there are integers $ a, b,c$ such that $u=av^2+bv+c$. Prove that $b^2 -2b -4ac - 7$ is a square number .

Find a method by which one can compute the coefficients of $P(x) = x^6 + a_1x^5 + \cdots+ a_6$ from the roots of $P(x) = 0$ by performing not more than $15$ additions and $15$ multiplications.

For a complex number $z=1+2\sqrt{6}i$ and natural number $n=1,\ 2,\ 3,\ \cdots$, express the complex number $z^n$ in using real numbers $a_n,\ b_n$ as $z^n=a_n+b_ni$. Answer the following questions. (1) Show that $a_n^2+b_n^2=5^{2n}\ (n=1,\ 2,\ 3,\ \cdots).$ (2) Find the constants $p,\ q$ such that $a_{n+2}=pa_{n+1}+qa_n$ holds for all $n$. (3) Show that $a_n$ is not a multiple of $5$ for any $n$. (4) Show that $z^n\ (n=1,\ 2,\ 3,\ \cdots)$ is not a real number.

Find all numbers $\alpha$ for which the equation \[x^2 - 2x[x] + x -\alpha = 0\] has two nonnegative roots. ($[x]$ denotes the largest integer less than or equal to x.)

An ordered quadruple $(y_1,y_2,y_3,y_4)$ is $\textbf{quadratic}$ if there exist real numbers $a$, $b$, and $c$ such that \[y_n=an^2+bn+c\] for $n=1,2,3,4$. Prove that if $16$ numbers are placed in a $4\times 4$ grid such that all four rows are quadratic and the first three columns are also quadratic then the fourth column must also be quadratic. [i](We say that a row is quadratic if its entries, in order, are quadratic. We say the same for a column.)[/i] [asy] size(100); defaultpen(linewidth(0.8)); for(int i=0;i<=4;i=i+1) draw((i,0)--(i,4)); for(int i=0;i<=4;i=i+1) draw((0,i)--(4,i)); [/asy]