Olympiad problems

2023 Canadian Mathematical Olympiad Qualification, 7

(a) Let $u$, $v$, and $w$ be the real solutions to the equation $x^3 - 7x + 7 = 0$. Show that there exists a quadratic polynomial $f$ with rational coefficients such that $u = f(v)$, $v = f(w)$, and $w = f(u)$. (b) Let $u$, $v$, and $w$ be the real solutions to the equation $x^3 -7x+4 = 0$. Show that there does not exist a quadratic polynomial $f $with rational coefficients such that $u = f(v)$, $v = f(w)$, and $w = f(u)$.

2017 China Team Selection Test, 4

Tags: algebra , polynomial

Show that there exists a degree $58$ monic polynomial $$P(x) = x^{58} + a_1x^{57} + \cdots + a_{58}$$ such that $P(x)$ has exactly $29$ positive real roots and $29$ negative real roots and that $\log_{2017} |a_i|$ is a positive integer for all $1 \leq i \leq 58$.

2004 Polish MO Finals, 2

Tags: algebra , polynomial , search , number theory

Let $ P$ be a polynomial with integer coefficients such that there are two distinct integers at which $ P$ takes coprime values. Show that there exists an inﬁnite set of integers, such that the values $ P$ takes at them are pairwise coprime.

1967 IMO Shortlist, 3

Tags: algebra , polynomial , summation , equation , diophantine equation

Suppose that $p$ and $q$ are two different positive integers and $x$ is a real number. Form the product $(x+p)(x+q).$ Find the sum $S(x,n) = \sum (x+p)(x+q),$ where $p$ and $q$ take values from 1 to $n.$ Does there exist integer values of $x$ for which $S(x,n) = 0.$

2009 China Team Selection Test, 2

Tags: polynomial , modular arithmetic , prime number , number theory , algebra

Find all integers $ n\ge 2$ having the following property: for any $ k$ integers $ a_{1},a_{2},\cdots,a_{k}$ which aren't congruent to each other (modulo $ n$), there exists an integer polynomial $ f(x)$ such that congruence equation $ f(x)\equiv 0 (mod n)$ exactly has $ k$ roots $ x\equiv a_{1},a_{2},\cdots,a_{k} (mod n).$

2007 CentroAmerican, 3

Tags: quadratic , polynomial , algebra

Let $S$ be a finite set of integers. Suppose that for every two different elements of $S$, $p$ and $q$, there exist not necessarily distinct integers $a \neq 0$, $b$, $c$ belonging to $S$, such that $p$ and $q$ are the roots of the polynomial $ax^{2}+bx+c$. Determine the maximum number of elements that $S$ can have.

2020 AMC 12/AHSME, 17

Tags: algebra , polynomial

How many polynomials of the form $x^5 + ax^4 + bx^3 + cx^2 + dx + 2020$, where $a$, $b$, $c$, and $d$ are real numbers, have the property that whenever $r$ is a root, so is $\frac{-1+i\sqrt{3}}{2} \cdot r$? (Note that $i=\sqrt{-1}$) $\textbf{(A) } 0 \qquad \textbf{(B) }1 \qquad \textbf{(C) } 2 \qquad \textbf{(D) } 3 \qquad \textbf{(E) } 4$

2016 Balkan MO Shortlist, N4

Tags: polynomial , number theory

Find all monic polynomials $f$ with integer coefficients satisfying the following condition: there exists a positive integer $N$ such that $p$ divides $2(f(p)!)+1$ for every prime $p>N$ for which $f(p)$ is a positive integer. [i]Note: A monic polynomial has a leading coefficient equal to 1.[/i] [i](Greece - Panagiotis Lolas and Silouanos Brazitikos)[/i]

2007 IMC, 6

Tags: algebra , polynomial , integration

How many nonzero coefficients can a polynomial $ P(x)$ have if its coefficients are integers and $ |P(z)| \le 2$ for any complex number $ z$ of unit length?

2008 Hong kong National Olympiad, 2

Tags: function , euler , algebra , polynomial , vieta , quadratic , number theory

Let $ n>4$ be a positive integer such that $ n$ is composite (not a prime) and divides $ \varphi (n) \sigma (n) \plus{}1$, where $ \varphi (n)$ is the Euler's totient function of $ n$ and $ \sigma (n)$ is the sum of the positive divisors of $ n$. Prove that $ n$ has at least three distinct prime factors.

2013 ELMO Shortlist, 3

Tags: algebra , polynomial , functional equation

Find all $f:\mathbb{R}\to\mathbb{R}$ such that for all $x,y\in\mathbb{R}$, $f(x)+f(y) = f(x+y)$ and $f(x^{2013}) = f(x)^{2013}$. [i]Proposed by Calvin Deng[/i]

2009 Harvard-MIT Mathematics Tournament, 4

Tags: number theory , least common multiple , greatest common divisor , algebra , polynomial , quadratic

Suppose $a$, $b$ and $c$ are integers such that the greatest common divisor of $x^2+ax+b$ and $x^2+bx+c$ is $x+1$ (in the set of polynomials in $x$ with integer coefficients), and the least common multiple of $x^2+ax+b$ and $x^2+bx+c$ $x^3-4x^2+x+6$. Find $a+b+c$.

1986 AIME Problems, 11

Tags: algebra , polynomial , ratio , binomial theorem

The polynomial $1-x+x^2-x^3+\cdots+x^{16}-x^{17}$ may be written in the form $a_0+a_1y+a_2y^2+\cdots +a_{16}y^{16}+a_{17}y^{17}$, where $y=x+1$ and thet $a_i$'s are constants. Find the value of $a_2$.

2004 USA Team Selection Test, 1

Tags: inequalities , quadratic , algebra , polynomial , trigonometry , geometry , parallelogram

Suppose $a_1, a_2, \ldots, a_n$ and $b_1, b_2, \ldots, b_n$ are real numbers such that \[ (a_1 ^ 2 + a_2 ^ 2 + \cdots + a_n ^ 2 -1)(b_1 ^ 2 + b_2 ^ 2 + \cdots + b_n ^ 2 - 1) > (a_1 b_1 + a_2 b_2 + \cdots + a_n b_n - 1)^2. \] Prove that $a_1 ^ 2 + a_2 ^ 2 + \cdots + a_n ^ 2 > 1$ and $b_1 ^ 2 + b_2 ^ 2 + \cdots + b_n ^ 2 > 1$.

2009 All-Russian Olympiad Regional Round, 11.1

Tags: algebra , polynomial

Square trinomial $f(x)$ is such that the polynomial (f(x))^5 - f(x) has exactly three real roots. Find the ordinate of the vertex of the graph of this trinomial.

1991 Arnold's Trivium, 9

Tags: algebra , polynomial

Does every positive polynomial in two real variables attain its lower bound in the plane?

V Soros Olympiad 1998 - 99 (Russia), 11.7

Tags: algebra , polynomial

For what is the smallest natural number $n$ there is a polynomial $P(x)$ with integer coefficients, having $m$ different integer roots, and at the same time the equation $P(x) = n$ has at least one integer solution if: a) $m = 5$, b) $ m = 6$?

2003 Purple Comet Problems, 13

Tags: algebra , polynomial , function , quadratic

Let $P(x)$ be a polynomial such that, when divided by $x - 2$, the remainder is $3$ and, when divided by $x - 3$, the remainder is $2$. If, when divided by $(x - 2)(x - 3)$, the remainder is $ax + b$, find $a^2 + b^2$.

2025 Belarusian National Olympiad, 10.2

Tags: algebra , polynomial

Let $n$ be a positive integer and $P(x)$ be a polynomial with integer coefficients such that $P(1)=1,P(2)=2,\ldots,P(n)=n$. Prove that $P(0)$ is divisible by $2 \cdot 3 \cdot \ldots \cdot n$. [i]A. Voidelevich[/i]

2012 Turkey MO (2nd round), 1

Tags: algebra , polynomial , number theory

Find all polynomials with integer coefficients such that for all positive integers $n$ satisfies $P(n!)=|P(n)|!$

2005 Czech-Polish-Slovak Match, 1

Tags: polynomial , calculus , derivative , function , analytic geometry , graphing lines , algebra

Let $n$ be a given positive integer. Solve the system \[x_1 + x_2^2 + x_3^3 + \cdots + x_n^n = n,\] \[x_1 + 2x_2 + 3x_3 + \cdots + nx_n = \frac{n(n+1)}{2}\] in the set of nonnegative real numbers.

2007 Belarusian National Olympiad, 6

Tags: algebra , polynomial , product of roots

Let $a$ be the sum and $b$ the product of the real roots of the equation $x^4-x^3-1=0$ Prove that $b < -\frac{11}{10}$ and $a > \frac{6}{11}$.

2003 China Team Selection Test, 3

Tags: polynomial , inequalities , algebra

The $ n$ roots of a complex coefficient polynomial $ f(z) \equal{} z^n \plus{} a_1z^{n \minus{} 1} \plus{} \cdots \plus{} a_{n \minus{} 1}z \plus{} a_n$ are $ z_1, z_2, \cdots, z_n$. If $ \sum_{k \equal{} 1}^n |a_k|^2 \leq 1$, then prove that $ \sum_{k \equal{} 1}^n |z_k|^2 \leq n$.

1979 AMC 12/AHSME, 25

Tags: algebra , polynomial

If $q_1 ( x )$ and $r_ 1$ are the quotient and remainder, respectively, when the polynomial $x^ 8$ is divided by $x + \tfrac{1}{2}$ , and if $q_ 2 ( x )$ and $r_2$ are the quotient and remainder, respectively, when $q_ 1 ( x )$ is divided by $x + \tfrac{1}{2}$, then $r_2$ equals $\textbf{(A) }\frac{1}{256}\qquad\textbf{(B) }-\frac{1}{16}\qquad\textbf{(C) }1\qquad\textbf{(D) }-16\qquad\textbf{(E) }256$

2012 France Team Selection Test, 2

Tags: polynomial , algebra

Determine all non-constant polynomials $X^n+a_{n-1}X^{n-1}+\cdots +a_1X+a_0$ with integer coefficients for which the roots are exactly the numbers $a_0,a_1,\ldots ,a_{n-1}$ (with multiplicity).