The remainder $R$ obtained by dividing $x^{100}$ by $x^2-3x+2$ is a polynomial of degree less than $2$. Then $R$ may be written as: $\textbf{(A) }2^{100}-1\qquad \textbf{(B) }2^{100}(x-1)-(x-2)\qquad \textbf{(C) }2^{100}(x-3)\qquad$ $\textbf{(D) }x(2^{100}-1)+2(2^{99}-1)\qquad \textbf{(E) }2^{100}(x+1)-(x+2)$

Is there an integer coefficients polynomial $P(x)$ satisfying \[ \begin{cases} P(1+\sqrt[3]{2})=1+\sqrt[3]{2}\\ P(1+\sqrt{5})=2+3\sqrt{5}\end{cases} \]

Find all positive integers $n$ with $n \ge 2$ such that the polynomial \[ P(a_1, a_2, ..., a_n) = a_1^n+a_2^n + ... + a_n^n - n a_1 a_2 ... a_n \] in the $n$ variables $a_1$, $a_2$, $\dots$, $a_n$ is irreducible over the real numbers, i.e. it cannot be factored as the product of two nonconstant polynomials with real coefficients. [i]Proposed by Yang Liu[/i]

Find the least positive integer $n$ such that $\cos\frac{\pi}{n}$ cannot be written in the form $p+\sqrt{q}+\sqrt[3]{r}$ with $p,q,r\in\mathbb{Q}$. [i]O. Mushkarov, N. Nikolov[/i] [hide]No-one in the competition scored more than 2 points[/hide]

Let $Q$ be a quadriatic polynomial having two different real zeros. Prove that there is a non-constant monic polynomial $P$ such that all coefficients of the polynomial $Q(P(x))$ except the leading one are (by absolute value) less than $0.001$.

We say that $1\leq a\leq101$ is a quadratic polynomial residue modulo $101$ with respect to a quadratic polynomial $f(x)$ with integer coefficients if there exists an integer $b$ such that $101 \mid a-f(b)$. For a quadratic polynomial $f$, we define its quadratic residue set as the set of quadratic residues modulo $101$ with respect to $f(x)$. Compute the number of quadratic residue sets. [i]Proposed by Michael Ren[/i]

Let $ P(z) \equal{} z^3 \plus{} az^2 \plus{} bz \plus{} c$, where $ a$, $ b$, and $ c$ are real. There exists a complex number $ w$ such that the three roots of $ P(z)$ are $ w \plus{} 3i$, $ w \plus{} 9i$, and $ 2w \minus{} 4$, where $ i^2 \equal{} \minus{} 1$. Find $ |a \plus{} b \plus{} c|$.

For each positive integer $n$, define $f(n)$ to be the least positive integer for which the following holds: For any partition of $\{1,2,\dots, n\}$ into $k>1$ disjoint subsets $A_1, \dots, A_k$, [u]all of the same size[/u], let $P_i(x)=\prod_{a\in A_i}(x-a)$. Then there exist $i\neq j$ for which \[\deg(P_i(x)-P_j(x))\geq \frac{n}{k}-f(n)\] a) Prove that there is a constant $c$ so that $f(n)\le c\cdot \sqrt{n}$ for all $n$. b) Prove that for infinitely many $n$, one has $f(n)\ge \ln(n)$.

A magician intends to perform the following trick. She announces a positive integer $n$, along with $2n$ real numbers $x_1 < \dots < x_{2n}$, to the audience. A member of the audience then secretly chooses a polynomial $P(x)$ of degree $n$ with real coefficients, computes the $2n$ values $P(x_1), \dots , P(x_{2n})$, and writes down these $2n$ values on the blackboard in non-decreasing order. After that the magician announces the secret polynomial to the audience. Can the magician find a strategy to perform such a trick?

Determine the range of $w(w + x)(w + y)(w + z)$, where $x, y, z$, and $w$ are real numbers such that \[x + y + z + w = x^7 + y^7 + z^7 + w^7 = 0.\]

A real number sequence $a_1, \cdots ,a_{2021}$ satisfies the below conditions. $$a_1=1, a_2=2, a_{n+2}=\frac{2a_{n+1}^2}{a_n+a_{n+1}} (1\leq n \leq 2019)$$ Let the minimum of $a_1, \cdots ,a_{2021}$ be $m$, and the maximum of $a_1, \cdots ,a_{2021}$ be $M$. Let a 2021 degree polynomial $$P(x):=(x-a_1)(x-a_2) \cdots (x-a_{2021})$$ $|P(x)|$ is maximum in $[m, M]$ when $x=\alpha$. Show that $1<\alpha <2$.

Let $f(n)=\sum_{k=0}^{n-1}x^ky^{n-1-k}$ with, $x$, $y$ real numbers. If $f(n)$, $f(n+1)$, $f(n+2)$, $f(n+3)$, are integers for some $n$, prove $f(n)$ is integer for all $n$.

Let $ P(x)$ be a polynomial with degree 2008 and leading coefficient 1 such that \[ P(0) \equal{} 2007, P(1) \equal{} 2006, P(2) \equal{} 2005, \dots, P(2007) \equal{} 0. \]Determine the value of $ P(2008)$. You may use factorials in your answer.

Find all pairs of integers $(m,n)$ such that $m^6 = n^{n+1} + n -1$.

Suppose the polynomial $P(x) \equiv x^3 + ax^2 + bx +c$ has only real zeroes and let $Q(x) \equiv 5x^2 - 16x + 2004$. Assume that $P(Q(x)) = 0$ has no real roots. Prove that $P(2004) > 2004$

For each real number $k$, denote by $f(k)$ the larger of the two roots of the quadratic equation $$(k^2+1)x^2+10kx-6(9k^2+1)=0.$$Show that the function $f(k)$ attains a minimum and maximum and evaluate these two values.

Find the value of $ k\ (0<k<5)$ such that $ \int_0^{\infty} \frac{x^k}{2\plus{}4x\plus{}3x^2\plus{}5x^3\plus{}3x^4\plus{}4x^5\plus{}2x^6}\ dx$ is minimal.

For certain real numbers $a$, $b$, and $c$, the polynomial \[g(x) = x^3 + ax^2 + x + 10\] has three distinct roots, and each root of $g(x)$ is also a root of the polynomial \[f(x) = x^4 + x^3 + bx^2 + 100x + c.\] What is $f(1)$? $\textbf{(A)}\ -9009 \qquad\textbf{(B)}\ -8008 \qquad\textbf{(C)}\ -7007 \qquad\textbf{(D)}\ -6006 \qquad\textbf{(E)}\ -5005$

[b]Randy:[/b] "Hi Rachel, that's an interesting quadratic equation you have written down. What are its roots?'' [b]Rachel:[/b] "The roots are two positive integers. One of the roots is my age, and the other root is the age of my younger brother, Jimmy.'' [b]Randy:[/b] "That is very neat! Let me see if I can figure out how old you and Jimmy are. That shouldn't be too difficult since all of your coefficients are integers. By the way, I notice that the sum of the three coefficients is a prime number.'' [b]Rachel:[/b] "Interesting. Now figure out how old I am.'' [b]Randy:[/b] "Instead, I will guess your age and substitute it for $x$ in your quadratic equation $\dots$ darn, that gives me $-55$, and not $0$.'' [b]Rachel:[/b] "Oh, leave me alone!'' (1) Prove that Jimmy is two years old. (2) Determine Rachel's age.

For each $n \ge 2$ define the polynomial $$f_n(x)=x^n-x^{n-1}-\dots-x-1.$$ Prove that (a) For each $n \ge 2$, $f_n(x)=0$ has a unique positive real root $\alpha_n$; (b) $(\alpha_n)_n$ is a strictly increasing sequence; (c) $\lim_{n \rightarrow \infty} \alpha_n=2.$

Find all polynomials $P$ with integer coefficients such that $$s(x)=s(y) \implies s(|P(x)|)=s(|P(y)|).$$ for all $x,y\in \mathbb{N}$. Note: $s(x)$ denotes the sum of digits of $x$. [i]Proposed by Şevket Onur YILMAZ[/i]

Let $a,b,c$ be 3 integers, $b$ odd, and define the sequence $\{x_n\}_{n\geq 0}$ by $x_0=4$, $x_1=0$, $x_2=2c$, $x_3=3b$ and for all positive integers $n$ we have \[ x_{n+3} = ax_{n-1}+bx_n + cx_{n+1} . \] Prove that for all positive integers $m$, and for all primes $p$ the number $x_{p^m}$ is divisible by $p$.

Find all real numbers $p$ for which the equation $x^3+3px^2+(4p-1)x+p=0$ has two real roots with difference $1$.

Let $ p(x)\equal{}a_0 \plus{}a_1 x\plus{}...\plus{}a_n x^n$ be a polynomial with nonnegative real coefficients. Suppose that $ p(4)\equal{}2$ and $ p(16)\equal{}8$. Prove that $ p(8) \le 4$ and find all such $ p$ with $ p(8)\equal{}4$.

Suppose that for polynomials \( P, Q, R \) with positive integer coefficients, the following two conditions hold: \(\bullet\) The constant terms of \( P, Q, R \) are equal. \(\bullet\) For all real numbers \( x \), the following relations hold: \[ P(Q(R(x))) = Q(R(P(x))) = R(P(Q(x))) = P(R(Q(x))) = Q(P(R(x))) = R(Q(P(x))). \] Prove that for every real number \( x \), \( P(x) = Q(x) = R(x) \). Proposed by Soroush Behroozifar & Ali Nazarboland