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

1994 Vietnam National Olympiad, 3

Do there exist polynomials $p(x), q(x), r(x)$ whose coefficients are positive integers such that $p(x) = (x^{2}-3x+3) q(x)$ and $q(x) = (\frac{x^{2}}{20}-\frac{x}{15}+\frac{1}{12}) r(x)$?

1980 AMC 12/AHSME, 24

For some real number $r$, the polynomial $8x^3-4x^2-42x+45$ is divisible by $(x-r)^2$. Which of the following numbers is closest to $r$? $\text{(A)} \ 1.22 \qquad \text{(B)} \ 1.32 \qquad \text{(C)} \ 1.42 \qquad \text{(D)} \ 1.52 \qquad \text{(E)} \ 1.62$

2019 Latvia Baltic Way TST, 4

Let $P(x)$ be a polynomial with degree $n$ and real coefficients. For all $0 \le y \le 1$ holds $\mid p(y) \mid \le 1$. Prove that $p(-\frac{1}{n}) \le 2^{n+1} -1$

2010 Albania Team Selection Test, 4

With $\sigma (n)$ we denote the sum of natural divisors of the natural number $n$. Prove that, if $n$ is the product of different prime numbers of the form $2^k-1$ for $k \in \mathbb{N}$($Mersenne's$ prime numbers) , than $\sigma (n)=2^m$, for some $m \in \mathbb{N}$. Is the inverse statement true?

2019 ISI Entrance Examination, 7

Let $f$ be a polynomial with integer coefficients. Define $$a_1 = f(0)~,~a_2 = f(a_1) = f(f(0))~,$$ and $~a_n = f(a_{n-1})$ for $n \geqslant 3$. If there exists a natural number $k \geqslant 3$ such that $a_k = 0$, then prove that either $a_1=0$ or $a_2=0$.

2019 Korea Winter Program Practice Test, 3

Find all polynomials $P(x)$ with integer coefficients such that for all positive number $n$ and prime $p$ satisfying $p\nmid nP(n)$, we have $ord_p(n)\ge ord_p(P(n))$.

2007 Tuymaada Olympiad, 2

Two polynomials $ f(x)=a_{100}x^{100}+a_{99}x^{99}+\dots+a_{1}x+a_{0}$ and $ g(x)=b_{100}x^{100}+b_{99}x^{99}+\dots+b_{1}x+b_{0}$ of degree $ 100$ differ from each other by a permutation of coefficients. It is known that $ a_{i}\ne b_{i}$ for $ i=0, 1, 2, \dots, 100$. Is it possible that $ f(x)\geq g(x)$ for all real $ x$?

2003 Moldova National Olympiad, 12.2

For every natural number $n\geq{2}$ consider the following affirmation $P_n$: "Consider a polynomial $P(X)$ (of degree $n$) with real coefficients. If its derivative $P'(X)$ has $n-1$ distinct real roots, then there is a real number $C$ such that the equation $P(x)=C$ has $n$ real,distinct roots." Are $P_4$ and $P_5$ both true? Justify your answer.

2006 Flanders Math Olympiad, 1

(a) Solve for $\theta\in\mathbb{R}$: $\cos(4\theta) = \cos(3\theta)$ (b) $\cos\left(\frac{2\pi}{7}\right)$, $\cos\left(\frac{4\pi}{7}\right)$ and $\cos\left(\frac{6\pi}{7}\right)$ are the roots of an equation of the form $ax^3+bx^2+cx+d = 0$ where $a, b, c, d$ are integers. Determine $a, b, c$ and $d$.

2002 All-Russian Olympiad, 1

The polynomials $P$, $Q$, $R$ with real coefficients, one of which is degree $2$ and two of degree $3$, satisfy the equality $P^2+Q^2=R^2$. Prove that one of the polynomials of degree $3$ has three real roots.

2015 Baltic Way, 3

Let $n>1$ be an integer. Find all non-constant real polynomials $P(x)$ satisfying , for any real $x$ , the identy \[P(x)P(x^2)P(x^3)\cdots P(x^n)=P(x^{\frac{n(n+1)}{2}})\]

2018 CMIMC Individual Finals, 3

Let $a$ be a complex number, and set $\alpha$, $\beta$, and $\gamma$ to be the roots of the polynomial $x^3 - x^2 + ax - 1$. Suppose \[(\alpha^3+1)(\beta^3+1)(\gamma^3+1) = 2018.\] Compute the product of all possible values of $a$.

2002 China Team Selection Test, 1

Let $P_n(x)=a_0 + a_1x + \cdots + a_nx^n$, with $n \geq 2$, be a real-coefficient polynomial. Prove that if there exists $a > 0$ such that \begin{align*} P_n(x) = (x + a)^2 \left( \sum_{i=0}^{n-2} b_i x^i \right), \end{align*} where $b_i$ are positive real numbers, then there exists some $i$, with $1 \leq i \leq n-1$, such that \[a_i^2 - 4a_{i-1}a_{i+1} \leq 0.\]

2005 MOP Homework, 2

Determine if there exist four polynomials such that the sum of any three of them has a real root while the sum of any two of them does not.

1997 China Team Selection Test, 1

Find all real-coefficient polynomials $f(x)$ which satisfy the following conditions: [b]i.[/b] $f(x) = a_0 x^{2n} + a_2 x^{2n - 2} + \cdots + a_{2n - 2} x^2 + a_{2n}, a_0 > 0$; [b]ii.[/b] $\sum_{j=0}^n a_{2j} a_{2n - 2j} \leq \left( \begin{array}{c} 2n\\ n\end{array} \right) a_0 a_{2n}$; [b]iii.[/b] All the roots of $f(x)$ are imaginary numbers with no real part.

2009 All-Russian Olympiad Regional Round, 10.1

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

2003 Iran MO (3rd Round), 23

Find all homogeneous linear recursive sequences such that there is a $ T$ such that $ a_n\equal{}a_{n\plus{}T}$ for each $ n$.

2016 Indonesia TST, 2

Let $a,b$ be two positive integers, such that $ab\neq 1$. Find all the integer values that $f(a,b)$ can take, where \[ f(a,b) = \frac { a^2+ab+b^2} { ab- 1} . \]

2009 Croatia Team Selection Test, 1

Determine the lowest positive integer n such that following statement is true: If polynomial with integer coefficients gets value 2 for n different integers, then it can't take value 4 for any integer.

2014 Putnam, 4

Show that for each positive integer $n,$ all the roots of the polynomial \[\sum_{k=0}^n 2^{k(n-k)}x^k\] are real numbers.

2014 BMT Spring, 4

The function $f(x)=x^5-20x^4+ax^3+bx^2+cx+24$ has the interesting property that its roots can be arranged to form an arithmetic sequence. Determine $f(8)$.

2011 QEDMO 10th, 5

A polynomial $f (x)$ with real coefficients is called [i]completely reducible[/i] if it is a product of at least two non-constant polynomials whose coefficientsare all nonnegative real numbers. Show: If $f (x^{2011})$ is completely reducible, then $f(x)$ is also.

2012 NIMO Problems, 6

The polynomial $P(x) = x^3 + \sqrt{6} x^2 - \sqrt{2} x - \sqrt{3}$ has three distinct real roots. Compute the sum of all $0 \le \theta < 360$ such that $P(\tan \theta^\circ) = 0$. [i]Proposed by Lewis Chen[/i]

1985 IMO, 3

For any polynomial $P(x)=a_0+a_1x+\ldots+a_kx^k$ with integer coefficients, the number of odd coefficients is denoted by $o(P)$. For $i-0,1,2,\ldots$ let $Q_i(x)=(1+x)^i$. Prove that if $i_1,i_2,\ldots,i_n$ are integers satisfying $0\le i_1<i_2<\ldots<i_n$, then: \[ o(Q_{i_1}+Q_{i_2}+\ldots+Q_{i_n})\ge o(Q_{i_1}). \]

1967 Putnam, A3

Consider polynomial functions $ax^2 -bx +c$ with integer coefficients which have two distinct zeros in the open interval $(0,1).$ Exhibit with proof the least positive integer value of $a$ for which such a polynomial exists.