This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 3597

1968 Putnam, A6
Tags: polynomial
Find all polynomials whose coefficients are all $\pm1$ and whose roots are all real.

2013 VJIMC, Problem 3
Tags: number theory , set , polynomial
Let $S$ be a finite set of integers. Prove that there exists a number $c$ depending on $S$ such that for each non-constant polynomial $f$ with integer coefficients the number of integers $k$ satisfying $f(k)\in S$ does not exceed $\max(\deg f,c)$.

2019 PUMaC Algebra A, 3
Tags: algebra , quadratic , polynomial
Let $Q$ be a quadratic polynomial. If the sum of the roots of $Q^{100}(x)$ (where $Q^i(x)$ is defined by $Q^1(x)=Q(x)$, $Q^i(x)=Q(Q^{i-1}(x))$ for integers $i\geq 2$) is $8$ and the sum of the roots of $Q$ is $S$, compute $|\log_2(S)|$.

2021 Purple Comet Problems, 28
Tags: algebra , polynomial
Let $z_1$, $z_2$, $z_3$, $\cdots$, $z_{2021}$ be the roots of the polynomial $z^{2021}+z-1$. Evaluate $$\frac{z_1^3}{z_{1}+1}+\frac{z_2^3}{z_{2}+1}+\frac{z_3^3}{z_{3}+1}+\cdots+\frac{z_{2021}^3}{z_{2021}+1}.$$

2002 China Western Mathematical Olympiad, 3
Tags: geometry , perimeter , polynomial , complex number , algebra
In the complex plane, consider squares having the following property: the complex numbers its vertex correspond to are exactly the roots of integer coefficients equation $ x^4 \plus{} px^3 \plus{} qx^2 \plus{} rx \plus{} s \equal{} 0$. Find the minimum of square areas.

2006 Turkey MO (2nd round), 3
Tags: geometry , trigonometry , circumcircle , function , algebra , polynomial , rational root theorem
Find all the triangles such that its side lenghts, area and its angles' measures (in degrees) are rational.

VMEO III 2006, 11.1
Tags: algebra , polynomial
Given a polynomial $P(x)=x^4+x^3+3x^2-6x+1$. Calculate $P(\alpha^2+\alpha+1)$ where \[ \alpha=\sqrt[3]{\frac{1+\sqrt{5}}{2}}+\sqrt[3]{\frac{1-\sqrt{5}}{2}} \]

2010 Harvard-MIT Mathematics Tournament, 9
Tags: algebra , polynomial
Let $f(x)=cx(x-1)$, where $c$ is a positive real number. We use $f^n(x)$ to denote the polynomial obtained by composing $f$ with itself $n$ times. For every positive integer $n$, all the roots of $f^n(x)$ are real. What is the smallest possible value of $c$?

2017 Indonesia MO, 5
Tags: algebra , polynomial
A polynomial $P$ has integral coefficients, and it has at least 9 different integral roots. Let $n$ be an integer such that $|P(n)| < 2017$. Prove that $P(n) = 0$.

2016 AIME Problems, 6
Tags: algebra , polynomial
For polynomial $P(x)=1-\frac{1}{3}x+\frac{1}{6}x^2$, define \[ Q(x) = P(x)P(x^3)P(x^5)P(x^7)P(x^9) = \sum\limits_{i=0}^{50}a_ix^i. \] Then $\sum\limits_{i=0}^{50}|a_i|=\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

2001 India IMO Training Camp, 1
Tags: algebra , polynomial , complex number , number theory
Complex numbers $\alpha$ , $\beta$ , $\gamma$ have the property that $\alpha^k +\beta^k +\gamma^k$ is an integer for every natural number $k$. Prove that the polynomial \[(x-\alpha)(x-\beta )(x-\gamma )\] has integer coefficients.

2019 SAFEST Olympiad, 3
Tags: algebra , polynomial
Let $m,n\geq 2$ be integers. Let $f(x_1,\dots, x_n)$ be a polynomial with real coefficients such that $$f(x_1,\dots, x_n)=\left\lfloor \frac{x_1+\dots + x_n}{m} \right\rfloor\text{ for every } x_1,\dots, x_n\in \{0,1,\dots, m-1\}.$$ Prove that the total degree of $f$ is at least $n$.

2009 Canadian Mathematical Olympiad Qualification Repechage, 3
Tags: polynomial , algebra
Prove that there does not exist a polynomial $f(x)$ with integer coefficients for which $f(2008) = 0$ and $f(2010) = 1867$.

2014 Iran MO (3rd Round), 6
Tags: polynomial , function , floor function , algebra
$P$ is a monic polynomial of odd degree greater than one such that there exists a function $f : \mathbb{R} \rightarrow \mathbb{N}$ such that for each $x \in \mathbb{R}$ ,\[f(P(x))=P(f(x))\] (a) Prove that there are a finite number of natural numbers in range of $f$. (b) Prove that if $f$ is not constant then the equation $P(x)-x=0$ has at least two real solutions. (c) For each natural $n>1$ prove that there exists a function $f : \mathbb{R} \rightarrow \mathbb{N}$ and a monic polynomial of odd degree greater than one $P$ such that for each $x \in \mathbb{R}$ ,\[f(P(x))=P(f(x))\] and range of $f$ contains exactly $n$ different numbers. Time allowed for this problem was 105 minutes.

2009 Indonesia TST, 1
Tags: algebra , polynomial , search , combinatorics
Let $ n \ge 1$ and $ k \ge 3$ be integers. A circle is divided into $ n$ sectors $ a_1,a_2,\dots,a_n$. We will color the $ n$ sectors with $ k$ different colors such that $ a_i$ and $ a_{i \plus{} 1}$ have different color for each $ i \equal{} 1,2,\dots,n$ where $ a_{n \plus{} 1}\equal{}a_1$. Find the number of ways to do such coloring.

2004 IMC, 2
Tags: algebra , polynomial , induction
Let $f_1(x)=x^2-1$, and for each positive integer $n \geq 2$ define $f_n(x) = f_{n-1}(f_1(x))$. How many distinct real roots does the polynomial $f_{2004}$ have?

1972 Vietnam National Olympiad, 1
Tags: polynomial , trigonometry , functional equation , algebra
Let $\alpha$ be an arbitrary angle and let $x = cos\alpha, y = cosn\alpha$ ($n \in Z$). i) Prove that to each value $x \in [-1, 1]$ corresponds one and only one value of $y$. Thus we can write $y$ as a function of $x, y = T_n(x)$. Compute $T_1(x), T_2(x)$ and prove that $T_{n+1}(x) = 2xT_n(x) - T_{n-1}(x)$. From this it follows that $T_n(x)$ is a polynomial of degree $n$. ii) Prove that the polynomial $T_n(x$) has $n$ distinct roots in $[-1, 1]$.

1998 Brazil Team Selection Test, Problem 4
Tags: algebra , polynomial
(a) Show that, for each positive integer $n$, the number of monic polynomials of degree $n$ with integer coefficients having all its roots on the unit circle is finite. (b) Let $P(x)$ be a monic polynomial with integer coefficients having all its roots on the unit circle. Show that there exists a positive integer $m$ such that $y^m=1$ for each root $y$ of $P(x)$.

2012 Thailand Mathematical Olympiad, 9
Tags: polynomial , inequalities , real root , algebra
Let $n$ be a positive integer and let $P(x) = x^n + a_{n-1}x^{n-1} +... + a_1x + 1$ be a polynomial with positive real coefficients. Under the assumption that the roots of $P$ are all real, show that $P(x) \ge (x + 1)^n$ for all $x > 0$.

2017 Harvard-MIT Mathematics Tournament, 6
Tags: algebra , polynomial , floor function
A polynomial $P$ of degree $2015$ satisfies the equation $P(n)=\frac{1}{n^2}$ for $n=1, 2, \dots, 2016$. Find $\lfloor 2017P(2017)\rfloor$.

2019 AIME Problems, 8
Tags: function , polynomial
The polynomial $f(z)=az^{2018}+bz^{2017}+cz^{2016}$ has real coefficients not exceeding $2019$, and $f(\tfrac{1+\sqrt{3}i}{2})=2015+2019\sqrt{3}i$. Find the remainder when $f(1)$ is divided by $1000$.

I Soros Olympiad 1994-95 (Rus + Ukr), 11.8
Tags: polynomial , algebra , periodic
A polynomial with rational coefficients is called [i]integer[/i], if it takes integer values ​​for all integer values ​​of the variable. For an integer polynomial $P$, consider the sequence $(-1)^{P(1)},(-1)^{P(2)},(-1)^{P(3)},...$ a) Prove that this sequence is periodic, the period of which is some power of two (i.e. for some integer $k$ and for all natural $i$, the $i$-th and ($i+2^k$)th members of the sequence are equal). b) Prove that for any periodic sequence consisting of $(- 1)$ and $ 1$ and with a period of some power of two, there exists a integer, polynomial P for which this sequence is $(-1)^{P(1)},(-1)^{P(2)},(-1)^{P(3)},...$

1959 Polish MO Finals, 4
Tags: algebra , rational , polynomial
Prove that if a quadratic equation $$ ax^2 + bx + c = 0$$ with integer coefficients has a rational root, then at least one of the numbers $ a $, $ b $, $ c $ is even.

1996 IMO Shortlist, 6
Tags: algebra , polynomial , function
Let $ n$ be an even positive integer. Prove that there exists a positive inter $ k$ such that \[ k \equal{} f(x) \cdot (x\plus{}1)^n \plus{} g(x) \cdot (x^n \plus{} 1)\] for some polynomials $ f(x), g(x)$ having integer coefficients. If $ k_0$ denotes the least such $ k,$ determine $ k_0$ as a function of $ n,$ i.e. show that $ k_0 \equal{} 2^q$ where $ q$ is the odd integer determined by $ n \equal{} q \cdot 2^r, r \in \mathbb{N}.$ Note: This is variant A6' of the three variants given for this problem.

1972 Putnam, B4
Tags: polynomial , integer
Show that for $n > 1$ we can find a polynomial $P(a, b, c)$ with integer coefficients such that $$P(x^{n},x^{n+1},x+x^{n+2})=x.$$