Let $P(x) = x^2 - 3x - 7$, and let $Q(x)$ and $R(x)$ be two quadratic polynomials also with the coefficient of $x^2$ equal to $1$. David computes each of the three sums $P + Q$, $P + R$, and $Q + R$ and is surprised to find that each pair of these sums has a common root, and these three common roots are distinct. If $Q(0) = 2$, then $R(0) = \dfrac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

As $a$, $b$ and $c$ range over [i]all[/i] real numbers, let $m$ be the smallest possible value of $$2\left(a+b+c\right)^2+\left(ab-4\right)^2+\left(bc-4\right)^2+\left(ca-4\right)^2$$ and $n$ be the number of ordered triplets $\left(a,b,c\right)$ such that the above quantity is minimized. Compute $m+n$. [i]2016 CCA Math Bonanza Team #8[/i]

Prove that the Polynomial $ f(x) \equal{} x^{4} \plus{} 26x^{3} \plus{} 56x^{2} \plus{} 78x \plus{} 1989$ can't be expressed as a product $ f(x) \equal{} p(x)q(x)$ , where $ p(x)$ and $ q(x)$ are both polynomial with integral coefficients and with degree at least $ 1$.

Let $p = \overline{abcd}$ be a $4$-digit prime number. Prove that the equation $ax^3+bx^2+cx+d=0$ has no rational roots.

$2.$ The equations $x^2-4x+k=0$ and $x^2+kx-4=0,$ where $k$ is a real number, have exactly one common root. What is the value of $k ?$

Given a quadratic trinomial $p(x)$ with integer coefficients such that $p(x)$ is not divisible by $3$ for all integers $x$. Prove that there exist polynomials $f(x)$ and $h(x)$ with integer coefficients such that $$ p(x)\cdot f(x)+3h(x)=x^6+x^4+x^2+1. $$ [i](I. Gorodnin)[/i]

Prove that there exist integers $a, b, c$ all greater than $2011$ such that \[(a+\sqrt{b})^c=\ldots 2010 \cdot 2011\ldots\] [Decimal point separates an integer ending in $2010$ and a decimal part beginning with $2011$.]

Suppose you are given a fair coin and a sheet of paper with the polynomial $x^m$ written on it. Now for each toss of the coin, if heads show up, you must erase the polynomial $x^r$ (where $r$ is going to change with time - initially it is $m$) written on the paper and replace it with $x^{r-1}$. If tails show up, replace it with $x^{r+1}$. What is the expected value of the polynomial I get after $m$ such tosses? (Note: this is a different concept from the most probable value)

Let $n$ be a positive integer. Find the number of odd coefficients of the polynomial $(x^2-x+1)^n$.

Test whether equation $$\frac{1}{x - a} + \frac{1}{x - b} + \frac{1}{x - c} = 0,$$ where $ a $, $ b $, $ c $ denote the given real numbers, has real roots.

Let $r_1$, $r_2$, $\ldots$, $r_{20}$ be the roots of the polynomial $x^{20}-7x^3+1$. If \[\dfrac{1}{r_1^2+1}+\dfrac{1}{r_2^2+1}+\cdots+\dfrac{1}{r_{20}^2+1}\] can be written in the form $\tfrac mn$ where $m$ and $n$ are positive coprime integers, find $m+n$.

Let $ k$ be a positive integer. Prove that there exist polynomials $ P_0(n),P_1(n),\dots,P_{k\minus{}1}(n)$ (which may depend on $ k$) such that for any integer $ n,$ \[ \left\lfloor\frac{n}{k}\right\rfloor^k\equal{}P_0(n)\plus{}P_1(n)\left\lfloor\frac{n}{k}\right\rfloor\plus{} \cdots\plus{}P_{k\minus{}1}(n)\left\lfloor\frac{n}{k}\right\rfloor^{k\minus{}1}.\] ($ \lfloor a\rfloor$ means the largest integer $ \le a.$)

Let \[ f(x_1,x_2,x_3) = -2 \cdot (x_1^3+x_2^3+x_3^3) + 3 \cdot (x_1^2(x_2+x_3) + x_2^2 \cdot (x_1+x_3) + x_3^2 \cdot ( x_1+x_2 ) - 12x_1x_2x_3. \] For any reals $r,s,t$, we denote \[ g(r,s,t)=\max_{t\leq x_3\leq t+2} |f(r,r+2,x_3)+s|. \] Find the minimum value of $g(r,s,t)$.

We say that a set $S$ of integers is [i]rootiful[/i] if, for any positive integer $n$ and any $a_0, a_1, \cdots, a_n \in S$, all integer roots of the polynomial $a_0+a_1x+\cdots+a_nx^n$ are also in $S$. Find all rootiful sets of integers that contain all numbers of the form $2^a - 2^b$ for positive integers $a$ and $b$.

Let $f(x)=x^2+bx+c$, where $b,c \in \mathbb{R}$ and $b>0$ Do there exist disjoint sets $A$ and $B$, whose union is $[0,1]$ and $f(A)=B$, where $f(X)=\{f(x), x \in X\}$ [i]D. Zmiaikou[/i]

Christian Reiher and Reid Barton want to open a security box, they already managed to discover the algorithm to generate the key codes and they obtained the following information: $i)$ In the screen of the box will appear a sequence of $n+1$ numbers, $C_0 = (a_{0,1},a_{0,2},...,a_{0,n+1})$ $ii)$ If the code $K = (k_1,k_2,...,k_n)$ opens the security box then the following must happen: a) A sequence $C_i = (a_{i,1},a_{i,2},...,a_{i,n+1})$ will be asigned to each $k_i$ defined as follows: $a_{i,1} = 1$ and $a_{i,j} = a_{i-1,j}-k_ia_{i,j-1}$, for $i,j \ge 1$ b) The sequence $(C_n)$ asigned to $k_n$ satisfies that $S_n = \sum_{i=1}^{n+1}|a_i|$ has its least possible value, considering all possible sequences $K$. The sequence $C_0$ that appears in the screen is the following: $a_{0,1} = 1$ and $a_0,i$ is the sum of the products of the elements of each of the subsets with $i-1$ elements of the set $A =$ {$1,2,3,...,n$}, $i\ge 2$, such that $a_{0, n+1} = n!$ Find a sequence $K = (k_1,k_2,...,k_n)$ that satisfies the conditions of the problem and show that there exists at least $n!$ of them.

Suppose $a,b$ and $c$ are real numbers that satisfy $a+b+c=5$ and $\tfrac{1}{a}+\tfrac{1}{b}+\tfrac{1}{c}=\tfrac15$. Find the greatest possible value of $a^3+b^3+c^3$.

For a prime $p$, a subset $S$ of residues modulo $p$ is called a [i]sum-free multiplicative subgroup[/i] of $\mathbb F_p$ if $\bullet$ there is a nonzero residue $\alpha$ modulo $p$ such that $S = \left\{ 1, \alpha^1, \alpha^2, \dots \right\}$ (all considered mod $p$), and $\bullet$ there are no $a,b,c \in S$ (not necessarily distinct) such that $a+b \equiv c \pmod p$. Prove that for every integer $N$, there is a prime $p$ and a sum-free multiplicative subgroup $S$ of $\mathbb F_p$ such that $\left\lvert S \right\rvert \ge N$. [i]Proposed by Noga Alon and Jean Bourgain[/i]

Let $S$ be the sum of all integers $b$ for which the polynomial $x^2+bx+2008b$ can be factored over the integers. Compute $|S|$.

Prove that: a polynomial is irreducible in $\mathbb{Z}[x]$ if and only if it is irreducible in $\mathbb{Q}[x].$

The monic polynomial $f$ has rational coefficients and is irreducible over the rational numbers. If $f(\sqrt5 +\sqrt2)= 0$, compute $f(f(\sqrt5 -\sqrt2))$. (A polynomial is [i]monic [/i] if its leading coefficient is $1$. A polynomial is [i]irreducible [/i] over the rational numbers if it cannot be expressed as a product of two polynomials with rational coefficients of positive degree. For example, $x^2 - 2$ is irreducible, but $x^2 - 1 = (x + 1)(x - 1)$ is not.)

For all natural numbers $n$, consider the polynomial $P_n(x) = x^{n+2}-2x+1$. (a) Show that the equation $P_n(x)=0$ has exactly one root $c_n$ in the open interval $(0,1)$. (b) Find $lim_{n \to \infty}c_n$.

Let $P,Q\in\mathbb{R}[x]$, such that $Q$ is a $2021$-degree polynomial and let $a_{1}, a_{2}, \ldots , a_{2022}, b_{1}, b_{2}, \ldots , b_{2022}$ be real numbers such that $a_{1}a_{2}\ldots a_{2022}\neq 0$. If for all real $x$ \[P(a_{1}Q(x) + b_{1}) + \ldots + P(a_{2021}Q(x) + b_{2021}) = P(a_{2022}Q(x) + b_{2022})\] prove that $P(x)$ has a real root.

Let $f(x)=x^2+18$ have roots $r_1$ and $r_2$, and let $g(x)=x^2-8x+17$ have roots $r_3$ and $r_4$. If $h(x)=x^4+ax^3+bx^2+cx+d$ has roots $r_1+r_3$, $r_1+r_4$, $r_2+r_3$, and $r_2+r_4$, then find $h(4)$.

A machine-shop cutting tool has the shape of a notched circle, as shown. The radius of the circle is $\sqrt{50}$ cm, the length of $AB$ is 6 cm, and that of $BC$ is 2 cm. The angle $ABC$ is a right angle. Find the square of the distance (in centimeters) from $B$ to the center of the circle. [asy] size(150); defaultpen(linewidth(0.65)+fontsize(11)); real r=10; pair O=(0,0),A=r*dir(45),B=(A.x,A.y-r),C; path P=circle(O,r); C=intersectionpoint(B--(B.x+r,B.y),P); draw(Arc(O, r, 45, 360-17.0312)); draw(A--B--C);dot(A); dot(B); dot(C); label("$A$",A,NE); label("$B$",B,SW); label("$C$",C,SE); [/asy]