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

2023 AMC 10, 12

Tags: polynomial
When the roots of the polynomial \[P(x)=\prod_{i=1}^{10}(x-i)^{i}\] are removed from the real number line, what remains is the union of $11$ disjoint open intervals. On how many of those intervals is $P(x)$ positive? $\textbf{(A)}~3\qquad\textbf{(B)}~4\qquad\textbf{(C)}~5\qquad\textbf{(D)}~6\qquad\textbf{(E)}~7$

2015 Latvia Baltic Way TST, 3

Prove that there does not exist a polynomial $P (x)$ with integer coefficients and a natural number $m$ such that $$x^m + x + 2 = P(P(x))$$ holds for all integers $x$.

2003 Iran MO (3rd Round), 5

Let $p$ be an odd prime number. Let $S$ be the sum of all primitive roots modulo $p$. Show that if $p-1$ isn't squarefree (i. e., if there exist integers $k$ and $m$ with $k>1$ and $p-1=k^2m$), then $S \equiv 0 \mod p$. If not, then what is $S$ congruent to $\mod p$ ?

2017 Iran Team Selection Test, 5

Let $\left \{ c_i \right \}_{i=0}^{\infty}$ be a sequence of non-negative real numbers with $c_{2017}>0$. A sequence of polynomials is defined as $$P_{-1}(x)=0 \ , \ P_0(x)=1 \ , \ P_{n+1}(x)=xP_n(x)+c_nP_{n-1}(x).$$ Prove that there doesn't exist any integer $n>2017$ and some real number $c$ such that $$P_{2n}(x)=P_n(x^2+c).$$ [i]Proposed by Navid Safaei[/i]

1975 Bulgaria National Olympiad, Problem 3

Let $f(x)=a_0x^3+a_1x^2+a_2x+a_3$ be a polynomial with real coefficients ($a_0\ne0$) such that $|f(x)|\le1$ for every $x\in[-1,1]$. Prove that (a) there exist a constant $c$ (one and the same for all polynomials with the given property), for which (b) $|a_0|\le4$. [i]V. Petkov[/i]

2008 Bulgaria Team Selection Test, 3

Let $G$ be a directed graph with infinitely many vertices. It is known that for each vertex the outdegree is greater than the indegree. Let $O$ be a fixed vertex of $G$. For an arbitrary positive number $n$, let $V_{n}$ be the number of vertices which can be reached from $O$ passing through at most $n$ edges ( $O$ counts). Find the smallest possible value of $V_{n}$.

2002 Italy TST, 3

Prove that for any positive integer $ m$ there exist an infinite number of pairs of integers $(x,y)$ such that $(\text{i})$ $x$ and $y$ are relatively prime; $(\text{ii})$ $x$ divides $y^2+m;$ $(\text{iii})$ $y$ divides $x^2+m.$

2018 Germany Team Selection Test, 1

Let $a_1,a_2,\ldots a_n,k$, and $M$ be positive integers such that $$\frac{1}{a_1}+\frac{1}{a_2}+\cdots+\frac{1}{a_n}=k\quad\text{and}\quad a_1a_2\cdots a_n=M.$$ If $M>1$, prove that the polynomial $$P(x)=M(x+1)^k-(x+a_1)(x+a_2)\cdots (x+a_n)$$ has no positive roots.

2013 Romania Team Selection Test, 3

Given an integer $n\geq 2$, determine all non-constant polynomials $f$ with complex coefficients satisfying the condition \[1+f(X^n+1)=f(X)^n.\]

2021 APMO, 2

For a polynomial $P$ and a positive integer $n$, define $P_n$ as the number of positive integer pairs $(a,b)$ such that $a<b \leq n$ and $|P(a)|-|P(b)|$ is divisible by $n$. Determine all polynomial $P$ with integer coefficients such that $P_n \leq 2021$ for all positive integers $n$.

1993 Austrian-Polish Competition, 8

Determine all real polynomials $P(z)$ for which there exists a unique real polynomial $Q(x)$ satisfying the conditions $Q(0)= 0$, $x + Q(y + P(x))= y + Q(x + P(y))$ for all $x,y \in R$.

2009 National Olympiad First Round, 7

The product of uncommon real roots of the two polynomials $ x^4 \plus{} 2x^3 \minus{} 8x^2 \minus{} 6x \plus{} 15$ and $ x^3 \plus{} 4x^2 \minus{} x \minus{} 10$ is ? $\textbf{(A)}\ \minus{} 4 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ \minus{} 6 \qquad\textbf{(D)}\ 6 \qquad\textbf{(E)}\ \text{None}$

1996 Canada National Olympiad, 1

If $\alpha$, $\beta$, and $\gamma$ are the roots of $x^3 - x - 1 = 0$, compute $\frac{1+\alpha}{1-\alpha} + \frac{1+\beta}{1-\beta} + \frac{1+\gamma}{1-\gamma}$.

2023 Princeton University Math Competition, A1 / B3

Let p>3 be a prime and k>0 an integer. Find the multiplicity of X-1 in the factorization of $ f(X)= X^{p^k-1}+X^{p^k-2}+\cdots+X+1$ modulo p; in other words, find the unique non-negative integer r such that $ (X - 1)^r $ divides f(X) \modulo p, but$ (X - 1)^{r+1} $does not divide f(X) \modulo p.

2018 Turkey Team Selection Test, 1

Prove that, for all integers $a, b$, there exists a positive integer $n$, such that the number $n^2+an+b$ has at least $2018$ different prime divisors.

2022 Thailand Mathematical Olympiad, 4

Find all positive integers $n$ such that there exists a monic polynomial $P(x)$ of degree $n$ with integers coefficients satisfying $$P(a)P(b)\neq P(c)$$ for all integers $a,b,c$.

2007 Brazil National Olympiad, 1

Let $ f(x) \equal{} x^2 \plus{} 2007x \plus{} 1$. Prove that for every positive integer $ n$, the equation $ \underbrace{f(f(\ldots(f}_{n\ {\rm times}}(x))\ldots)) \equal{} 0$ has at least one real solution.

2023 Moldova Team Selection Test, 4

Polynomials $(P_n(X))_{n\in\mathbb{N}}$ are defined as: $$P_0(X)=0, \quad P_1(X)=X+2,$$ $$P_n(X)=P_{n-1}(X)+3P_{n-1}(X)\cdot P_{n-2}(X)+P_{n-2}(X), \quad (\forall) n\geq2.$$ Show that if $ k $ divides $m$ then $P_k(X)$ divides $P_m(X).$

1989 IMO Shortlist, 4

Prove that $ \forall n > 1, n \in \mathbb{N}$ the equation \[ \sum^n_{k\equal{}1} \frac{x^k}{k!} \plus{} 1 \equal{} 0\] has no rational roots.

2020 Thailand TST, 4

Let $n$ be a positive integer and let $P$ be the set of monic polynomials of degree $n$ with complex coefficients. Find the value of \[ \min_{p \in P} \left \{ \max_{|z| = 1} |p(z)| \right \} \]

1969 IMO Longlists, 28

$(GBR 5)$ Let us define $u_0 = 0, u_1 = 1$ and for $n\ge 0, u_{n+2} = au_{n+1}+bu_n, a$ and $b$ being positive integers. Express $u_n$ as a polynomial in $a$ and $b.$ Prove the result. Given that $b$ is prime, prove that $b$ divides $a(u_b -1).$

2010 Contests, 2

Find all polynomials $p(x)$ with real coeffcients such that \[p(a + b - 2c) + p(b + c - 2a) + p(c + a - 2b) = 3p(a - b) + 3p(b - c) + 3p(c - a)\] for all $a, b, c\in\mathbb{R}$. [i](2nd Benelux Mathematical Olympiad 2010, Problem 2)[/i]

2017 CMIMC Individual Finals, 3

Say an integer polynomial is $\textit{primitive}$ if the greatest common divisor of its coefficients is $1$. For example, $2x^2+3x+6$ is primitive because $\gcd(2,3,6)=1$. Let $f(x)=a_2x^2+a_1x+a_0$ and $g(x) = b_2x^2+b_1x+b_0$, with $a_i,b_i\in\{1,2,3,4,5\}$ for $i=0,1,2$. If $N$ is the number of pairs of polynomials $(f(x),g(x))$ such that $h(x) = f(x)g(x)$ is primitive, find the last three digits of $N$.

2010 China Team Selection Test, 2

Given positive integer $n$, find the largest real number $\lambda=\lambda(n)$, such that for any degree $n$ polynomial with complex coefficients $f(x)=a_n x^n+a_{n-1} x^{n-1}+\cdots+a_0$, and any permutation $x_0,x_1,\cdots,x_n$ of $0,1,\cdots,n$, the following inequality holds $\sum_{k=0}^n|f(x_k)-f(x_{k+1})|\geq \lambda |a_n|$, where $x_{n+1}=x_0$.

1993 Hungary-Israel Binational, 2

Determine all polynomials $f (x)$ with real coeffcients that satisfy \[f (x^{2}-2x) = f^{2}(x-2)\] for all $x.$