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

[b]1)[/b] Show that there exist quadratic polynoms $ P\in\mathbb{R}[X] $ whose composition with themselves have $ 1,2 $ and $ 3 $ as their fixed points. [b]2)[/b] Prove that the polynoms referred to at [b]1)[/b] are not integer. [i]Gheorghe Iurea[/i]
Let $ P (x) $ be a polynomial with real coefficients such that $ P (x)> 0 $ for all $ x \geq 0 $. Prove that there is a positive integer $ n $ such that $ (1 + x) ^ n P (x) $ polynomial with nonnegative coefficients.
Given $n > 1$ monic square trinomials $x^2 - a_1x + b_1$,$...$, $x^2-a_nx + b_n$, and all $2n$ numbers are $a_1$,$...$, $a_n$, $b_1$,$...$, $b_n$ are different. Can it happen that each of the numbers $a_1$,$...$, $a_n$, $b_1$,$...$, $b_n is the root of one of these trinomials?
Find all polynomials $p(x)\in\mathbb{R}[x]$ such that for all $x\in \mathbb{R}$: $p(5x)^2-3=p(5x^2+1)$ such that: $a) p(0)\neq 0$ $b) p(0)=0$
Find the values of $p$ for which the equation $x^5 - px-1 = 0$ has two roots $r$ and $s$ which are the roots of equation $x^2-ax+b= 0$ for some integers $a,b$.
Let us assume that each of the equations $x^7 + x^2 + 1= 0$ and $x^5- x^4 + x^2- x + 1.001 = 0$ has a single root. Which of these roots is larger?
Prove the following statement: If a polynomial $f(x)$ with real coefficients takes only nonnegative values, then there exists a positive integer $n$ and polynomials $g_1(x), g_2(x),\cdots, g_n(x)$ such that \[f(x) = g_1(x)^2 + g_2(x)^2 +\cdots+ g_n(x)^2\]
Let $a$ and $b$ be complex non-zero numbers and $z_1,z_2$ the roots of the polynomials $X^2+aX+b$. Show that $|z_1+z_2|=|z_1|+|z_2|$ if and only if there exists a real number $\lambda\ge 4$ such that $a^2=\lambda b$.
$P(x)$ is a fifth degree polynomial. $P(2018)=1$, $P(2019)=2$ $P(2020)=3$, $P(2021)=4$, $P(2022)=5$. $P(2017)=?$
Let $P(x) = x^3 - px^2 + qx - r$ be a cubic polynomial with integer roots $a, b, c$. [b](a)[/b] Show that the greatest common divisor of $p, q, r$ is equal to $1$ if the greatest common divisor of $a, b, c$ is equal to $1$. [b](b)[/b] What are the roots of polynomial $Q(x) = x^3-98x^2+98sx-98t$ with $s, t$ positive integers.
Find all integers $k$ such that all roots of the following polynomial are also integers: $$f(x)=x^3-(k-3)x^2-11x+(4k-8).$$
For every positive $ \alpha$, natural number $ n$, and at most $ \alpha n$ points $ x_i$, construct a trigonometric polynomial $ P(x)$ of degree at most $ n$ for which \[ P(x_i) \leq 1, \; \int_0^{2 \pi} P(x)dx=0,\ \; \textrm{and}\ \; \max P(x) > cn\ ,\] where the constant $ c$ depends only on $ \alpha$. [i]G. Halasz[/i]
Let $ f_1,f_2,f_3,f_4 $ be four polynomials with real coefficients, having the property that $$ f_1 (1) =f_2 (0), \quad f_2 (1) =f_3 (0),\quad f_3 (1) =f_4 (0),\quad f_4 (1) =f_1 (0) . $$ Prove that there exists a polynomial $ f\in\mathbb{R}[X,Y] $ such that $$ f(X,0)=f_1(X),\quad f(1,Y) =f_2(Y) ,\quad f(1-X,1) =f_3(X),\quad f(0,1-Y)=f_4(Y) . $$
If $a, b, c$ are positive integers such that \[0 < a^{2}+b^{2}-abc \le c,\] show that $a^{2}+b^{2}-abc$ is a perfect square.
Determine the set of all polynomials $P(x)$ with real coefficients such that the set $\{P(n) | n \in \mathbb{Z}\}$ contains all integers, except possibly finitely many of them.
For each $n \ge 2$ define the polynomial $$f_n(x)=x^n-x^{n-1}-\dots-x-1.$$ Prove that (a) For each $n \ge 2$, $f_n(x)=0$ has a unique positive real root $\alpha_n$; (b) $(\alpha_n)_n$ is a strictly increasing sequence; (c) $\lim_{n \rightarrow \infty} \alpha_n=2.$
Find all the triples of integers $ (a, b,c)$ such that: \[ \begin{array}{ccc}a\plus{}b\plus{}c &\equal{}& 24\\ a^{2}\plus{}b^{2}\plus{}c^{2}&\equal{}& 210\\ abc &\equal{}& 440\end{array}\]
Let $P$ be a polynomial with integer coefficients of degree $d$. For the set $A = \{ a_1, a_2, ..., a_k\}$ of positive integers we denote $S (A) = P (a_1) + P (a_2) + ... + P (a_k )$. The natural numbers $m, n$ are such that $m ^{d+ 1} | n$. Prove that the set $\{1, 2, ..., n\}$ can be subdivided into $m$ disjoint subsets $A_1, A_2, ..., A_m$ with the same number of elements such that $S (A_1) = S(A_2) = ... = S (A_m )$.
Let $P(x), Q(x)$ and $R(x)$ be polynomials satisfying the equation $2xP(x^3) + Q(-x -x^3) = (1 + x + x^2)R(x)$. Show that $x - 1$ divides $P(x) - Q(x)$.
The polynomial $$ Q(x_1,x_2,\ldots,x_4)=4(x_1^2+x_2^2+x_3^2+x_4^2)-(x_1+x_2+x_3+x_4)^2 $$ is represented as the sum of squares of four polynomials of four variables with integer coefficients. [b]a)[/b] Find at least one such representation [b]b)[/b] Prove that for any such representation at least one of the four polynomials isidentically zero. [i](A. Yuran)[/i]
Find the smallest odd integer $ k$ such that: for every $ 3\minus{}$degree polynomials $ f$ with integer coefficients, if there exist $ k$ integer $ n$ such that $ |f(n)|$ is a prime number, then $ f$ is irreducible in $ \mathbb{Z}[n]$.
Given a polynomial with integer coefficients, which has at least one integer root. The greatest common divisor of all its integer roots equals $1$. Prove that if the leading coefficient of the polynomial equals $1$ then the greatest common divisor of the other coefficients also equals $1$.
Let $P(x)$ be the unique polynomial of degree four for which $P(165) = 20$, and \[ P(42) = P(69) = P(96) = P(123) = 13. \] Compute $P(1) - P(2) + P(3) - P(4) + \dots + P(165)$. [i]Proposed by Evan Chen[/i]
The polynomial $P(x)$ is cubic. What is the largest value of $k$ for which the polynomials $Q_{1}(x) = x^{2}+(k-29)x-k$ and $Q_{2}(x) = 2x^{2}+(2k-43)x+k$ are both factors of $P(x)$?
How many pairs of positive integers $(a,b)$ are there such that the roots of polynomial $x^2-ax-b$ are not greater than $5$? $ \textbf{(A)}\ 40 \qquad\textbf{(B)}\ 50 \qquad\textbf{(C)}\ 65 \qquad\textbf{(D)}\ 75 \qquad\textbf{(E)}\ \text{None of the preceding} $