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

Determine whether the polynomial $P(x)=(x^2-2x+5)(x^2-4x+20)+1$ is irreducible over $\mathbb{Z}[X]$.
Show that the roots of $x^4 +ax^3 +bx^2 +cx +d$, if suitably numbered, satisfy the relation $\frac{r_1 }{r_2 } = \frac{ r_3 }{r _4},$ provided $a^2 d=c^2 \ne 0.$
Let $f(x) = x^n + a_{n-2} x^{n-2} + a_{n-3}x^{n-3} + \dots + a_1x + a_0$ be a polynomial with real coefficients $(n \ge 2)$. Suppose all roots of $f$ are real. Prove that the absolute value of each root is at most $\sqrt{\frac{2(1-n)}n a_{n-2}}$.
Determine all polynomials $P(x)$ with real coeffcients such that $(x^3+3x^2+3x+2)P(x-1)=(x^3-3x^2+3x-2)P(x)$.
Let $ABCD$ be a trapezoid such that $AB \parallel CD$, $|BC|+|AD| = 7$, $|AB| = 9$ and $|BC| = 14$. What is the ratio of the area of the triangle formed by $CD$, angle bisector of $\widehat{BCD}$ and angle bisector of $\widehat{CDA}$ over the area of the trapezoid? $ \textbf{a)}\ \dfrac{9}{14} \qquad\textbf{b)}\ \dfrac{5}{7} \qquad\textbf{c)}\ \sqrt 2 \qquad\textbf{d)}\ \dfrac{49}{69} \qquad\textbf{e)}\ \dfrac 13 $
$ F(x)$ is polynomial with real coefficients. $ F(x) \equal{} x^{4}\plus{}a_{1}x^{3}\plus{}a_{2}x^{2}\plus{}a_{1}x^{1}\plus{}a_{0}$. $ M$ is local maximum and $ m$ is minimum. Prove that $ \frac{3}{10}(\frac{a_{1}^{2}}{4}\minus{}\frac{2a_{2}}{3^{2}})^{2}< M\minus{}m < 3(\frac{a_{1}^{2}}{4}\minus{}\frac{2a_{2}}{3^{2}})^{2}$
Does there exist functions $ f,g: \mathbb{R}\to\mathbb{R}$ such that $ f(g(x)) \equal{} x^2$ and $ g(f(x)) \equal{} x^k$ for all real numbers $ x$ a) if $ k \equal{} 3$? b) if $ k \equal{} 4$?
Let $f,g$ be polynomials with complex coefficients such that $\gcd(\deg f,\deg g)=1$. Suppose that there exist polynomials $P(x,y)$ and $Q(x,y)$ with complex coefficients such that $f(x)+g(y)=P(x,y)Q(x,y)$. Show that one of $P$ and $Q$ must be constant. [i]Victor Wang.[/i]
Let $n,p \geq 2$ be two integers and $A$ an $n\times n$ matrix with real elements such that $A^{p+1} = A$. a) Prove that $\textrm{rank} \left( A \right) + \textrm{rank} \left( I_n - A^p \right) = n$. b) Prove that if $p$ is prime then \[ \textrm{rank} \left( I_n - A \right) = \textrm{rank} \left( I_n - A^2 \right) = \ldots = \textrm{rank} \left( I_n - A^{p-1} \right) . \]
Prove that: for all positive integers $n\ge 2,$ the polynomial$$(x^2-1)^2(x^2-1)^2...(x^2-2023)^2+1$$ is irreducible in $\mathbb{Q}[x].$
The sequence $ (a_n)$ is defined by: $ a_0\equal{}a_1\equal{}1$ and $ a_{n\plus{}1}\equal{}14a_n\minus{}a_{n\minus{}1}$ for all $ n\ge 1$. Prove that $ 2a_n\minus{}1$ is a perfect square for any $ n\ge 0$.
Find all positive integers $k$ for which the following assertion holds: If $F(x)$ is polynomial with integer coefficients ehich satisfies $F(c) \leq k$ for all $c \in \{0,1, \cdots,k+1 \}$, then \[F(0)= F(1) = \cdots =F(k+1).\]
Let $ p(x)$ be a cubic polynomial with rational coefficients. $ q_1$, $ q_2$, $ q_3$, ... is a sequence of rationals such that $ q_n \equal{} p(q_{n \plus{} 1})$ for all positive $ n$. Show that for some $ k$, we have $ q_{n \plus{} k} \equal{} q_n$ for all positive $ n$.
Prove that if $m,n$ are relatively prime positive integers, $x^m-y^n$ is irreducible in the complex numbers. (A polynomial $P(x,y)$ is irreducible if there do not exist nonconstant polynomials $f(x,y)$ and $g(x,y)$ such that $P(x,y) = f(x,y)g(x,y)$ for all $x,y$.) [i]David Yang.[/i]
Suppose that $p$ and $q$ are two different positive integers and $x$ is a real number. Form the product $(x+p)(x+q).$ Find the sum $S(x,n) = \sum (x+p)(x+q),$ where $p$ and $q$ take values from 1 to $n.$ Does there exist integer values of $x$ for which $S(x,n) = 0.$
Let $n$ be a positive integer. Find all polynomials $P$ with real coefficients such that $$P(x^2+x-n^2)=P(x)^2+P(x)$$ for all real numbers $x$.
Let a sequence of real numbers $a_0, a_1,a_2, \cdots$ satisfies the condition: $$\sum_{n=0}^ma_n\cdot(-1)^n\cdot{m\choose n}=0$$ for all sufficiently large values of $m$. Show that there exists a polynomial $P$ such that $a_n=P(n)$ for all $n\geq 0$
Let $m,n\geq 2$ be integers. Let $f(x_1,\dots, x_n)$ be a polynomial with real coefficients such that $$f(x_1,\dots, x_n)=\left\lfloor \frac{x_1+\dots + x_n}{m} \right\rfloor\text{ for every } x_1,\dots, x_n\in \{0,1,\dots, m-1\}.$$ Prove that the total degree of $f$ is at least $n$.
Let $P(x)\in\mathbb{Z}[x]$ with deg $P=2015$. Let $Q(x)=(P(x))^2-9$. Prove that: the number of distinct roots of $Q(x)$ can not bigger than $2015$
Given is a polynomial $P(x)$ of degree $n>1$ with real coefficients. The equation $P(P(P(x)))=P(x)$ has $n^3$ distinct real roots. Prove that these roots could be split into two groups with equal arithmetic mean.
Consider the set $F$ of all polynomials whose coefficients are in the set of $\{0,1\}$. Let $q(x) = x^3 + x +1$. The number of polynomials $p(x)$ in $F$ of degree $14$ such that the product $p(x)q(x)$ is also in $F$ is:
A polynomial $P$ with degree exactly $3$ satisfies $P\left(0\right)=1$, $P\left(1\right)=3$, and $P\left(3\right)=10$. Which of these cannot be the value of $P\left(2\right)$? $\text{(A) }2\qquad\text{(B) }3\qquad\text{(C) }4\qquad\text{(D) }5\qquad\text{(E) }6$
Let $x_1<x_2<x_3$ be three real roots of equation $\sqrt{2014}x^3-4029x^2+2=0$. Find $x_2(x_1+x_3)$.
The graph of the polynomial \[P(x) \equal{} x^5 \plus{} ax^4 \plus{} bx^3 \plus{} cx^2 \plus{} dx \plus{} e\] has five distinct $ x$-intercepts, one of which is at $ (0,0)$. Which of the following coefficients cannot be zero? $ \textbf{(A)}\ a \qquad \textbf{(B)}\ b \qquad \textbf{(C)}\ c \qquad \textbf{(D)}\ d \qquad \textbf{(E)}\ e$
Show that for any positive integer $n$ the polynomial $f(x)=(x^2+x)^{2^n}+1$ cannot be decomposed into the product of two integer non-constant polynomials. [i]Marius Cavachi[/i]