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: 4275

Consider polynomial $f(x)={{x}^{2}}-\alpha x+1$ with $\alpha \in \mathbb{R}.$ a) For $\alpha =\frac{\sqrt{15}}{2}$, let write $f(x)$ as the quotient of two polynomials with nonnegative coefficients. b) Find all value of $\alpha $ such that $f(x)$ can be written as the quotient of two polynomials with nonnegative coefficients.
Two polynomials $P(x)=x^4+ax^3+bx^2+cx+d$ and $Q(x)=x^2+px+q$ have real coefficients, and $I$ is an interval on the real line of length greater than $2$. Suppose $P(x)$ and $Q(x)$ take negative values on $I$, and they take non-negative values outside $I$. Prove that there exists a real number $x_0$ such that $P(x_0)<Q(x_0)$.
Let $p$ be a polynomial with degree less than $4$ such that $p(x)$ attains a maximum at $x = 1$. If $p(1) = p(2) = 5$, find $p(10)$.
Let $P(z)$ be a polynomial with real coefficients whose roots are covered by a disk of radius R. Prove that for any real number $k$, the roots of the polynomial $nP(z)-kP'(z)$ can be covered by a disk of radius $R+|k|$, where $n$ is the degree of $P(z)$, and $P'(z)$ is the derivative of $P(z)$. can anyone help me? It would also be extremely helpful if anyone could tell me where they've seen this type of problems.............Has it appeared in any mathematics competitions? Or are there any similar questions for me to attempt? Thanks in advance!
Find all polynomials $ P(x)$ with real coefficients such that for every positive integer $ n$ there exists a rational $ r$ with $ P(r)=n$.
Prove that if the equation $x^4 + ax^3 + bx + c = 0$ has all its roots real, then $ab \leq 0.$
The teacher wrote on a blackboard: $$x^2 + 10x + 20$$ Then all the pupils in the class came up in turn and either decreased or increased by $1$ either the free coefficient or the coefficient at $x$, but not both. Finally they have obtained: $$x^2 + 20x + 10$$ Is it true that some time during the process there was written the square polynomial with the integer roots?
Find all polynomilals $P$ with real coefficients, such that $(x+1)P(x-1)+(x-1)P(x+1)=2xP(x)$
$k$ and $n$ are positive integers that are greater than $1$. $N$ is the set of positive integers. $A_1, A_2, \cdots A_k$ are pairwise not-intersecting subsets of $N$ and $A_1 \cup A_2 \cup \cdots \cup A_k = N$. Prove that for some $i \in \{ 1,2,\cdots,k \}$, there exsits infinity many non-factorable n-th degree polynomials so that coefficients of one polynomial are pairwise distinct and all the coeficients are in $A_i$.
Let $P_{1}(x)=x^{2}-2$ and $P_{j}(x)=P_{1}(P_{j-1}(x))$ for j$=2,\ldots$ Prove that for any positive integer n the roots of the equation $P_{n}(x)=x$ are all real and distinct.
There are $n$ coins lying in a circle. Each coin has two sides, $+$ and $-$. A $flop$ means to flip every coin that has two different neighbors simultaneously, while leaving the others alone. For instance, $++-+$, after one $flop$, becomes $+---$. For $n$ coins, let us define $M$ to be a $perfect$ $number$ if for any initial arrangement of the coins, the arrangement of the coins after $m$ $flops$ is exactly the same as the initial one. (a) When $n=1024$, find a perfect number $M$. (b) Find all $n$ for which a perfect number $M$ exist.
For every natural number $ n$, find all polynomials $ x^2\plus{}ax\plus{}b$, where $ a^2 \ge 4b$, that divide $ x^{2n}\plus{}ax^n\plus{}b$.
Let $a_0$ be a positive integer and $a_n=5a_{n-1}+4$ for all $n\ge 1$. Can $a_0$ be chosen so that $a_{54}$ is a multiple of $2013$?
Let $P(x)$ be a polynomial with integer coefficients of degree $n \ge 3$. If $x_1,...,x_m$ ($n\ge m\ge3$) are different integers such that $P(x_1) = P(x_2) = ... = P(x_m) = 1$, prove that $P$ cannot have integer roots$.
Given $a,b,c \in\mathbb{R}^+$, and that $a^2+b^2+c^2=3$. Prove that \[ \frac{1}{a^3+2}+\frac{1}{b^3+2}+\frac{1}{c^3+2}\ge 1 \]
Suppose that $g$ and $h$ are polynomials of degree $10$ with integer coefficients such that $g(2) < h(2)$ and \[ g(x) h(x) = \sum_{k=0}^{10} \left( \binom{k+11}{k} x^{20-k} - \binom{21-k}{11} x^{k-1} + \binom{21}{11}x^{k-1} \right) \] holds for all nonzero real numbers $x$. Find $g(2)$. [i]Proposed by Yang Liu[/i]
Find all polynomials of the form $$P_n(x)=n!x^n+a_{n-1}x^{n-1}+\dots+a_1x+(-1)^n(n+1)$$ with integer coefficients, having $n$ real roots $x_1,\dots,x_n$ satisfying $k \leq x_k \leq k+1$ for $k=1, \dots,n$.
Let $\mathcal{F}$ be the set of polynomials $f(x)$ with integer coefficients for which there exists an integer root of the equation $f(x)=1$. For all $k>1$, let $m_k$ be the smallest integer greater than one for which there exists $f(x)\in \mathcal{F}$ such that $f(x)=m_k$ has exactly $k$ distinct integer roots. If the value of $\sqrt{m_{2021}-m_{2020}}$ can be written as $m\sqrt{n}$ for positive integers $m,n$ where $n$ is squarefree, compute the largest integer value of $k$ such that $2^k$ divides $\frac{m}{n}$.
For any real number$m$, the equation $$x^2+(m-2)x- (m+3)=0$$ has two solutions, denoted $x_1 $and $ x_2$. Determine $m$ such that $x_1^2+x_2^2$ is the minimum possible.
Let $P(x)$ be a polynomial with degree $n$ and real coefficients. For all $0 \le y \le 1$ holds $\mid p(y) \mid \le 1$. Prove that $p(-\frac{1}{n}) \le 2^{n+1} -1$
Let $n$ be an integer. Prove that the polynomial $f(x)$ has at most one zero, where \[ f(x) = x^4 - 1994 x^3 + (1993+n)x^2 - 11x + n . \] [i]Greece[/i]
The polynomial $-400x^5+2660x^4-3602x^3+1510x^2+18x-90$ has five rational roots. Suppose you guess a rational number which could possibly be a root (according to the rational root theorem). What is the probability that it actually is a root?
It is known that for quadratic polynomials $P(x)=x^2+ax+b$ and $Q(x)=x^2+cx+d$ the equation $P(Q(x))=Q(P(x))$ does not have real roots. Prove that $b \neq d$.
Prove that polynomial $x^8+98x^4+1$ can be factorized in $Z[X]$.
Let $n\ge 2$ be a positive integer. For any integer $a$, let $P_a(x)$ denote the polynomial $x^n+ax$. Let $p$ be a prime number and define the set $S_a$ as the set of residues mod $p$ that $P_a(x)$ attains. That is, $$S_a=\{b\mid 0\le b\le p-1,\text{ and there is }c\text{ such that }P_a(c)\equiv b \pmod{p}\}.$$Show that the expression $\frac{1}{p-1}\sum\limits_{a=1}^{p-1}|S_a|$ is an integer. [i]Proposed by fattypiggy123[/i]