Found problems: 3597
Let $f(x)$ be a polynomial, such that $f(x)=x^{2015}+a_1 x^{2014}+...+a_{2014} x+a_{2015}$. Velly and Polly are taking turns, starting from Velly changing the coefficients $a_i$ with real numbers , where each coefficient is changed exactly once. After 2015 turns they calculate the number of real roots of the created polynomial and if the root is only one, then Velly wins, and if it’s not – Polly wins. Which one has a winning strategy?
If $x$, $y$ are positive reals such that $x + y = 2$ show that $x^3y^3(x^3+ y^3) \leq 2$.
Let $a,b,c,d >0$ and $abcd=1$. Prove that:
\[ \frac{1}{(1+a)^2}+\frac{1}{(1+b)^2}+\frac{1}{(1+c)^2}+\frac{1}{(1+d)^2} \geq 1 \]
Find one real value of $x$ satisfying $\frac{x^7}{7}=1+\sqrt[7]{10}x\left(x^2-\sqrt[7]{10}\right)^2$.
Let $f,g$ be polynomials with complex coefficients such that $\gcd(\deg f,\deg g)=1$. Suppose that there exist polynomials $P(x,y)$ and $Q(x,y)$ with complex coefficients such that $f(x)+g(y)=P(x,y)Q(x,y)$. Show that one of $P$ and $Q$ must be constant.
[i]Victor Wang.[/i]
Let $g(x)=1+2x+3x^2+4x^3+\ldots$. Find the coefficient of $x^{2015}$ of $f(x)=\frac{g(x)}{1-x}$.
$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$
Let $ a\in \mathbb{R} $ and $ f_1(x),f_2(x),\ldots,f_n(x): \mathbb{R} \rightarrow \mathbb{R} $ are the additive functions such that for every $ x\in \mathbb{R} $ we have $ f_1(x)f_2(x) \cdots f_n(x) =ax^n $. Show that there exists $ b\in \mathbb {R} $ and $ i\in {\{1,2,\ldots,n}\} $ such that for every $ x\in \mathbb{R} $ we have $ f_i(x)=bx $.
Denote by $\mathbb{V}$ the real vector space of all real polynomials in one variable, and let $\gamma :\mathbb{V}\to \mathbb{R}$ be a linear map. Suppose that for all $f,g\in \mathbb{V}$ with $\gamma(fg)=0$ we have $\gamma(f)=0$ or $\gamma(g)=0$. Prove that there exist $c,x_0\in \mathbb{R}$ such that
\[ \gamma(f)=cf(x_0)\quad \forall f\in \mathbb{V}\]
Let $P$ be a polynomial satisfying $P(x + 1) + P(x - 1) = x^3$ for all real numbers $x$. Find the value of $P(12)$.
$P\left(x\right)$ is a polynomial of degree at most $6$ such that such that $P\left(1\right)$, $P\left(2\right)$, $P\left(3\right)$, $P\left(4\right)$, $P\left(5\right)$, $P\left(6\right)$, and $P\left(7\right)$ are $1$, $2$, $3$, $4$, $5$, $6$, and $7$ in some order. What is the maximum possible value of $P\left(8\right)$?
[i]2018 CCA Math Bonanza Individual Round #13[/i]
Let $K$ commutative field with $8$ elements. Prove that $(\exists)a\in K$ such that $a^3=a+1$.
[i]Mircea Becheanu[/i]
There are exactly $N$ distinct rational numbers $k$ such that $|k|<200$ and \[5x^2+kx+12=0\] has at least one integer solution for $x$. What is $N$?
$\textbf{(A) }6\qquad
\textbf{(B) }12\qquad
\textbf{(C) }24\qquad
\textbf{(D) }48\qquad
\textbf{(E) }78\qquad$
The equation $z(z+i)(z+3i)=2002i$ has a zero of the form $a+bi$, where $a$ and $b$ are positive real numbers. Find $a$.
$\textbf{(A) }\sqrt{118}\qquad\textbf{(B) }\sqrt{210}\qquad\textbf{(C) }2\sqrt{210}\qquad\textbf{(D) }\sqrt{2002}\qquad\textbf{(E) }100\sqrt2$
Find all positive integers $n$ and sequence of integers $a_0,a_1,\ldots, a_n$ such that the following hold:
1. $a_n\neq 0$;
2. $f(a_{i-1})=a_i$ for all $i=1,\ldots, n$, where $f(x) = a_nx^n+a_{n-1}x^{n-1}+\cdots +a_0$.
[i]
Proposed by usjl[/i]
Find all polynomials $P(x)$ which have the properties:
1) $P(x)$ is not a constant polynomial and is a mononic polynomial.
2) $P(x)$ has all real roots and no duplicate roots.
3) If $P(a)=0$ then $P(a|a|)=0$
[i](nooonui)[/i]
We call the three variable polynomial $P$ cyclic if $P(x,y,z)=P(y,z,x)$. Prove that cyclic three variable polynomials $P_1,P_2,P_3$ and $P_4$ exist such that for each cyclic three variable polynomial $P$, there exists a four variable polynomial $Q$ such that $P(x,y,z)=Q(P_1(x,y,z),P_2(x,y,z),P_3(x,y,z),P_4(x,y,z))$.
[i]Solution by Mostafa Eynollahzade and Erfan Salavati[/i]
Assume that the polynomial $\left(x+1\right)^n-1$ is divisible by some polynomial $P\left(x\right)=x^k+c_{k-1}x^{k-1}+c_{k-2}x^{k-2}+...+c_1x+c_0$, whose degree $k$ is even and whose coefficients $c_{k-1}$, $c_{k-2}$, ..., $c_1$, $c_0$ all are odd integers. Show that $k+1\mid n$.
Find all polynomials $p(x)$ such that $p(x^2) = p(x)^2$ for all $x$. Hence find all polynomials $q(x)$ such that
\[
q\left(x^2 - 2x\right) = q\left(x-2\right)^2
\]
Given the polynomial $P(x)=(x^2-7x+6)^{2n}+13$ where $n$ is a positive integer. Prove that $P(x)$ can't be written as a product of $n+1$ non-constant polynomials with integer coefficients.
Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.
Determine all polynomials P(x) with real coefficients such that
[(x + 1)P(x − 1) − (x − 1)P(x)] is a constant polynomial.
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\]
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?