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

Prove that the Polynomial $ f(x) \equal{} x^{4} \plus{} 26x^{3} \plus{} 56x^{2} \plus{} 78x \plus{} 1989$ can't be expressed as a product $ f(x) \equal{} p(x)q(x)$ , where $ p(x)$ and $ q(x)$ are both polynomial with integral coefficients and with degree at least $ 1$.
Let $Q$ be a polynomial \[Q(x)=a_0+a_1x+\cdots+a_nx^n,\] where $a_0,\ldots,a_n$ are nonnegative integers. Given that $Q(1)=4$ and $Q(5)=152$, find $Q(6)$.
Let $f \in \mathbb Z[X]$. For an $n \in \mathbb N$, $n \geq 2$, we define $f_n : \mathbb Z / n \mathbb Z \to \mathbb Z / n \mathbb Z$ through $f_n \left( \widehat x \right) = \widehat{f \left( x \right)}$, for all $x \in \mathbb Z$. (a) Prove that $f_n$ is well defined. (b) Find all polynomials $f \in \mathbb Z[X]$ such that for all $n \in \mathbb N$, $n \geq 2$, the function $f_n$ is surjective. [i]Bogdan Enescu[/i]
Suppose $a,b$ and $c$ are real numbers that satisfy $a+b+c=5$ and $\tfrac{1}{a}+\tfrac{1}{b}+\tfrac{1}{c}=\tfrac15$. Find the greatest possible value of $a^3+b^3+c^3$.
Let $ f(x)$ be a polynomial with rational coefficients and $ \alpha$ be a real number such that \[ \alpha^3 \minus{} \alpha \equal{} [f(\alpha)]^3 \minus{} f(\alpha) \equal{} 33^{1992}.\] Prove that for each $ n \geq 1,$ \[ \left [ f^{n}(\alpha) \right]^3 \minus{} f^{n}(\alpha) \equal{} 33^{1992},\] where $ f^{n}(x) \equal{} f(f(\cdots f(x))),$ and $ n$ is a positive integer.
Find the maximum number $ C$ such that for any nonnegative $ x,y,z$ the inequality $ x^3 \plus{} y^3 \plus{} z^3 \plus{} C(xy^2 \plus{} yz^2 \plus{} zx^2) \ge (C \plus{} 1)(x^2 y \plus{} y^2 z \plus{} z^2 x)$ holds.
The polynomial $$x^{10} + ?x^9 + ?x^8 + ... + ?x + 1$$ is written on the blackboard. Two players substitute (real) numbers instead of one of the question marks in turn. ($9$ turns total.) The first wins if the polynomial will have no real roots. Who wins?
For a prime $ p\ge 5, $ determine the number of polynomials $ X^p+pX^k+pX^l+1 $ with $ 1<k<l<p, $ that are ireducible over the integers.
Numbers $1,\ldots,2025$ are written in a circle in increasing order. For every three consecutive numbers $i,j,k$ we consider the polynomial $(x-i)(x-j)(x-k)$. Let $s(x)$ be the sum of all $2025$ these polynomials. Prove that $s(x)$ has an integral root. [i]A. Voidelevich[/i]
Let $P(x)$ be the unique polynomial of degree four for which $P(165) = 20$, and \[ P(42) = P(69) = P(96) = P(123) = 13. \] Compute $P(1) - P(2) + P(3) - P(4) + \dots + P(165)$. [i]Proposed by Evan Chen[/i]
Let $n$ be a positive integer. What is the largest $k$ for which there exist $n\times n$ matrices $M_1,\dots,M_k$ and $N_1,\dots,N_k$ with real entries such that for all $i$ and $j,$ the matrix product $M_iN_j$ has a zero entry somewhere on its diagonal if and only if $i\ne j?$
Let $P(x)$ be a nonzero polynomial with integer coefficients. Let $a_{0}=0$ and for $i \ge 0$ define $a_{i+1}=P(a_{i})$. Show that $\gcd ( a_{m}, a_{n})=a_{ \gcd (m, n)}$ for all $m, n \in \mathbb{N}$.
A quadratic polynomial $p(x)$ with real coefficients and leading coefficient $1$ is called disrespectful if the equation $p(p(x)) = 0$ is satisfied by exactly three real numbers. Among all the disrespectful quadratic polynomials, there is a unique such polynomial $\tilde{p}(x)$ for which the sum of the roots is maximized. What is $\tilde{p}(1)?$ $\textbf{(A) }\dfrac5{16} \qquad \textbf{(B) }\dfrac12 \qquad \textbf{(C) }\dfrac58 \qquad \textbf{(D) }1 \qquad \textbf{(E) }\dfrac98$
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).
For what real values of $k$ do $1988x^2 + kx + 8891$ and $8891x^2 + kx + 1988$ have a common zero?
$(POL 3)$ Given a polynomial $f(x)$ with integer coefficients whose value is divisible by $3$ for three integers $k, k + 1,$ and $k + 2$. Prove that $f(m)$ is divisible by $3$ for all integers $m.$
There are nonzero integers $a$, $b$, $r$, and $s$ such that the complex number $r+si$ is a zero of the polynomial $P(x) = x^3 - ax^2 + bx - 65$. For each possible combination of $a$ and $b$, let $p_{a,b}$ be the sum of the zeroes of $P(x)$. Find the sum of the $p_{a,b}$'s for all possible combinations of $a$ and $b$.
The monic polynomial $P(x) = x^n + a_{n-1}x^{n-1} +...+ a_0$ of degree $n > 1$ has $n$ distinct negative roots. Prove that $a_1P(1) > 2n^2a_o$
For certain real values of $a, b, c,$ and $d,$ the equation $x^4+ax^3+bx^2+cx+d=0$ has four non-real roots. The product of two of these roots is $13+i$ and the sum of the other two roots is $3+4i,$ where $i=\sqrt{-1}.$ Find $b.$
Determine a polynomial of non-negative real coefficients that satisfies the following two conditions: $$p(0) = 0, p(|z|) \le x^4 + y^4,$$ being $|z|$ the module of the complex number $z = x + iy$ .
For any positive integer $n$, show that there exists a polynomial $P(x)$ of degree $n$ with integer coefficients such that $P(0),P(1), \ldots, P(n)$ are all distinct powers of $2$.
Sum of all coefficients of polynomial $P(x)$ is equal with $2$ . Also the sum of coefficients which are at odd exponential in $x^k$ are equal to sum of coefficients which are at even exponential in $x^k$ . Find the residue of polynomial $P(x)$ when it is divide by $x^2-1$ .
Let be a natural number $ n $ and $ 2n $ real numbers $ b_1,b_2,\ldots ,b_n,a_1<a_2<\cdots <a_n. $ Show that [b]a)[/b] if $ b_1,b_2,\ldots ,b_n>0, $ then there exists a polynomial $ f\in\mathbb{R}[X] $ irreducible in $ \mathbb{R}[X] $ such that $$ f\left( a_i \right) =b_i,\quad\forall i\in\{ 1,2,\ldots ,n \} . $$ [b]b)[/b] there exists a polynom $ g\in\mathbb{R} [X] $ of degree at least $ 1 $ which has only real roots and such that $$ g\left( a_i \right) =b_i,\quad\forall i\in\{ 1,2,\ldots ,n \} . $$
(1) Prove that $\sqrt[3]{2}$ is irrational. (2) Let $P(x)$ be a polynomoal with rational coefficients such that $P(\sqrt[3]{2})=0$. Prove that $P(x)$ is divisible by $x^3-2$. 35 points
Let $(a_n)_{n=1}^{\infty}$ be a sequence with $a_n \in \{0,1\}$ for every $n$. Let $F:(-1,1) \to \mathbb{R}$ be defined by \[F(x)=\sum_{n=1}^{\infty} a_nx^n\] and assume that $F\left(\frac{1}{2}\right)$ is rational. Show that $F$ is the quotient of two polynomials with integer coefficients.