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 $P(x)$ be a non-constant polynomial with integer coefficients. Prove that there is no function $T$ from the set of integers into the set of integers such that the number of integers $x$ with $T^n(x)=x$ is equal to $P(n)$ for every $n\geq 1$, where $T^n$ denotes the $n$-fold application of $T$. [i]Proposed by Jozsef Pelikan, Hungary[/i]
Let $n\ge 2$ be an integer and let $P(X)=X^n+a_{n-1}X^{n-1}+\ldots +a_1X+1$ be a polynomial with positive integer coefficients. Suppose that $a_k=a_{n-k}$ for all $k\in 1,2,\ldots,n-1$. Prove that there exist infinitely many pairs of positive integers $x,y$ such that $x|P(y)$ and $y|P(x)$. [i]Remus Nicoara[/i]
Let $m\ge 5$ be an odd integer, and let $D(m)$ denote the number of quadruples $\big(a_1, a_2, a_3, a_4\big)$ of distinct integers with $1\le a_i \le m$ for all $i$ such that $m$ divides $a_1+a_2+a_3+a_4$. There is a polynomial $$q(x) = c_3x^3+c_2x^2+c_1x+c_0$$such that $D(m) = q(m)$ for all odd integers $m\ge 5$. What is $c_1?$ $(\textbf{A})\: {-}6\qquad(\textbf{B}) \: {-}1\qquad(\textbf{C}) \: 4\qquad(\textbf{D}) \: 6\qquad(\textbf{E}) \: 11$
Find all polynomials $p(x)$ with real coefficients that have the following property: there exists a polynomial $q(x)$ with real coefficients such that $$p(1) + p(2) + p(3) +\dots + p(n) = p(n)q(n)$$ for all positive integers $n$.
Consider the polynomial $p(x)=x^{1999}+2x^{1998}+3x^{1997}+\ldots+2000$. Find a nonzero polynomial whose roots are the reciprocal values of the roots of $p(x)$.
Find all value of $ n$ for which there are nonzero real numbers $ a, b, c, d$ such that after expanding and collecting similar terms, the polynomial $ (ax \plus{} b)^{100} \minus{} (cx \plus{} d)^{100}$ has exactly $ n$ nonzero coefficients.
The polynomial $W(x)=x^2+ax+b$ with integer coefficients has the following property: for every prime number $p$ there is an integer $k$ such that both $W(k)$ and $W(k+1)$ are divisible by $p$. Show that there is an integer $m$ such that $W(m)=W(m+1)=0$.
Prove that $\frac{5^{125}-1}{5^{25}-1}$ is a composite number.
Complex numbers $\alpha$ , $\beta$ , $\gamma$ have the property that $\alpha^k +\beta^k +\gamma^k$ is an integer for every natural number $k$. Prove that the polynomial \[(x-\alpha)(x-\beta )(x-\gamma )\] has integer coefficients.
Let $a_i (i=1,2,3,4,5,6)$ are reals. The polynomial $f(x)=a_1+a_2x+a_3x^2+a_4x^3+a_5x^4+a_6a^5+7x^6-4x^7+x^8$ can be factorized into linear factors $x-x_i$ where $i \in {1,2,3,...,8}$. Find the possible values of $a_1$.
A polynomial product of the form \[(1-z)^{b_1}(1-z^2)^{b_2}(1-z^3)^{b_3}(1-z^4)^{b_4}(1-z^5)^{b_5}\cdots(1-z^{32})^{b_{32}},\] where the $b_k$ are positive integers, has the surprising property that if we multiply it out and discard all terms involving $z$ to a power larger than $32$, what is left is just $1-2z$. Determine, with proof, $b_{32}$.
Let $p$ be an odd prime number, and $k$ be an odd number not divisible by $p$. Consider a field $K$ be a field with $kp+1$ elements, and $A = \{x_1,x_2, \dots, x_t\}$ be the set of elements of $K^*$, whose order is not $k$ in the multiplicative group $(K^*,\cdot)$. Prove that the polynomial $P(X)=(X+x_1)(X+x_2)\dots(X+x_t)$ has at least $p$ coefficients equal to $1$.
We have $n$ points in the plane, no three on a line. We call $k$ of them good if they form a convex polygon and there is no other point in the convex polygon. Suppose that for a fixed $k$ the number of $k$ good points is $c_k$. Show that the following sum is independent of the structure of points and only depends on $n$ : \[ \sum_{i=3}^n (-1)^i c_i \]
For integers a, b, c, and d the polynomial $p(x) =$ $ax^3 + bx^2 + cx + d$ satisfies $p(5) + p(25) = 1906$. Find the minimum possible value for $|p(15)|$.
Let $P(x)$ be a nonzero polynomial such that $(x-1)P(x+1)=(x+2)P(x)$ for every real $x$, and $\left(P(2)\right)^2 = P(3)$. Then $P(\tfrac72)=\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
Justify your answer whether $A=\left( \begin{array}{ccc} -4 & -1& -1 \\ 1 & -2& 1 \\ 0 & 0& -3 \end{array} \right)$ is similar to $B=\left( \begin{array}{ccc} -2 & 1& 0 \\ -1 & -4& 1 \\ 0 & 0& -3 \end{array} \right),\ A,\ B\in{M(\mathbb{C})}$ or not.
Find out wich of the following polynomials are irreducible. a) $t^4+1$ over $\mathbb{R}$; b) $t^4+1$ over $\mathbb{Q}$; c) $t^3-7t^2+3t+3$ over $\mathbb{Q}$; d) $t^4+7$ over $\mathbb{Z}_{17}$; e) $t^3-5$ over $\mathbb{Z}_{11}$; f) $t^6+7$ over $\mathbb{Q}(i)$.
Let $\mathcal{P}_n$ be the set of all real monic polynomial functions of degree $n$. Prove that for any $a<b$, $$\inf_{P\in\mathcal{P}_n}\int_a^b |P(x)|\, dx >0.$$ [i]Cristi Săvescu[/i]
Find $x^2+y^2$ if $x$ and $y$ are positive integers such that \[xy+x+y = 71\qquad\text{and}\qquad x^2y+xy^2 = 880.\]
Find all the polynomials with real coefficients which satisfy $ (x^2-6x+8)P(x)=(x^2+2x)P(x-2)$ for all $x\in \mathbb{R}$.
The equation \[x^5 + 5 \lambda x^4 - x^3 + (\lambda \alpha - 4)x^2 - (8 \lambda + 3)x + \lambda \alpha - 2 = 0\] is given. Determine $\alpha$ so that the given equation has exactly (i) one root or (ii) two roots, respectively, independent from $\lambda.$
Does there exist a set $M$ in usual Euclidean space such that for every plane $\lambda$ the intersection $M \cap \lambda$ is finite and nonempty ? [i]Proposed by Hungary.[/i] [hide="Remark"]I'm not sure I'm posting this in a right Forum.[/hide]
Let $a,b,c,d$ be real numbers. Prove that the set $M=\left\{ax^3+bx^2+cx+d|x\in\mathbb R\right\}$ contains no irrational numbers if and only if $a=b=c=0$ and $d$ is rational.
Show that there are infinitely many pairs of prime numbers $(p,q)$ such that $p\mid 2^{q-1}-1$ and $q\mid 2^{p-1}-1$.
Let $P(x) = x^2 - 20x - 11$. If $a$ and $b$ are natural numbers such that $a$ is composite, $\gcd(a, b) = 1$, and $P(a) = P(b)$, compute $ab$. Note: $\gcd(m, n)$ denotes the greatest common divisor of $m$ and $n$. [i]Proposed by Aaron Lin [/i]