Found problems: 4275
The coefficients $a,b,c$ of a polynomial $f:\mathbb{R}\to\mathbb{R}, f(x)=x^3+ax^2+bx+c$ are mutually distinct integers and different from zero. Furthermore, $f(a)=a^3$ and $f(b)=b^3.$ Determine $a,b$ and $c$.
Find all polynomials $P\in \mathbb C[X]$ such that \[P(X^{2})=P(X)^{2}+2P(X)\]
Say that a positive integer is [i]sweet[/i] if it uses only the digits 0, 1, 2, 4, and 8. For instance, 2014 is sweet. There are sweet integers whose squares are sweet: some examples (not necessarily the smallest) are 1, 2, 11, 12, 20, 100, 202, and 210. There are sweet integers whose cubes are sweet: some examples (not necessarily the smallest) are 1, 2, 10, 20, 200, 202, 281, and 2424. Prove that there exists a sweet positive integer $n$ whose square and cube are both sweet, such that the sum of all the digits of $n$ is 2014.
The polynomials $P(z)$ and $Q(z)$ with complex coefficients have the same set of numbers for their zeros but possibly different multiplicities. The same is true for the polynomials
$$P(z)+1 \;\; \text{and} \;\; Q(z)+1.$$
Prove that $P(z)=Q(z).$
Find all possible values of $a\in \mathbb{R}$ and $n\in \mathbb{N^*}$ such that $f(x)=(x-1)^n+(x-2)^{2n+1}+(1-x^2)^{2n+1}+a$
is divisible by $\phi (x)=x^2-x+1$
Determine the number of ordered quintuples $(a,b,c,d,e)$ of integers with $0\leq a<$ $b<$ $c<$ $d<$ $e\leq 30$ for which there exist polynomials $Q(x)$ and $R(x)$ with integer coefficients such that \[x^a+x^b+x^c+x^d+x^e=Q(x)(x^5+x^4+x^2+x+1)+2R(x).\]
[i]Proposed by Michael Ren[/i]
When $ x^9\minus{}x$ is factored as completely as possible into polynomials and monomials with integral coefficients, the number of factors is:
$ \textbf{(A)}\ \text{more than 5} \qquad
\textbf{(B)}\ 5 \qquad
\textbf{(C)}\ 4 \qquad
\textbf{(D)}\ 3 \qquad
\textbf{(E)}\ 2$
At some integer points a polynomial with integer coefficients take values $1, 2$ and $3$. Prove that there exist not more than one integer at which the polynomial is equal to $5$.
Let $a_1,a_2,\ldots a_n,k$, and $M$ be positive integers such that
$$\frac{1}{a_1}+\frac{1}{a_2}+\cdots+\frac{1}{a_n}=k\quad\text{and}\quad a_1a_2\cdots a_n=M.$$
If $M>1$, prove that the polynomial
$$P(x)=M(x+1)^k-(x+a_1)(x+a_2)\cdots (x+a_n)$$
has no positive roots.
Let $A$ be a set of $2025$ non-negative integers and $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$ be a function with the following two properties:
1) For every two distinct positive integers $x,y$ there exists $a\in A$, such that $x-y$ divides $f(x+a) - f(y+a)$.
2) For every positive integer $N$ there exists a positive integer $t$ such that $f(x) \neq f(y)$ whenever $x,y \in [t, t+N]$ are distinct.
Prove that there are infinitely many primes $p$ such that $p$ divides $f(x)$ for some positive integer $x$.
Let $a$ be a positive real number. Then prove that the polynomial
\[ p(x)=a^3x^3+a^2x^2+ax+a \]
has integer roots if and only if $a=1$ and determine those roots.
For function $ f: \mathbb{R} \to \mathbb{R}$ given that $ f(x^2 +x +3) +2 \cdot f(x^2 - 3x + 5) = 6x^2 - 10x +17$, calculate $ f(2009)$.
Suppose that $p(x),q(x)$ are monic polynomials with nonnegative integer coefficients such that
\[\frac{1}{5x}\ge\frac{1}{q(x)}-\frac{1}{p(x)}\ge\frac{1}{3x^2}\]
for all integers $x\ge2$. Compute the minimum possible value of $p(1)\cdot q(1)$.
Let $f(X)$ be a monic irreducible polynomial over $\mathbb{Z}$; therefore, by Gauss's Lemma, $f$ is also irreducible over $\mathbb{Q}$ (you may assume this). Moreover, assume $f(X) \mid f\left(X^2+n\right)$ where $n$ is an integer such that $n \notin\{-1,0,1\}$. Show that $n^2 \nmid f(0)$.
Let $a,b$ be integers and $p$ be a prime number such that:
(i) $p$ is the greatest common divisor of $a$ and $b$;
(ii) $p^2$ divides $a$.
Prove that the polynomial $x^{n+2}+ax^{n+1}+bx^{n}+a+b$ cannot be decomposed into the product of two polynomials with integer coefficients and degree greater than $1$.
Let $ p\in\mathbb{R}_\plus{}$ and $ k\in\mathbb{R}_\plus{}$. The polynomial $ F(x)\equal{}x^4\plus{}a_3x^3\plus{}a_2x^2\plus{}a_1x\plus{}k^4$ with real coefficients has $ 4$ negative roots. Prove that $ F(p)\geq(p\plus{}k)^4$
Let $x_1, x_2,... , x_{84}$ be the roots of the equation $x^{84} + 7x - 6 = 0$. Compute $\sum_{k=1}^{84} \frac{x_k}{x_k-1}$.
For distinct complex numbers $z_1,z_2,\dots,z_{673}$, the polynomial
\[ (x-z_1)^3(x-z_2)^3 \cdots (x-z_{673})^3 \]
can be expressed as $x^{2019} + 20x^{2018} + 19x^{2017}+g(x)$, where $g(x)$ is a polynomial with complex coefficients and with degree at most $2016$. The value of
\[ \left| \sum_{1 \le j <k \le 673} z_jz_k \right| \]
can be expressed in the form $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
Let $n$ be a positive integer and let $x_1,\ldots,x_n,y_1,\ldots,y_n$ be integers satisfying the following
condition: the numbers $x_1,\ldots,x_n$ are pairwise distinct and for every positive integer $m$ there
exists a polynomial $P_m$ with integer coefficients such that $P_m(x_i) - y_i$, $i=1,\ldots,n$, are all divisible by $m$. Prove that there exists a polynomial $P$ with integer coefficients such that $P(x_i) = y_i$ for all $i=1,\ldots,n$.
Given a positive integer $k$, find all polynomials $P$ of degree $k$ with integer coefficients such that for all positive integers $n$ where all of $P(n)$, $P(2024n)$, $P(2024^2n)$ are nonzero, we have
$$\frac{\gcd(P(2024n), P(2024^2n))}{\gcd(P(n), P(2024n))}=2024^k.$$
[i]Allen Wang[/i]
Find $P(x)\in Z[x]$ st : $P(n)|2557^{n}+213.2014$ with any $n\in N^{*}$
Let $ P $ be a point in the interior of a triangle $ ABC $, and let $ D, E, F $ be the point of intersection of the line $ AP $ and the side $ BC $ of the triangle, of the line $ BP $ and the side $ CA $, and of the line $ CP $ and the side $ AB $, respectively. Prove that the area of the triangle $ ABC $ must be $ 6 $ if the area of each of the triangles $ PFA, PDB $ and $ PEC $ is $ 1 $.
If $ a_2 \neq 0$ and $ r$ and $ s$ are the roots of $ a_0 \plus{} a_1x \plus{} a_2x^2 \equal{} 0$, then the equality $ a_0 \plus{} a_1x \plus{} a_2x^2 \equal{} a_0\left (1 \minus{} \frac {x}{r} \right ) \left (1 \minus{} \frac {x}{s} \right )$ holds:
$ \textbf{(A)}\ \text{for all values of }x, a_0\neq 0$
$ \textbf{(B)}\ \text{for all values of }x$
$ \textbf{(C)}\ \text{only when }x \equal{} 0$
$ \textbf{(D)}\ \text{only when }x \equal{} r \text{ or }x \equal{} s$
$ \textbf{(E)}\ \text{only when }x \equal{} r \text{ or }x \equal{} s, a_0 \neq 0$
Find the smallest positive integer $a$ such that for some integers $b$, $c$ the polynomial $ax^2 - bx + c$ has two distinct zeros in the interval $(0,1)$.
Let $P(x)$ be a polynomial of degree at most $2018$ such that $P(i)=\binom{2018}i$ for all integer $i$ such that $0\le i\le 2018$. Find the largest nonnegative integer $n$ such that $2^n\mid P(2020)$.
[i]Proposed by Michael Ren