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

Let $x$ and $y$ be real numbers satisfying $x^4y^5+y^4x^5=810$ and $x^3y^6+y^3x^6=945$. Evaluate $2x^3+(xy)^3+2y^3$.
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]$.
Determine the polynomial $P\in \mathbb{R}[x]$ for which there exists $n\in \mathbb{Z}_{>0}$ such that for all $x\in \mathbb{Q}$ we have: \[P\left(x+\frac1n\right)+P\left(x-\frac1n\right)=2P(x).\] [i]Dumitru Bușneag[/i]
Let $Q(x)$ be a polynomial with integer coefficients. Prove that there exists a polynomial $P(x)$ with integer coefficients such that for every integer $n\ge\deg{Q}$, \[\sum_{i=0}^{n}\frac{!i P(i)}{i!(n-i)!} = Q(n),\]where $!i$ denotes the number of derangements (permutations with no fixed points) of $1,2,\ldots,i$. [i]Calvin Deng.[/i]
If $a,b,c$ are the roots of $x^3+20x^2+1x+5$, compute $(a^2+1)(b^2+1)(c^2+1)$. [i]2015 CCA Math Bonanza Tiebreaker Round #2[/i]
Consider all polynomials $P(x)$ with real coefficients that have the following property: for any two real numbers $x$ and $y$ one has \[|y^2-P(x)|\le 2|x|\quad\text{if and only if}\quad |x^2-P(y)|\le 2|y|.\] Determine all possible values of $P(0)$. [i]Proposed by Belgium[/i]
The remainder $R$ obtained by dividing $x^{100}$ by $x^2-3x+2$ is a polynomial of degree less than $2$. Then $R$ may be written as: $\textbf{(A) }2^{100}-1\qquad \textbf{(B) }2^{100}(x-1)-(x-2)\qquad \textbf{(C) }2^{100}(x-3)\qquad$ $\textbf{(D) }x(2^{100}-1)+2(2^{99}-1)\qquad \textbf{(E) }2^{100}(x+1)-(x+2)$
Let $f(x)=cx(x-1)$, where $c$ is a positive real number. We use $f^n(x)$ to denote the polynomial obtained by composing $f$ with itself $n$ times. For every positive integer $n$, all the roots of $f^n(x)$ are real. What is the smallest possible value of $c$?
Let $ \mathbb{Z}[x]$ be the ring of polynomials with integer coefficients, and let $ f(x), g(x) \in\mathbb{Z}[x]$ be nonconstant polynomials such that $ g(x)$ divides $ f(x)$ in $ \mathbb{Z}[x]$. Prove that if the polynomial $ f(x)\minus{}2008$ has at least 81 distinct integer roots, then the degree of $ g(x)$ is greater than 5.
Find the sum of all positive integers $B$ such that $(111)_B=(aabbcc)_6$, where $a,b,c$ represent distinct base $6$ digits, $a\neq 0$.
For a fixed integer $k$, determine all polynomials $f(x)$ with integer coefficients such that $f(n)$ divides $(n!)^k$ for every positive integer $n$.
Find the necessary and sufficient conditions that the real numbers $ a $, $ b $, $ c $ should satisfy so that the equation $$x^3 + ax^2 + bx + c = 0$$ has three real roots creating an arithmetic progression.
Consider the polynomials \[f(x) =\sum_{k=1}^{n}a_{k}x^{k}\quad\text{and}\quad g(x) =\sum_{k=1}^{n}\frac{a_{k}}{2^{k}-1}x^{k},\] where $a_{1},a_{2},\ldots,a_{n}$ are real numbers and $n$ is a positive integer. Show that if 1 and $2^{n+1}$ are zeros of $g$ then $f$ has a positive zero less than $2^{n}$.
Prove that $\frac{5^{125}-1}{5^{25}-1}$ is a composite number.
Let $\mathcal{A}$ denote the set of all polynomials in three variables $x, y, z$ with integer coefficients. Let $\mathcal{B}$ denote the subset of $\mathcal{A}$ formed by all polynomials which can be expressed as \begin{align*} (x + y + z)P(x, y, z) + (xy + yz + zx)Q(x, y, z) + xyzR(x, y, z) \end{align*} with $P, Q, R \in \mathcal{A}$. Find the smallest non-negative integer $n$ such that $x^i y^j z^k \in \mathcal{B}$ for all non-negative integers $i, j, k$ satisfying $i + j + k \geq n$.
For all positive real numbers $a, b, c$ satisfying $a+b+c=1$, prove that \[ \frac{a^4+5b^4}{a(a+2b)} + \frac{b^4+5c^4}{b(b+2c)} + \frac{c^4+5a^4}{c(c+2a)} \geq 1- ab-bc-ca \]
Let $ f$ be a polynomial with positive integer coefficients. Prove that if $ n$ is a positive integer, then $ f(n)$ divides $ f(f(n)\plus{}1)$ if and only if $ n\equal{}1.$
In the expression $(x + 100) (x + 99) ... (x-99) (x-100)$, the brackets were expanded and similar terms were given. The expression $x^{201} + ...+ ax^2 + bx + c$ turned out. Find the numbers $a$ and $c$.
Find all polynomials of the form $P(x) = (-1)^nx^n + a_1x^{n-1} + a_2x^{n-2} + ...+ a_{n-1}x + a_n$ with the following two properties: (i) $\{a_1, a_2, . . . , a_n-1, a_n\} =\{0, 1\}$, and (ii) all roots of $P(x)$ are distinct real numbers
Let $m$ and $n$ be positive integers such that $m>n$ and $m \equiv n \pmod{2}$. If $(m^2-n^2+1) \mid n^2-1$, then prove that $m^2-n^2+1$ is a perfect square. (proposed by G. Batzaya, folklore)
Let $P(x)$ be a polynomial with real non-negative coefficients. Let $k$ be a positive integer and $x_1, x_2, \dots, x_k$ positive real numbers such that $x_1x_2\cdots x_k=1$. Prove that $$P(x_1)+P(x_2)+\cdots+P(x_k)\geq kP(1).$$
Find all integers $ n\ge 2$ having the following property: for any $ k$ integers $ a_{1},a_{2},\cdots,a_{k}$ which aren't congruent to each other (modulo $ n$), there exists an integer polynomial $ f(x)$ such that congruence equation $ f(x)\equiv 0 (mod n)$ exactly has $ k$ roots $ x\equiv a_{1},a_{2},\cdots,a_{k} (mod n).$
Find the number of nonzero terms of the polynomial $P(x)$ if $$x^{2018}+x^{2017}+x^{2016}+x^{999}+1=(x^4+x^3+x^2+x+1)P(x).$$
Find all polynomials $P(x)$ with real coefficents, such that for all $x,y,z$ satisfying $x+y+z=0$, the equation below is true: \[P(x+y)^3+P(y+z)^3+P(z+x)^3=3P((x+y)(y+z)(z+x))\]
Let $a,b,c$ be distinct positive real numbers, and let $k$ be a positive integer greater than $3$. Show that \[\left\lvert\frac{a^{k+1}(b-c)+b^{k+1}(c-a)+c^{k+1}(a-b)}{a^k(b-c)+b^k(c-a)+c^k(a-b)}\right\rvert\ge \frac{k+1}{3(k-1)}(a+b+c)\] and \[\left\lvert\frac{a^{k+2}(b-c)+b^{k+2}(c-a)+c^{k+2}(a-b)}{a^k(b-c)+b^k(c-a)+c^k(a-b)}\right\rvert\ge \frac{(k+1)(k+2)}{3k(k-1)}(a^2+b^2+c^2).\] [i]Calvin Deng.[/i]