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

Prove that for any polynomial $P$ with real coefficients, and for any positive integer $n$, there exists a polynomial $Q$ with real coefficients such that $P(x)^2 +Q(x)^2$ is divisible by $(1+x^2)^n$.
Find all two-variable polynomials $p(x,y)$ such that for each $a,b,c\in\mathbb R$: \[p(ab,c^2+1)+p(bc,a^2+1)+p(ca,b^2+1)=0\]
For prime number $p$, prove that there are integers $a$, $b$, $c$, $d$ such that for every integer $n$, the expression $n^4+1-\left( n^2+an+b \right) \left(n^2+cn+d \right)$ is a multiple of $p$.
Prove that for all natural $ m$, $ n$ polynomial $ \sum_{i \equal{} 0}^{m}\binom{n\plus{}i}{n}\cdot x^i$ has at most one real root.
Let $p(x)$ be a polynomial of degree strictly less than $100$ and such that it does not have $(x^3-x)$ as a factor. If $$\frac{d^{100}}{dx^{100}}\bigg(\frac{p(x)}{x^3-x}\bigg)=\frac{f(x)}{g(x)}$$ for some polynomials $f(x)$ and $g(x)$ then find the smallest possible degree of $f(x)$.
A [i]palindrome[/i], such as $ 83438$, is a number that remains the same when its digits are reversed. The numbers $ x$ and $ x \plus{} 32$ are three-digit and four-digit palindromes, respectively. What is the sum of the digits of x? $ \textbf{(A)}\ 20\qquad \textbf{(B)}\ 21\qquad \textbf{(C)}\ 22\qquad \textbf{(D)}\ 23\qquad \textbf{(E)}\ 24$
Decompose the space of homogeneous polynomials of degree $5$ in $(x, y, z)$ into irreducible subspaces invariant with respect to the rotation group $SO(3)$.
find all polynomials with integer coefficients that $P(\mathbb{Z})= ${$p(a):a\in \mathbb{Z}$} has a Geometric progression.
Prove that the equation $$ (x - a) (x - c) + 2 (x - b) (x - d) = 0,$$ in which $ a < b < c < d $, has two real roots.
Let $A$ be the set of all polynomials $f(x)$ of order $3$ with integer coefficients and cubic coefficient $1$, so that for every $f(x)$ there exists a prime number $p$ which does not divide $2004$ and a number $q$ which is coprime to $p$ and $2004$, so that $f(p)=2004$ and $f(q)=0$. Prove that there exists a infinite subset $B\subset A$, so that the function graphs of the members of $B$ are identical except of translations
Show that for any $n \in N$ the polynomial $f(x) = (x^2 +x)^{2^n}+1$ is irreducible over $Z[x]$.
Let $a,b$ be integers with $0<a<b$. A set $\{x,y,z\}$ of non-negative integers is [i]olympic[/i] if $x<y<z$ and if $\{z-y,y-x\}=\{a,b\}$. Show that the set of all non-negative integers is the union of pairwise disjoint olympic sets.
Let $a,b,c,x,y,z$ be six positive real numbers satisfying $x+y+z=a+b+c$ and $xyz=abc.$ Further, suppose that $a\leq x<y<z\leq c$ and $a<b<c.$ Prove that $a=x,b=y$ and $c=z.$
Let $P(x)=x^n+a_1x^{n-1}+\ldots+a_n$ ($n\ge2$) be a polynomial with integer coefficients having $n$ real roots $b_1,\ldots,b_n$. Prove that for $x_0\ge\max\{b_1,\ldots,b_n\}$, $$P(x_0+1)\left(\frac1{x_0-b_1}+\ldots+\frac1{x_0-b_n}\right)\ge2n^2.$$
Find the smallest positive integer $ n$ with the property that the polynomial $ x^4 \minus{} nx \plus{} 63$ can be written as a product of two nonconstant polynomials with integer coefficients.
Suppose $a_1,a_2,a_3,a_4$ are distinct integers and $P(x)$ is a polynomial with integer coefficients satisfying $P(a_1) = P(a_2) = P(a_3) = P(a_4) = 1$. (a) Prove that there is no integer $n$ such that $P(n) = 12$. (b) Do there exist such a polynomial and $a_n$ integer $n$ such that $P(n) = 1998$?
Suppose $a_1,a_2,a_3,b_1,b_2,b_3$ are distinct positive integers such that \[(n \plus{} 1)a_1^n \plus{} na_2^n \plus{} (n \minus{} 1)a_3^n|(n \plus{} 1)b_1^n \plus{} nb_2^n \plus{} (n \minus{} 1)b_3^n\] holds for all positive integers $n$. Prove that there exists $k\in N$ such that $ b_i \equal{} ka_i$ for $ i \equal{} 1,2,3$.
For positive integers $n$, let $C(n)$ be the number of representation of $n$ as a sum of nonincreasing powers of $2$, where no power can be used more than three times. For example, $C(8)=5$ since the representations of $8$ are: $$8,4+4,4+2+2,4+2+1+1,\text{ and }2+2+2+1+1.$$Prove or disprove that there is a polynomial $P(x)$ such that $C(n)=\lfloor P(n)\rfloor$ for all positive integers $n$.
Let $x_0$ - is positive root of $x^{2017}-x-1=0$ and $y_0$ - is positive root of $y^{4034}-y=3x_0$ a) Compare $x_0$ and $y_0$ b) Find tenth digit after decimal mark in decimal representation of $|x_0-y_0|$
The polynomial $x^{2n}+1+(x+1)^{2n}$ is not divisible by $x^2+x+1$ if $n$ equals $\text{(A)} \ 17 \qquad \text{(B)} \ 20 \qquad \text{(C)} \ 21 \qquad \text{(D)} \ 64 \qquad \text{(E)} \ 65$
Let $ (b_0,b_1,b_2,b_3)$ be a permutation of the set $ \{54,72,36,108\}$. Prove that $ x^5\plus{}b_3x^3\plus{}b_2x^2\plus{}b_1x\plus{}b_0$ is irreducible in $ \mathbb Z[x]$.
Prove that there exists a positive integer $N$ such that for every polynomial $P(x)$ of degree $2019$, there exist $N$ linear polynomials $p_1,p_2, \ldots p_N$ such that $P(x)=p_1(x)^{2019}+p_2(x)^{2019}+ \ldots + p_N(x)^{2019}$. (Assume all polynomials in this problem have real coefficients, and leading coefficients cannot be zero.)
Let $P$ be a polynomial of degree $6$ and let $a,b$ be real numbers such that $0<a<b$. Suppose that $P(a)=P(-a),P(b)=P(-b),P'(0)=0$. Prove that $P(x)=P(-x)$ for all real $x$.