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: 4275

Let $f$ be a polynomial. We say that a complex number $p$ is a double attractor if there exists a polynomial $h(x)$ so that $f(x)-f(p) = h(x)(x-p)^2$ for all x \in R. Now, consider the polynomial $$f(x) = 12x^5 - 15x^4 - 40x^3 + 540x^2 - 2160x + 1,$$ and suppose that it’s double attractors are $a_1, a_2, ... , a_n$. If the sum $\sum^{n}_{i=1}|a_i|$ can be written as $\sqrt{a} +\sqrt{b}$, where $a, b$ are positive integers, find $a + b$.
Find all polynomials $p(x)$ such that $p'(x)^2 = c p(x) p''(x)$ for some constant $c$.
Find all polynomials $P(x)$ and $Q(x)$ with real coefficients such that $$P(Q(x))=P(x)^{2017}$$ for all real numbers $x$.
What is the remainder when $x^{51}+51$ is divided by $x+1$? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 49 \qquad\textbf{(D)}\ 50 \qquad\textbf{(E)}\ 51 $
$f(x)=x^3-6x^2+17x$. If $f(a)=16, f(b)=20$, find $a+b$.
Determine all monic polynomials $ p(x)$ of fifth degree having real coefficients and the following property: Whenever $ a$ is a (real or complex) root of $ p(x)$, then so are $ \frac{1}{a}$ and $ 1\minus{}a$.
Show that the polynomial $x^6 -x^5 +x^4 -x^3 +x^2 -x+\frac34$ has no real zeroes.
Let \(P(x)=x^2+\dfrac x 2 +b\) and \(Q(x)=x^2+cx+d\) be two polynomials with real coefficients such that \(P(x)Q(x)=Q(P(x))\) for all real \(x\). Find all real roots of \(P(Q(x))=0\).
Suppose that the rational numbers $a, b$ and $c$ are the roots of the equation $x^3+ax^2 + bx + c = 0$. Find all such rational numbers $a, b$ and $c$. Justify your answer
Find all integer coefficient polynomial $P(x)$ such that for all positive integer $x$, we have $$\tau(P(x))\geq\tau(x)$$Where $\tau(n)$ denotes the number of divisors of $n$. Define $\tau(0)=\infty$. Note: you can use this conclusion. For all $\epsilon\geq0$, there exists a positive constant $C_\epsilon$ such that for all positive integer $n$, the $n$th smallest prime is at most $C_\epsilon n^{1+\epsilon}$. [i]Proposed by USJL[/i]
A(x,y), B(x,y), and C(x,y) are three homogeneous real-coefficient polynomials of x and y with degree 2, 3, and 4 respectively. we know that there is a real-coefficient polinimial R(x,y) such that $B(x,y)^2-4A(x,y)C(x,y)=-R(x,y)^2$. Proof that there exist 2 polynomials F(x,y,z) and G(x,y,z) such that $F(x,y,z)^2+G(x,y,z)^2=A(x,y)z^2+B(x,y)z+C(x,y)$ if for any x, y, z real numbers $A(x,y)z^2+B(x,y)z+C(x,y)\ge 0$
Do there exist polynomials $f(x)$, $g(x)$ with real coefficients and a positive integer $k$ satisfying the following condition? (Here, the equation $x^2 = 0$ is considered to have $1$ distinct real roots. The equation $0 = 0$ has infinitely many distinct real roots.) For any real numbers $a, b$ with $(a,b) \neq (0,0)$, the number of distinct real roots of $a f(x) + b g(x) = 0$ is $k$.
A polynomial $P(x, y, z)$ in three variables with real coefficients satisfies the identities $$P(x, y, z)=P(x, y, xy-z)=P(x, zx-y, z)=P(yz-x, y, z).$$ Prove that there exists a polynomial $F(t)$ in one variable such that $$P(x,y,z)=F(x^2+y^2+z^2-xyz).$$
Find all couples of polynomials $(P,Q)$ with real coefficients, such that for infinitely many $x\in\mathbb R$ the condition \[ \frac{P(x)}{Q(x)}-\frac{P(x+1)}{Q(x+1)}=\frac{1}{x(x+2)}\] Holds. [i] Nikolai Nikolov, Oleg Mushkarov[/i]
Let $t$ be the area of a regular pentagon with each side equal to $1$. Let $P(x)=0$ be the polynomial equation with least degree, having integer coefficients, satisfied by $x=t$ and the $\gcd$ of all the coefficients equal to $1$. If $M$ is the sum of the absolute values of the coefficients of $P(x)$, What is the integer closest to $\sqrt{M}$ ? ($\sin 18^{\circ}=(\sqrt{5}-1)/2$)
Find all polynomials of degree $3$ with integer coeffcients such that $f(2014) = 2015, f(2015) = 2016$ and $f(2013) - f(2016)$ is a prime number.
Let $n\geqslant 0$ be an integer, and let $a_0,a_1,\dots,a_n$ be real numbers. Show that there exists $k\in\{0,1,\dots,n\}$ such that $$a_0+a_1x+a_2x^2+\cdots+a_nx^n\leqslant a_0+a_1+\cdots+a_k$$ for all real numbers $x\in[0,1]$.
Let $p(x) = x^2 +ax +b$ be a quadratic polynomial with $a,b \in \mathbb{Z}$. Given any integer $n$ , show that there is an integer $M$ such that $p(n) p(n+1) = p(M)$.
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$.
Alice has $n > 1$ one variable quadratic polynomials written on paper she keeps secret from Bob. On each move, Bob announces a real number and Alice tells him the value of one of her polynomials at this number. Prove that there exists a constant $C > 0$ such that after $Cn^5$ questions, Bob can determine one of Alice’s polynomials. [i]Proposed by Rohan Goyal and Anant Mudgal[/i]
Suppose $a$, $b$ and $c$ are integers such that the greatest common divisor of $x^2+ax+b$ and $x^2+bx+c$ is $x+1$ (in the set of polynomials in $x$ with integer coefficients), and the least common multiple of $x^2+ax+b$ and $x^2+bx+c$ $x^3-4x^2+x+6$. Find $a+b+c$.
Let real coefficient polynomial $f(x) = x^n + a_1 \cdot x^{n-1} + \ldots + a_n$ has real roots $b_1, b_2, \ldots, b_n$, $n \geq 2,$ prove that $\forall x \geq max\{b_1, b_2, \ldots, b_n\}$, we have \[f(x+1) \geq \frac{2 \cdot n^2}{\frac{1}{x-b_1} + \frac{1}{x-b_2} + \ldots + \frac{1}{x-b_n}}.\]
Let $P(x)$ be a non-constant polynomial with integer coefficients and let $n$ be a positive integer. The sequence $a_0,a_1,\ldots$ is defined as follows: $a_0=n$ and $a_k=P(a_{k-1})$ for all positive integers $k.$ Assume that for every positive integer $b$ the sequence contains a $b$th power of an integer greater than $1.$ Show that $P(x)$ is linear.
Let $f(x) = x^6 + x^5 + x^4 + x^3 + x^2 + x + 1$. Find the remainder when $f(x^7)$ is divided by $f(x)$.
Find the number of polynomials $f(x)=ax^3+bx$ satisfying both following conditions: (i) $a,b\in\{1,2,\ldots,2013\}$; (ii) the difference between any two of $f(1),f(2),\ldots,f(2013)$ is not a multiple of $2013$.