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 $p(x) = x^{2013} + a_{2012}x^{2012} + a_{2011}x^{2011} +...+ a_1x + a_0$ be a polynomial with real coefficients with roots $- b_{1006}, - b_{1005}, ... , -b_1, 0, b_1, ... , b_{1005}, b_{1006}$, where $b_1, b_2, ... , b_{1006}$ are positive reals with product $1$. Show that $a_3a_{2011} \le 1012036$
Consider 2 non-constant polynomials $P(x),Q(x)$, with nonnegative coefficients. The coefficients of $P(x)$ is not larger than $2021$ and $Q(x)$ has at least one coefficient larger than $2021$. Assume that $P(2022)=Q(2022)$ and $P(x),Q(x)$ has a root $\frac p q \ne 0 (p,q\in \mathbb Z,(p,q)=1)$. Prove that $|p|+n|q|\le Q(n)-P(n)$ for all $n=1,2,...,2021$
Let $n >1$ be a natural number and $T_{n}(x)=x^n + a_{n-1}x^{n-1} + a_{n-2}x^{n-2} + ... + a_1 x^1 + a_0$.\\ Assume that for each nonzero real number $t $ we have $T_{n}(t+\frac {1}{t})=t^n+\frac {1}{t^n} $.\\ Prove that for each $0\le i \le n-1 $ $gcd (a_i,n) >1$. [i]Proposed by Morteza Saghafian[/i]
A small ship sails on an infinite coordinate sea. At the moment $t$ the ship is at the point with coordinates $(f(t), g(t))$, where $f$ and $g$ are two polynomials of third degree. Yesterday at $14:00$ the ship was at the same point as at $13:00$, and at $20:00$, it was at the same point as at $19:00$. Prove that the ship sails along a straight line.
Let $ r,s,$ and $ t$ be the roots of the cubic polynomial: $ p(x)\equal{}x^3\minus{}2007x\plus{}2002.$ Determine the value of: $ \frac{r\minus{}1}{r\plus{}1}\plus{}\frac{s\minus{}1}{s\plus{}1}\plus{}\frac{t\minus{}1}{t\plus{}1}$.
We define a sequence of numbers $a_n$ such that $a_0=1$ and for all $n\ge0$: \[2a_{n+1} ^3 + 2a_n ^3 = 3 a_{n +1} ^2 a_n + 3a_{n+1}a_n^2\] Find the sum of all $a_{2023}$'s possible values.
Let $ n$ be a given positive integer. Show that we can choose numbers $ c_k\in\{\minus{}1,1\}$ ($ i\le k\le n$) such that \[ 0\le\sum_{k\equal{}1}^nc_k\cdot k^2\le4.\]
Let $P(X)=a_{2n+1}X^{2n+1}+a_{2n}X^{2n}+...+a_1X+a_0$ be a polynomial with all positive coefficients. Prove that there exists a permutation $(b_{2n+1},b_{2n},...,b_1,b_0)$ of numbers $(a_{2n+1},a_{2n},...,a_1,a_0)$ such that the polynomial $Q(X)=b_{2n+1}X^{2n+1}+b_{2n}X^{2n}+...+b_1X+b_0$ has exactly one real root.
The positive numbers $a, b,c, d, p, q$ are such that $(x+a)(x+b)(x+c)(x+d) = x^4+4px^3+6x^2+4qx+1$ holds for all real numbers $x$. Find the smallest value of $p$ or the largest value of $q$.
Let $P, Q \in \mathbb{R}[x]$ be relatively prime nonconstant polynomials. Show that there can be at most three real numbers $\lambda$ such that $P + \lambda Q$ is the square of a polynomial. [i]Alison Miller[/i]
Let $f$ be a polynomial function such that, for all real $x$, \[f(x^2 + 1) = x^4 + 5x^2 + 3.\] For all real $x$, $f(x^2-1)$ is $ \textbf{(A)}\ x^4+5x^2+1\qquad\textbf{(B)}\ x^4+x^2-3\qquad\textbf{(C)}\ x^4-5x^2+1\qquad\textbf{(D)}\ x^4+x^2+3\qquad\textbf{(E)}\ \text{None of these} $
For real numbers $a_0,a_1,\cdots,a_n(a_0\neq a_1)$, we have$a_{i-1}+a_{i+1}=2a_i$ for $i=1,2,\cdots,n-1$. Prove that $P(x)=a_0\text{C}_n^0(1-x)^n+a_1\text{C}_n^1x(1-x)^{n-1}+\cdots+a_n\text{C}_n^nx^n$ is a linear polynomial.
A polynomial $p(x)$ with integer coefficients satisfies the equality $$p(\sqrt{2}+\sqrt{3})=\sqrt{2}-\sqrt{3}$$ a) Find all possible values of $p(\sqrt{2}-\sqrt{3})$ b) Find an example of any polynomial $p(x)$ which satisfies the condition.
We define the polynomial $$P (x) = 2014x^{2013} + 2013x^{2012} +... + 4x^3 + 3x^2 + 2x.$$ Find the largest prime divisor of $P (2)$.
A polynomial $P(x)$ has degree at most $2k$, where $k = 0, 1,2,\cdots$. Given that for an integer $i$, the inequality $-k \le i \le k$ implies $|P(i)| \le 1$, prove that for all real numbers $x$, with $-k \le x \le k$, the following inequality holds: \[|P(x)| < (2k + 1)\dbinom{2k}{k}\]
Let $a,b,c$ be distinct real numbers and $P(x)$ a polynomial with real coefficients. Suppose that the remainders of $P(x)$ upon division by $(x-a), (x-b)$ and $(x-c)$ are $a,b$ and $c$, respectively. Find the polynomial that is obtained as the remainder of $P(x)$ upon division by $(x-a)(x-b)(x-c)$.
Determine all real numbers $q$ for which the equation $x^4 -40x^2 +q = 0$ has four real solutions which form an arithmetic progression
suppose that polynomial $p(x)=x^{2010}\pm x^{2009}\pm...\pm x\pm 1$ does not have a real root. what is the maximum number of coefficients to be $-1$?(14 points)
Let $ f(x)\equal{}a_{2n}x^{2n}\plus{}a_{2n\minus{}1}x^{2n\minus{}1}\plus{}\cdots\plus{}a_1x\plus{}a_0$, with $ a_i\equal{}a_{2n\minus{}1}$ for all $ i\equal{}1,2,\ldots,n$ and $ a_{2n}\ne0$. Prove that there exists a polynomial $ g(x)$ of degree $ n$ such that $ g\left(x\plus{}\frac1x\right)x^n\equal{}f(x)$.
Find, with proof, all triples of real numbers $(a, b, c)$ such that all four roots of the polynomial $f(x) = x^4 +ax^3 +bx^2 +cx+b$ are positive integers. (The four roots need not be distinct.)
Susana and Brenda play a game writing polynomials on the board. Susana starts and they play taking turns. 1) On the preparatory turn (turn 0), Susana choose a positive integer $n_0$ and writes the polynomial $P_0(x)=n_0$. 2) On turn 1, Brenda choose a positive integer $n_1$, different from $n_0$, and either writes the polynomial $$P_1(x)=n_1x+P_0(x) \textup{ or } P_1(x)=n_1x-P_0(x)$$ 3) In general, on turn $k$, the respective player chooses an integer $n_k$, different from $n_0, n_1, \ldots, n_{k-1}$, and either writes the polynomial $$P_k(x)=n_kx^k+P_{k-1}(x) \textup{ or } P_k(x)=n_kx^k-P_{k-1}(x)$$ The first player to write a polynomial with at least one whole whole number root wins. Find and describe a winning strategy.
Let $f(x)$ be a quadratic polynomial such that $f(f(1)) = f(-f(-1)) = 0$ and $f(1) \neq -f(-1)$. Suppose furthermore that the quadratic $2f(x)$ has coefficients that are nonzero integers. Find $f(0)$. [i]Proposed by Andrew Wu[/i]
Find a method by which one can compute the coefficients of $P(x) = x^6 + a_1x^5 + \cdots+ a_6$ from the roots of $P(x) = 0$ by performing not more than $15$ additions and $15$ multiplications.
Prove that if $f(x)$ is a polynomial with integer coefficients and there exists an integer $k$ such that none of $f(1),\ldots,f(k)$ is divisible by $k$, then $f(x)$ has no integral root.
The polynomials $ P(x)$ and $ Q(x)$ are given. It is known that for a certain polynomial $ R(x, y)$ the identity $ P(x) \minus{} P(y) \equal{} R(x, y) (Q(x) \minus{} Q(y))$ applies. Prove that there is a polynomial $ S(x)$ so that $ P(x) \equal{} S(Q(x)) \quad \forall x.$