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)$ be a polynomial of degree $n$ with real coefficients and let $a\geq 3$. Prove that \[\max_{0\leq j \leq n+1}\left | a^j-P(j) \right |\geq 1\]
Determine the set of all real numbers $p$ for which the polynomial $Q(x) = x^3 + px^2 - px - 1$ has three distinct real roots.
Define the polynomials $P_0, P_1, P_2 \cdots$ by: \[ P_0(x)=x^3+213x^2-67x-2000 \] \[ P_n(x)=P_{n-1}(x-n), n \in N \] Find the coefficient of $x$ in $P_{21}(x)$.
Let $p$ be a prime number. Call a positive integer $n$ interesting if \[x^n-1=(x^p-x+1)f(x)+pg(x)\] for some polynomials $f$ and $g$ with integer coefficients. a) Prove that the number $p^p-1$ is interesting. b) For which $p$ is $p^p-1$ the minimal interesting number?
Find all polynomials $P$ with real coefficients such that for all $x, y ,z \in R$, $$P(x)+P(y)+P(z)+P(x+y+z)=P(x+y)+P(y+z)+P(z+x)$$
a) Let $a\in \mathbb{R}$ and $f \colon \mathbb{R} \to \mathbb{R}$ be a continuous function for which there exists an antiderivative $F \colon \mathbb{R} \to \mathbb{R} $, such that $F(x)+a\cdot f(x) \geq 0$, for any $x \in \mathbb{R}$, and$ \lim_{|x| \to \infty} \frac{F(x)}{e^{|\alpha \cdot x|}}=0$ holds for any $\alpha \in \mathbb{R}^*$. Prove that $F(x) \geq 0$ for all $x \in \mathbb{R}$. b) Let $n\geq 2$ be a positive integer, $g \in \mathbb{R}[X]$, $g = X^n + a_1X^{n-1}+ \dots + a_{n-1}X+a_n$ be a polynomial with all of its roots being real, and $f \colon \mathbb{R} \to \mathbb{R}$ a polynomial function such that $f(x)+a_1\cdot f'(x)+a_2\cdot f^{(2)}(x)+\dots+a_n\cdot f^{(n)}(x) \geq 0$ for any $x \in \mathbb{R}$. Prove that $f(x) \geq 0$ for all $x \in \mathbb{R}$.
There are integers $m$ and $n$ so that $9 +\sqrt{11}$ is a root of the polynomial $x^2 + mx + n.$ Find $m + n.$
Let a polynomial $f(x)$ be given with real coefficients and has degree greater or equal than 1. Show that for every real number $c > 0$, there exists a positive integer $n_0$ satisfying the following condition: if polynomial $P(x)$ of degree greater or equal than $n_0$ with real coefficients and has leading coefficient equal to 1 then the number of integers $x$ for which $|f(P(x))| \leq c$ is not greater than degree of $P(x)$.
Let $f$ and $g$ be two nonzero polynomials with integer coefficients and $\deg f>\deg g$. Suppose that for infinitely many primes $p$ the polynomial $pf+g$ has a rational root. Prove that $f$ has a rational root.
Provided that the roots of the polynom $ X^n+a_1X^{n-1} +a_2X^{n-2} +\cdots +a_{n-1}X +a_n:\in\mathbb{R}[X] , $ of degree $ n\ge 2, $ are all real and pairwise distinct, prove that there exists is a neighbourhood $ \mathcal{V} $ of $ \left( a_1,a_2,\ldots ,a_n \right) $ in $ \mathbb{R}^n $ and $ n $ functions $ x_1,x_2,\ldots ,x_n\in\mathcal{C}^{\infty } \left( \mathcal{V} \right) $ whose values at $ \left( a_1,a_2,\ldots ,a_n \right) $ are roots of the mentioned polynom.
Determine the coefficients of the equation $$ x^3 - ax^2 + bx - c = 0$$ in such a way that the roots of this equation are the numbers $ a $, $ b $, $ c $.
$p(x)$ is an irreducible polynomial with integer coefficients, and $q$ is a fixed prime number. Let $a_n$ be a number of solutions of the equation $p(x)\equiv 0\mod q^n$. Prove that we can find $M$ such that $\{a_n\}_{n\ge M}$ is constant.
A polynomial $p(x)$ with real coefficients is said to be [i]almeriense[/i] if it is of the form: $$ p(x) = x^3+ax^2+bx+a $$ And its three roots are positive real numbers in arithmetic progression. Find all [i]almeriense[/i] polynomials such that $p\left(\frac{7}{4}\right) = 0$
Find the largest integer $k$ such that $$k\leq\sqrt{2}+\sqrt[3]{\frac{3}{2}}+\sqrt[4]{\frac{4}{3}}+\sqrt[5]{\frac{5}{4}}+\cdots+\sqrt[2015]{\frac{2015}{2014}}.$$
$P,Q,R$ are non-zero polynomials that for each $z\in\mathbb C$, $P(z)Q(\bar z)=R(z)$. a) If $P,Q,R\in\mathbb R[x]$, prove that $Q$ is constant polynomial. b) Is the above statement correct for $P,Q,R\in\mathbb C[x]$?
While waiting for their food at a restaurant in Harvard Square, Ana and Banana draw $3$ squares $\square_1, \square_2, \square_3$ on one of their napkins. Starting with Ana, they take turns filling in the squares with integers from the set $\{1,2,3,4,5\}$ such that no integer is used more than once. Ana's goal is to minimize the minimum value that the polynomial $a_1x^2 + a_2x + a_3$ attains over all real $x$, where $a_1, a_2, a_3$ are the integers written in $\square_1, \square_2, \square_3$ respectively. Banana aims to maximize $M$. Assuming both play optimally, compute the final value of $100a_1+10a_2+a_3$.
A magician intends to perform the following trick. She announces a positive integer $n$, along with $2n$ real numbers $x_1 < \dots < x_{2n}$, to the audience. A member of the audience then secretly chooses a polynomial $P(x)$ of degree $n$ with real coefficients, computes the $2n$ values $P(x_1), \dots , P(x_{2n})$, and writes down these $2n$ values on the blackboard in non-decreasing order. After that the magician announces the secret polynomial to the audience. Can the magician find a strategy to perform such a trick?
Find all $(m,n)$ in $\mathbb{N}^2$ such that $m\mid n^2+1$ and $n\mid m^2+1$.
We define the polynomial $f(x)$ in $\mathbb R[x]$ as follows: $f(x)=x^n+a_{n-2}x^{n-2}+a_{n-3}x^{n-3}+.....+a_1x+a_0$ Prove that there exists an $i$ in the set $\{1,....,n\}$ such that we have $|f(i)|\ge \frac{n!}{\dbinom{n}{i}}$. [i]proposed by Mohammadmahdi Yazdi[/i]
For each prime $p,$ a polynomial $P(x)$ with rational coefficients is called $p$-[i]good[/i] if and only if there exist three integers $a,b,$ and $c$ such that $0 \le a < b < c < \tfrac{p}{3}$ and $p$ divides all the numerators of $P(a), P(b),$ and $P(c),$ when written in simplest form. Compute the number of ordered pairs $(r,s)$ of rational numbers such that the polynomial $x^3+10x^2+rx+s$ is $p$-good for infinitely many primes $p.$
The sequence of polynomials $ \left\{P_n(x)\right\}_{n\equal{}0}^{\plus{}\infty}$ is defined inductively by $ P_0(x) \equal{} 0$ and $ P_{n\plus{}1}(x) \equal{} P_n(x)\plus{}\frac{x \minus{} P_n^2(x)}{2}$. Prove that for any $ x \in [0, 1]$ and any natural number $ n$ it holds that $ 0\le\sqrt x\minus{} P_n(x)\le\frac{2}{n \plus{} 1}$.
A positive integer $N$ is called [i]balanced[/i], if $N=1$ or if $N$ can be written as a product of an even number of not necessarily distinct primes. Given positive integers $a$ and $b$, consider the polynomial $P$ defined by $P(x)=(x+a)(x+b)$. (a) Prove that there exist distinct positive integers $a$ and $b$ such that all the number $P(1)$, $P(2)$,$\ldots$, $P(50)$ are balanced. (b) Prove that if $P(n)$ is balanced for all positive integers $n$, then $a=b$. [i]Proposed by Jorge Tipe, Peru[/i]
One of the factors of $ x^4\plus{}2x^2\plus{}9$ is: $ \textbf{(A)}\ x^2\plus{}3 \qquad \textbf{(B)}\ x\plus{}1 \qquad \textbf{(C)}\ x^2\minus{}3 \qquad \textbf{(D)}\ x^2\minus{}2x\minus{}3 \qquad \textbf{(E)}\ \text{none of these}$
Consider the second-degree polynomial \(P(x) = 4x^2+12x-3015\). Define the sequence of polynomials \(P_1(x)=\frac{P(x)}{2016}\) and \(P_{n+1}(x)=\frac{P(P_n(x))}{2016}\) for every integer \(n \geq 1\). [list='a'] [*]Show that exists a real number \(r\) such that \(P_n(r) < 0\) for every positive integer \(n\). [*]Find how many integers \(m\) are such that \(P_n(m)<0\) for infinite positive integers \(n\). [/list]
Find the coefficient of $x^2$ after expansion and collecting the terms of the following expression (there are $k$ pairs of parentheses): $$((... (((x - 2)^2 - 2)^2 -2)^2 -... -2)^2 - 2)^2$$