Found problems: 4275
$P(x)$ is a nonzero polynomial with integer coefficients. Prove that there exists infinitely many prime numbers $q$ such that for some natural number $n$, $q|2^n+P(n)$.
[i]Proposed by Mohammad Gharakhani[/i]
$n>1$ and distinct positive integers $a_1,a_2,\ldots,a_{n+1}$ are given. Does there exist a polynomial $p(x)\in\Bbb{Z}[x]$ of degree $\le n$ that satisfies the following conditions?
a. $\forall_{1\le i < j\le n+1}: \gcd(p(a_i),p(a_j))>1 $
b. $\forall_{1\le i < j < k\le n+1}: \gcd(p(a_i),p(a_j),p(a_k))=1 $
[i]Proposed by Mojtaba Zare[/i]
Given two real numbers $a, b$ with $a \neq 0$, find all polynomials $P(x)$ which satisfy
\[xP(x - a) = (x - b)P(x).\]
Determine all positive integers $n$ for which there exists a polynomial $p(x)$ of degree $n$ with integer coefficients such that it takes the value $n$ in $n$ distinct integer points and takes the value $0$ at point $0$.
Find the magnitude of the product of all complex numbers $c$ such that the recurrence defined by $x_1 = 1$, $x_2 = c^2 - 4c + 7$, and $x_{n+1} = (c^2 - 2c)^2 x_n x_{n-1} + 2x_n - x_{n-1}$ also satisfies $x_{1006} = 2011$.
[i]Author: Alex Zhu[/i]
Let be the polynomial $ f=X^4+X^2\in\mathbb{Z}_2[X] $ Find:
a) its degree..
b) the splitting field of $ f $
c) the Galois group of $ f $ (Galois group of its splitting field)
Let $f(x),g(x)$ be two polynomials with integer coefficients. It is known that for infinitely many prime $p$, there exist integer $m_p$ such that
$$f(a) \equiv g(a+m_p) \pmod p$$
holds for all $a \in \mathbb{Z}.$ Prove that there exists a rational number $r$ such that
$$f(x)=g(x+r).$$
Find at least one polynomial $P(x)$ of degree 2001 such that $P(x)+P(1- x)=1$ holds for all real numbers $x$.
For a given natural number $k > 1$, find all functions $f:\mathbb{R} \to \mathbb{R}$ such that for all $x, y \in \mathbb{R}$, $f[x^k + f(y)] = y +[f(x)]^k$.
Let $a_1 < a_2 < \cdots <a_n$ be pairwise coprime positive integers with $a_1$ being prime and $a_1 \ge n + 2$. On the segment $I = [0, a_1 a_2 \cdots a_n ]$ of the real line, mark all integers that are divisible by at least one of the numbers $a_1 , \ldots , a_n$ . These points split $I$ into a number of smaller segments. Prove that the sum of the squares of the lengths of these segments is divisible by $a_1$.
[i]Proposed by Serbia[/i]
Let $f^{(n)}(x)$ denote the $n^{\text{th}}$ iterate of function $f$, i.e $f^{(1)}(x)=f(x)$, $f^{(n+1)}(x)=f(f^{(n)}(x))$.
Let $p(n)$ be a given polynomial with integer coefficients, which maps the positive integers into the positive integers. Is it possible that the functional equation $f^{(n)}(n)=p(n)$ has exactly one solution $f$ that maps the positive integers into the positive integers?
[i]Submitted by Dávid Matolcsi and Kristóf Szabó, Budapest[/i]
If $ p(x)$ is a polynomial, denote by $ p^n(x)$ the polynomial $ p(p(...(p(x))..)$, where $ p$ is iterated $ n$ times. Prove that the polynomial $ p^{2003}(x)\minus{}2p^{2002}(x)\plus{}p^{2001}(x)$ is divisible by $ p(x)\minus{}x$
Let the function $f:N^*\to N^*$ such that
[b](1)[/b] $(f(m),f(n))\le (m,n)^{2014} , \forall m,n\in N^*$;
[b](2)[/b] $n\le f(n)\le n+2014 , \forall n\in N^*$
Show that: there exists the positive integers $N$ such that $ f(n)=n $, for each integer $n \ge N$.
(High School Affiliated to Nanjing Normal University )
Polynomial $w(x)$ of second degree with integer coefficients takes for integer arguments values, which are squares of integers. Prove that polynomial $w(x)$ is a square of a polynomial.
Prove that if $ c, d $ are integers with $ c \neq d $, $ d > 0 $ then the equation $$ x^3 - 3cx^2 - dx + c = 0$$
has no more than one rational root.
Given a natural number $n,$ find all polynomials $P(x)$ of degree less than $n$ satisfying the following condition \[ \sum^n_{i=0} P(i) \cdot (-1)^i \cdot \binom{n}{i} = 0. \]
Determine all non-constant polynomials $X^n+a_{n-1}X^{n-1}+\cdots +a_1X+a_0$ with integer coefficients for which the roots are exactly the numbers $a_0,a_1,\ldots ,a_{n-1}$ (with multiplicity).
Let $P,Q$ be the polynomials:
$$x^3-4x^2+39x-46, x^3+3x^2+4x-3,$$
respectively.
1. Prove that each of $P, Q$ has an unique real root. Let them be $\alpha,\beta$, respectively.
2. Prove that $\{ \alpha\}>\{ \beta\} ^2$, where $\{ x\}=x-\lfloor x\rfloor$ is the fractional part of $x$.
Let $n$ be a positive integer and $a_1, a_2, \dots , a_{2n}$ mutually distinct integers. Find all integers $x$ satisfying
\[(x - a_1) \cdot (x - a_2) \cdots (x - a_{2n}) = (-1)^n(n!)^2.\]
Let $q{}$ be an arbitrary polynomial with complex coefficients which is not identically $0$ and $\Gamma_q =\{z : |q(z)| = 1\}$ be its contour line. Prove that for every point $z_0\in\Gamma_q$ there is a polynomial $p{}$ for which $|p(z_0)| = 1$ and $|p(z)|<1$ for any $z\in\Gamma_q\setminus\{z_0\}.$
Find all integers $n \ge 3$ for which the polynomial
\[W(x) = x^n - 3x^{n-1} + 2x^{n-2} + 6\]
can be written as a product of two non-constant polynomials with integer coefficients.
Let $p$ be a polynomial with integer coefficients and let $a_1<a_2<\cdots <a_k$ be integers. Given that $p(a_i)\ne 0\forall\; i=1,2,\cdots, k$.
[list]
(a) Prove $\exists\; a\in \mathbb{Z}$ such that
\[ p(a_i)\mid p(a)\;\;\forall i=1,2,\dots ,k \]
(b) Does there exist $a\in \mathbb{Z}$ such that
\[ \prod_{i=1}^{k}p(a_i)\mid p(a) \][/list]
[b]p1.[/b] Ana, Bob, Cho, Dan, and Eve want to use a microwave. In order to be fair, they choose a random order to heat their food in (all orders have equal probability). Ana's food needs $5$ minutes to cook, Bob's food needs $7$ minutes, Cho's needs $1$ minute, Dan's needs $12$ minutes, and Eve's needs $5$ minutes. What is the expected number of minutes Bob has to wait for his food to be done?
[b]p2.[/b] $ABC$ is an equilateral triangle. $H$ lies in the interior of $ABC$, and points $X$, $Y$, $Z$ lie on sides $AB, BC, CA$, respectively, such that $HX\perp AB$, $HY \perp BC$, $HZ\perp CA$. Furthermore, $HX =2$, $HY = 3$, $HZ = 4$. Find the area of triangle $ABC$.
[b]p3.[/b] Amy, Ben, and Chime play a dice game. They each take turns rolling a die such that the $first$ person to roll one of his favorite numbers wins. Amy's favorite number is $1$, Ben's favorite numbers are $2$ and $3$, and Chime's are $4$, $5$, and $6$. Amy rolls first, Ben rolls second, and Chime rolls third. If no one has won after Chime's turn, they repeat the sequence until someone has won. What's the probability that Chime wins the game?
[b]p4.[/b] A point $P$ is chosen randomly in the interior of a square $ABCD$. What is the probability that the angle $\angle APB$ is obtuse?
[b]p5.[/b] Let $ABCD$ be the quadrilateral with vertices $A = (3, 9)$, $B = (1, 1)$, $C = (5, 3)$, and $D = (a, b)$, all of which lie in the first quadrant. Let $M$ be the midpoint of $AB$, $N$ the midpoint of $BC$, $O$ the midpoint of $CD$, and $P$ the midpoint of $AD$. If $MNOP$ is a square, find $(a, b)$.
[b]p6.[/b] Let $M$ be the number of positive perfect cubes that divide $60^{60}$. What is the prime factorization of $M$?
[b]p7.[/b] Given that $x$, $y$, and $z$ are complex numbers with $|x|=|y| =|z|= 1$, $x + y + z = 1$ and $xyz = 1$, find $|(x + 2)(y + 2)(z + 2)|$.
[b]p8.[/b] If $f(x)$ is a polynomial of degree $2008$ such that $f(m) = \frac{1}{m}$ for $m = 1, 2, ..., 2009$, find $f(2010)$.
[b]p9.[/b] A drunkard is randomly walking through a city when he stumbles upon a $2 \times 2$ sliding tile puzzle. The puzzle consists of a $2 \times 2$ grid filled with a blank square, as well as $3$ square tiles, labeled $1$, $2$, and $3$. During each turn you may fill the empty square by sliding one of the adjacent tiles into it. The following image shows the puzzle's correct state, as well as two possible moves you can make:
[img]https://cdn.artofproblemsolving.com/attachments/c/6/7ddd9305885523deeee2a530dc90505875d1cc.png[/img]
Assuming that the puzzle is initially in an incorrect (but solvable) state, and that the drunkard will make completely random moves to try and solve it, how many moves is he expected to make before he restores the puzzle to its correct state?
[b]p10.[/b] How many polynomials $p(x)$ exist such that the coeffients of $p(x)$ are a rearrangement of $\{0, 1, 2, .., deg \, p(x)\}$ and all of the roots of $p(x)$ are rational? (Note that the leading coefficient of $p(x)$ must be nonzero.)
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $P(x)$ be a polynomial with positive integer coefficients and degree 2015. Given that there exists some $\omega \in \mathbb{C}$ satisfying
$$\omega^{73} = 1\quad \text{and}$$
$$P(\omega^{2015}) + P(\omega^{2015^2}) + P(\omega^{2015^3}) + \ldots + P(\omega^{2015^{72}}) = 0,$$
what is the minimum possible value of $P(1)$?
Let $P(x_1,\dots,x_n)$ denote a polynomial with real coefficients in the variables $x_1,\dots,x_n,$ and suppose that
(a) $\left(\frac{\partial^2}{\partial x_1^2}+\cdots+\frac{\partial^2}{\partial x_n^2} \right)P(x_1,\dots,x_n)=0$ (identically)
and that
(b) $x_1^2+\cdots+x_n^2$ divides $P(x_1,\dots,x_n).$
Show that $P=0$ identically.