Found problems: 4275
Let $f(x)=x^{2021}+15x^{2020}+8x+9$ have roots $a_i$ where $i=1,2,\cdots , 2021$. Let $p(x)$ be a polynomial of the sam degree such that $p \left(a_i + \frac{1}{a_i}+1 \right)=0$ for every $1\leq i \leq 2021$. If $\frac{3p(0)}{4p(1)}=\frac{m}{n}$ where $m,n \in \mathbb{Z}$, $n>0$ and $\gcd(m,n)=1$. Then find $m+n$.
[b]9.[/b] Find all pairs of linear polynomials $f(x)$, $g(x)$ with integer coefficients for which there exist two polynomials $u(x)$, $v(x)$ with integer coefficients such that $f(x)u(x)+g(x)v(x)=1$. [b](A. 8)[/b]
How many pairs of $2007$-digit numbers $\underline{a_1a_2}\cdots\underline{a_{2007}}$ and $\underline{b_1b_2}\cdots\underline{b_{2007}}$ are there such that $a_1b_1+a_2b_2+\cdots+a_{2007}b_{2007}$ is even? Express your answer as $a \** b^c + d \** e^f$ for integers $a$, $b$, $c$, $d$, $e$, and $f$ with $a \nmid b$ and $d \nmid e$.
Let $a$ and $b$ be real numbers such that $a \ne 0$. Prove that not all the roots of $ax^4 + bx^3 + x^2 + x + 1 = 0$ can be real.
Let $n \geq 3$ be a positive integer. A [i]chipped $n$-board[/i] is a $2 \times n$ checkerboard with the bottom left square removed. Lino wants to tile a chipped $n$-board and is allowed to use the following types of tiles:
[list]
[*] Type 1: any $1 \times k$ board where $1 \leq k \leq n$
[*] Type 2: any chipped $k$-board where $1 \leq k \leq n$ that must cover the left-most tile of the $2 \times n$ checkerboard.
[/list]
Two tilings $T_1$ and $T_2$ are considered the same if there is a set of consecutive Type 1 tiles in both rows of $T_1$ that can be vertically swapped to obtain the tiling $T_2$. For example, the following three tilings of a chipped $7$-board are the same:
[img]http://i.imgur.com/8QaSgc0.png[/img]
For any positive integer $n$ and any positive integer $1 \leq m \leq 2n - 1$, let $c_{m,n}$ be the number of distinct tilings of a chipped $n$-board using exactly $m$ tiles (any combination of tile types may be used), and define the polynomial $$P_n(x) = \sum^{2n-1}_{m=1} c_{m,n}x^m.$$
Find, with justification, polynomials $f(x)$ and $g(x)$ such that $$P_n(x) = f(x)P_{n-1}(x) + g(x)P_{n-2}(x)$$ for all $n \geq 3$.
A polynomial $A(x)$ is said to be [i]simple[/i] if $A(x)$ is divisible by $x$ but not divisible by $x^2$. Suppose that a polynomial $P(x)$ has a simple polynomial $Q(x)$ such that $P(Q(x))-Q(2x)$ is divisible by $x^2$. Prove that there exists a simple polynomial $R(x)$ such that
$P(R(x))-R(2x)$ is divisible by $x^{2023}$.
Prove that the polynomial $x^n+4$ can be expressed as a product of two polynomials (each with degree less than $n$) with integer coefficients, if and only if $n$ is divisible by $4$.
Find all polynomials $f(x)$ with integer coefficients such that $f(n)$ and $f(2^{n})$ are co-prime for all natural numbers $n$.
Let $P(x) = a_{1998}X^{1998} + a_{1997}X^{1997} +...+a_1X + a_0$ be a polynomial with real coefficients such that $P(0) \ne P (-1)$, and let $a, b$ be real numbers. Let $Q(x) = b_{1998}X^{1998} + b_{1997}X^{1997} +...+b_1X + b_0$ be the polynomial with real coefficients obtained by taking $b_k = aa_k + b$ ,$\forall k = 0, 1,2,..., 1998$. Show that if $Q(0) = Q (-1) \ne 0$ , then the polynomial $Q$ has no real roots.
Let $ a>0$, and let $ P(x)$ be a polynomial with integer coefficients such that
\[ P(1)\equal{}P(3)\equal{}P(5)\equal{}P(7)\equal{}a\text{, and}\]
\[ P(2)\equal{}P(4)\equal{}P(6)\equal{}P(8)\equal{}\minus{}a\text{.}\]
What is the smallest possible value of $ a$?
$ \textbf{(A)}\ 105 \qquad \textbf{(B)}\ 315 \qquad \textbf{(C)}\ 945 \qquad \textbf{(D)}\ 7! \qquad \textbf{(E)}\ 8!$
a) Prove that if $x,y>0$ then
\[ \frac x{y^2} + \frac y{x^2} \geq \frac 1x + \frac 1y. \]
b) Prove that if $a,b,c$ are positive real numbers, then
\[ \frac {a+b}{c^2} + \frac {b+c}{a^2} + \frac {c+a}{b^2} \geq 2 \left( \frac 1a + \frac 1b + \frac 1c \right). \]
a) Find an integer $a$ for which $(x - a)(x - 10) + 1$ factors in the product $(x + b)(x + c)$ with integers $b$ and $c$.
b) Find nonzero and nonequal integers $a, b, c$ so that $x(x - a)(x - b)(x - c) + 1$ factors into the product of two polynomials with integer coefficients.
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.
Let $n$ be a positive integer. Find the number of all polynomials $P$ with coefficients from the set $\{0,1,2,3\}$ and for which $P(2)=n$.
Let n be a positive integer. Find all complex numbers $x_{1}$, $x_{2}$, ..., $x_{n}$ satisfying the following system of equations:
$x_{1}+2x_{2}+...+nx_{n}=0$,
$x_{1}^{2}+2x_{2}^{2}+...+nx_{n}^{2}=0$,
...
$x_{1}^{n}+2x_{2}^{n}+...+nx_{n}^{n}=0$.
Let \[ f(x_1,x_2,x_3) = -2 \cdot (x_1^3+x_2^3+x_3^3) + 3 \cdot (x_1^2(x_2+x_3) + x_2^2 \cdot (x_1+x_3) + x_3^2 \cdot ( x_1+x_2 ) - 12x_1x_2x_3. \] For any reals $r,s,t$, we denote \[ g(r,s,t)=\max_{t\leq x_3\leq t+2} |f(r,r+2,x_3)+s|. \] Find the minimum value of $g(r,s,t)$.
Find all positive integers $n$ with $n \ge 2$ such that the polynomial \[ P(a_1, a_2, ..., a_n) = a_1^n+a_2^n + ... + a_n^n - n a_1 a_2 ... a_n \] in the $n$ variables $a_1$, $a_2$, $\dots$, $a_n$ is irreducible over the real numbers, i.e. it cannot be factored as the product of two nonconstant polynomials with real coefficients.
[i]Proposed by Yang Liu[/i]
Consider the second degree polynomial $x^2+ax+b$ with real coefficients. We know that the necessary and sufficient condition for this polynomial to have roots in real numbers is that its discriminant, $a^2-4b$ be greater than or equal to zero. Note that the discriminant is also a polynomial with variables $a$ and $b$. Prove that the same story is not true for polynomials of degree $4$: Prove that there does not exist a $4$ variable polynomial $P(a,b,c,d)$ such that:
The fourth degree polynomial $x^4+ax^3+bx^2+cx+d$ can be written as the product of four $1$st degree polynomials if and only if $P(a,b,c,d)\ge 0$. (All the coefficients are real numbers.)
[i]Proposed by Sahand Seifnashri[/i]
On Christmas Eve, 1983, Dean Jixon, the famous seer who had made startling predictions of the events of the preceding year that the volcanic and seismic activities of $1980$ and $1981$ were connected with mathematics. The diminishing of this geological activity depended upon the existence of an elementary proof of the irreducibility of the polynomial \[P(x)=x^{1981}+x^{1980}+12x^{2}+24x+1983.\] Is there such a proof?
For each positive integer $n>1$, if $n=p_1^{\alpha_1}p_2^{\alpha_2}\cdots p_k^{\alpha_k}$($p_i$ are pairwise different prime numbers and $\alpha_i$ are positive integers), define $f(n)$ as $\alpha_1+\alpha_2+\cdots+\alpha_k$. For $n=1$, let $f(1)=0$. Find all pairs of integer polynomials $P(x)$ and $Q(x)$ such that for any positive integer $m$, $f(P(m))=Q(f(m))$ holds.
Let $ABC$ be an equilateral triangle and $M$ be a point inside the triangle. We denote by $A'$, $B'$, $C'$ the projections of the point $M$ on the sides $BC$, $CA$ and $AB$ respectively. Prove that the lines $AA'$, $BB'$ and $CC'$ are concurrent if and only if $M$ belongs to an altitude of the triangle.
Prove that for every nonnegative integer $n$, the number $7^{7^{n}}+1$ is the product of at least $2n+3$ (not necessarily distinct) primes.
For a given positive integer $n$ and prime number $p$, find the minimum value of positive integer $m$ that satisfies the following property: for any polynomial $$f(x)=(x+a_1)(x+a_2)\ldots(x+a_n)$$ ($a_1,a_2,\ldots,a_n$ are positive integers), and for any non-negative integer $k$, there exists a non-negative integer $k'$ such that $$v_p(f(k))<v_p(f(k'))\leq v_p(f(k))+m.$$ Note: for non-zero integer $N$,$v_p(N)$ is the largest non-zero integer $t$ that satisfies $p^t\mid N$.
Let $f(x)=x^n + a_{n-1}x^{n-1} + ...+ a_0 $ be a polynomial of degree $ n\ge 1 $ with $ n$ (not necessarily distinct) integer roots. Assume that there exist distinct primes $p_0,p_1,..,p_{n-1}$ such that $a_i > 1$ is a power of $p_i$, for all $ i=0,1,..,n-1$. Find all possible values of $ n$.
For a non-negative integer $n$, call a one-variable polynomial $F$ with integer coefficients $n$-[i]good [/i] if:
(a) $F(0) = 1$
(b) For every positive integer $c$, $F(c) > 0$, and
(c) There exist exactly $n$ values of $c$ such that $F(c)$ is prime.
Show that there exist infinitely many non-constant polynomials that are not $n$-good for any $n$.