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

2001 Brazil Team Selection Test, Problem 1
Tags: polynomial , algebra
given that p,q are two polynomials such that each one has at least one root and \[p(1+x+q(x)^2)=q(1+x+p(x)^2)\] then prove that p=q

2017 Korea USCM, 2
Tags: polynomial , linear algebra , algebra
Show that any real coefficient polynomial $f(x,y)$ is a linear combination of polynomials of the form $(x+ay)^k$. ($a$ is a real number and $k$ is a non-negative integer.)

1998 Baltic Way, 8
Tags: polynomial , algebra
Let $P_k(x)=1+x+x^2+\ldots +x^{k-1}$. Show that \[ \sum_{k=1}^n \binom{n}{k} P_k(x)=2^{n-1} P_n \left( \frac{x+1}{2} \right) \] for every real number $x$ and every positive integer $n$.

2014 NIMO Problems, 5
Tags: algebra , polynomial , vieta , search
Let $r$, $s$, $t$ be the roots of the polynomial $x^3+2x^2+x-7$. Then \[ \left(1+\frac{1}{(r+2)^2}\right)\left(1+\frac{1}{(s+2)^2}\right)\left(1+\frac{1}{(t+2)^2}\right)=\frac{m}{n} \] for relatively prime positive integers $m$ and $n$. Compute $100m+n$. [i]Proposed by Justin Stevens[/i]

2012 Iran MO (3rd Round), 3
Tags: polynomial , algebra
Suppose $p$ is a prime number and $a,b,c \in \mathbb Q^+$ are rational numbers; [b]a)[/b] Prove that $\mathbb Q(\sqrt[p]{a}+\sqrt[p]{b})=\mathbb Q(\sqrt[p]{a},\sqrt[p]{b})$. [b]b)[/b] If $\sqrt[p]{b} \in \mathbb Q(\sqrt[p]{a})$, prove that for a nonnegative integer $k$ we have $\sqrt[p]{\frac{b}{a^k}}\in \mathbb Q$. [b]c)[/b] If $\sqrt[p]{a}+\sqrt[p]{b}+\sqrt[p]{c} \in \mathbb Q$, then prove that numbers $\sqrt[p]{a},\sqrt[p]{b}$ and $\sqrt[p]{c}$ are rational.

2009 Stanford Mathematics Tournament, 9
Tags: parabola , calculus , algebra , polynomial , derivative , quadratic , conic
Find the shortest distance between the point $(6,12)$ and the parabola given by the equation $x=\frac{y^2}{2}$

2010 Contests, 4
Tags: polynomial , inequalities , algebra
Let $P(x)=ax^3+bx^2+cx+d$ be a polynomial with real coefficients such that \[\min\{d,b+d\}> \max\{|{c}|,|{a+c}|\}\] Prove that $P(x)$ do not have a real root in $[-1,1]$.

2021 USEMO, 5
Tags: function , algebra , polynomial
Given a polynomial $p(x)$ with real coefficients, we denote by $S(p)$ the sum of the squares of its coefficients. For example $S(20x+ 21)=20^2+21^2=841$. Prove that if $f(x)$, $g(x)$, and $h(x)$ are polynomials with real coefficients satisfying the indentity $f(x) \cdot g(x)=h(x)^ 2$, then $$S(f) \cdot S(g) \ge S(h)^2$$ [i]Proposed by Bhavya Tiwari[/i]

1986 IMO Shortlist, 7
Tags: algebra , polynomial , system of equations , calculus
Let real numbers $x_1, x_2, \cdots , x_n$ satisfy $0 < x_1 < x_2 < \cdots< x_n < 1$ and set $x_0 = 0, x_{n+1} = 1$. Suppose that these numbers satisfy the following system of equations: \[\sum_{j=0, j \neq i}^{n+1} \frac{1}{x_i-x_j}=0 \quad \text{where } i = 1, 2, . . ., n.\] Prove that $x_{n+1-i} = 1- x_i$ for $i = 1, 2, . . . , n.$

1976 AMC 12/AHSME, 19
Tags: algebra , polynomial , algorithm , analytic geometry , graphing lines , slope , modular arithmetic
A polynomial $p(x)$ has remainder three when divided by $x-1$ and remainder five when divided by $x-3$. The remainder when $p(x)$ is divided by $(x-1)(x-3)$ is $\textbf{(A) }x-2\qquad\textbf{(B) }x+2\qquad\textbf{(C) }2\qquad\textbf{(D) }8\qquad \textbf{(E) }15$

2003 AMC 10, 18
Tags: polynomial , algebra
What is the largest integer that is a divisor of \[ (n\plus{}1)(n\plus{}3)(n\plus{}5)(n\plus{}7)(n\plus{}9) \]for all positive even integers $ n$? $ \textbf{(A)}\ 3 \qquad \textbf{(B)}\ 5 \qquad \textbf{(C)}\ 11 \qquad \textbf{(D)}\ 15 \qquad \textbf{(E)}\ 165$

1990 Bulgaria National Olympiad, Problem 3
Tags: function , number theory , polynomial
Let $n=p_1p_2\cdots p_s$, where $p_1,\ldots,p_s$ are distinct odd prime numbers. (a) Prove that the expression $$F_n(x)=\prod\left(x^{\frac n{p_{i_1}\cdots p_{i_k}}}-1\right)^{(-1)^k},$$where the product goes over all subsets $\{p_{i_1},\ldots,p_{i_k}\}$ or $\{p_1,\ldots,p_s\}$ (including itself and the empty set), can be written as a polynomial in $x$ with integer coefficients. (b) Prove that if $p$ is a prime divisor of $F_n(2)$, then either $p\mid n$ or $n\mid p-1$.

2009 USA Team Selection Test, 5
Tags: quadratic , inequalities , polynomial , vieta , number theory , algebra
Find all pairs of positive integers $ (m,n)$ such that $ mn \minus{} 1$ divides $ (n^2 \minus{} n \plus{} 1)^2$. [i]Aaron Pixton.[/i]

KoMaL A Problems 2022/2023, A. 835
Tags: algebra , functional equation , polynomial
Let $f^{(n)}(x)$ denote the $n^{\text{th}}$ iterate of function $f$, i.e $f^{(1)}(x)=f(x)$, $f^{(n+1)}(x)=f(f^{(n)}(x))$. Let $p(n)$ be a given polynomial with integer coefficients, which maps the positive integers into the positive integers. Is it possible that the functional equation $f^{(n)}(n)=p(n)$ has exactly one solution $f$ that maps the positive integers into the positive integers? [i]Submitted by Dávid Matolcsi and Kristóf Szabó, Budapest[/i]

2013 ELMO Shortlist, 2
Tags: algebra , polynomial , 3d geometry , modular arithmetic , number theory , geometry
For what polynomials $P(n)$ with integer coefficients can a positive integer be assigned to every lattice point in $\mathbb{R}^3$ so that for every integer $n \ge 1$, the sum of the $n^3$ integers assigned to any $n \times n \times n$ grid of lattice points is divisible by $P(n)$? [i]Proposed by Andre Arslan[/i]

1976 IMO Shortlist, 12
Tags: algebra , polynomial , additive combinatorics , counting , combinatorics
The polynomial $1976(x+x^2+ \cdots +x^n)$ is decomposed into a sum of polynomials of the form $a_1x + a_2x^2 + \cdots + a_nx^n$, where $a_1, a_2, \ldots , a_n$ are distinct positive integers not greater than $n$. Find all values of $n$ for which such a decomposition is possible.

2018 IMO Shortlist, A6
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$.

2007 Ukraine Team Selection Test, 12
Tags: polynomial , diophantine equation , number theory
Prove that there are infinitely many positive integers $ n$ for which all the prime divisors of $ n^{2}\plus{}n\plus{}1$ are not more then $ \sqrt{n}$. [hide] Stronger one. Prove that there are infinitely many positive integers $ n$ for which all the prime divisors of $ n^{3}\minus{}1$ are not more then $ \sqrt{n}$.[/hide]

2012 Indonesia TST, 1
Tags: number theory , least common multiple , polynomial , algebra
Given a positive integer $n$. (a) If $P$ is a polynomial of degree $n$ where $P(x) \in \mathbb{Z}$ for every $x \in \mathbb{Z}$, prove that for every $a,b \in \mathbb{Z}$ where $P(a) \neq P(b)$, \[\text{lcm}(1, 2, \ldots, n) \ge \left| \dfrac{a-b}{P(a) - P(b)} \right|\] (b) Find one $P$ (for each $n$) such that the equality case above is achieved for some $a,b \in \mathbb{Z}$.

2008 Iran MO (3rd Round), 4
Tags: polynomial , geometry , perimeter , analytic geometry , function , parameterization , algebra
=A subset $ S$ of $ \mathbb R^2$ is called an algebraic set if and only if there is a polynomial $ p(x,y)\in\mathbb R[x,y]$ such that \[ S \equal{} \{(x,y)\in\mathbb R^2|p(x,y) \equal{} 0\} \] Are the following subsets of plane an algebraic sets? 1. A square [img]http://i36.tinypic.com/28uiaep.png[/img] 2. A closed half-circle [img]http://i37.tinypic.com/155m155.png[/img]

2001 Hungary-Israel Binational, 4
Tags: polynomial , trigonometry , function , algebra
Let $P (x) = x^{3}-3x+1.$ Find the polynomial $Q$ whose roots are the fifth powers of the roots of $P$.

1996 Austrian-Polish Competition, 8
Tags: algebra , polynomial , functional equation , functional
Show that there is no polynomial $P(x)$ of degree $998$ with real coefficients which satisfies $P(x^2 + 1) = P(x)^2 - 1$ for all $x$.

2006 Pre-Preparation Course Examination, 4
Tags: algebra , polynomial , geometry
Find a 3rd degree polynomial whose roots are $r_a$, $r_b$ and $r_c$ where $r_a$ is the radius of the outer inscribed circle of $ABC$ with respect to $A$.

1985 IMO Longlists, 82
Tags: algebra , polynomial , diophantine equation
Find all cubic polynomials $x^3 +ax^2 +bx+c$ admitting the rational numbers $a$, $b$ and $c$ as roots.

2011 German National Olympiad, 6
Tags: algebra , polynomial , number theory , sequence , prime
Let $p>2$ be a prime. Define a sequence $(Q_{n}(x))$ of polynomials such that $Q_{0}(x)=1, Q_{1}(x)=x$ and $Q_{n+1}(x) =xQ_{n}(x) + nQ_{n-1}(x)$ for $n\geq 1.$ Prove that $Q_{p}(x)-x^p $ is divisible by $p$ for all integers $x.$