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

Let $P(x)$ be a quartic polynomial with integer coefficients and leading coefficient $1$ such that $P(\sqrt 2+\sqrt 3+\sqrt 6)=0$. Find $P(1)$.
Let $p(x)$ be the monic cubic polynomial with roots $\sin^2(1^{\circ})$, $\sin^2(3^{\circ})$, and $\sin^2(9^{\circ})$. Suppose that $p\left(\frac{1}{4}\right)=\frac{\sin(a^{\circ})}{n\sin(b^{\circ})}$, where $0 <a,b \le 90$ and $a,b,n$ are positive integers. What is $a+b+n$? [i]Proposed by Andrew Yuan[/i]
Let $A = A(x,y)$ and $B = B(x,y)$ be two-variable polynomials with real coefficients. Suppose that $A(x,y)/B(x,y)$ is a polynomial in $x$ for infinitely many values of $y$, and a polynomial in $y$ for infinitely many values of $x$. Prove that $B$ divides $A$, meaning there exists a third polynomial $C$ with real coefficients such that $A = B \cdot C$. [i]Proposed by Victor Wang[/i]
Polynomial $p(x)$ with real coefficients, which is different from the constant, has the following property: [i] for any naturals $n$ and $k$ the $\frac{p(n+1)p(n+2)...p(n+k)}{p(1)p(2)...p(k)}$ is an integer.[/i] Prove that this polynomial is divisible by $x$.
Let $f : R \to R$, and let $P$ be a nonzero polynomial with degree no more than $2015$. For any nonnegative integer $n$, $f^{(n)}(x)$ denotes the function defined as $f$ composed with itself $n$ times. For example, $f^{(0)}(x) = x$, $f^{(1)}(x) = f(x)$, $f^{(2)}(x) = f(f(x))$, etc. Show that there always exists a real number $q$ such that $$f^{((2017^{2017})!)(q)} \ne (q + 2017)(qP(q) - 1).$$
When all vertex angles of a convex polygon are equal, call it equiangular. Prove that $ p > 2$ is a prime number, if and only if the lengths of all sides of equiangular $ p$ polygon are rational numbers, it is a regular $ p$ polygon.
Define the polymonial sequence $\left \{ f_n\left ( x \right ) \right \}_{n\ge 1}$ with $f_1\left ( x \right )=1$, $$f_{2n}\left ( x \right )=xf_n\left ( x \right ), \; f_{2n+1}\left ( x \right ) = f_n\left ( x \right )+ f_{n+1} \left ( x \right ), \; n\ge 1.$$ Look for all the rational number $a$ which is a root of certain $f_n\left ( x \right ).$
Let $k$ and $m$ be positive integers. For a positive integer $n$, let $f(n)$ be the number of integer sequences $x_1,\,\ldots,\,x_k,\,y_1,\,\ldots,\,y_m,\,z$ satisfying $1\leq x_1\leq\cdots\leq x_k\leq z\leq n$ and $1\leq y_1\leq\cdots\leq y_m\leq z\leq n$. Show that $f(n)$ can be expressed as a polynomial in $n$ with nonnegative coefficients.
The number obtained from the last two nonzero digits of $ 90!$ is equal to $ n$. What is $ n$? $ \textbf{(A)}\ 12 \qquad \textbf{(B)}\ 32 \qquad \textbf{(C)}\ 48 \qquad \textbf{(D)}\ 52 \qquad \textbf{(E)}\ 68$
Let $P_c(x)=x^4+ax^3+bx^2+cx+1$ and $Q_c(x)=x^4+cx^3+bx^2+ax+1$ with $a,b$ real numbers, $c \in \{1,2, \dots, 2017\}$ an integer and $a \ne c$. Define $A_c=\{\alpha | P_c(\alpha)=0\}$ and $B_c=\{\beta | P(\beta)=0\}$. (a) Find the number of unordered pairs of polynomials $P_c(x), Q_c(x)$ with exactly two common roots. (b) For any $1 \le c \le 2017$, find the sum of the elements of $A_c \Delta B_c$.
Does there exist a real $3\times 3$ matrix $A$ such that $\text{tr}(A)=0$ and $A^2+A^t=I?$ ($\text{tr}(A)$ denotes the trace of $A,\ A^t$ the transpose of $A,$ and $I$ is the identity matrix.) [i]Proposed by Moubinool Omarjee, Paris[/i]
Suppose that $n$ is a positive integer number. Consider a regular polygon with $2n$ sides such that one of its largest diagonals is parallel to the $x$-axis. Find the smallest integer $d$ such that there is a polynomial $P$ of degree $d$ whose graph intersects all sides of the polygon on points other than vertices. Proposed by Mohammad Ahmadi
Let $P (x)$ be a non constant integer polynomial and positive integer $n$. The sequence $a_0, a_1, ...$ is defined by $a_0 = n$ and $a_k = P (a_{k-1})$ for $k \ge 1$. Given that for each positive integer $b$, the sequence contains a $b$-th power of some positive integer greater than $1$. Prove that deg $P = 1$
Suppose that for two real numbers $x$ and $y$ the following equality is true: $$(x+ \sqrt{1+ x^2})(y+\sqrt{1+y^2})=1$$ Find (with proof) the value of $x+y$.
Let $P(x)$ be a monic polynomial with integer coefficients of degree $10$. Prove that there exist distinct positive integers $a,b$ not exceeding $101$ such that $P(a)-P(b)$ is divisible by $101$.
Find all polynomials $ P $ with integer coefficients that have the property that for any natural number $ n $ the polynomial $ P-n $ has at least a root whose square is integer.
$n>1$ is an integer. Let real number $x>1$ satisfy $$x^{101}-nx^{100}+nx-1=0.$$ Prove that for any real $0<a<b<1$, there exists a positive integer $m$ so that $a<\{x^m\}<b.$ [i]Proposed by Chenjie Yu[/i]
Let the polynomial $P(x)=x^3+19x^2+94x+a$ where $a\in\mathbb{N}$. If $p$ a prime number, prove that no more than three numbers of the numbers $P(0), P(1),\ldots, P(p-1)$ are divisible by $p$.
For every natural number $n$, find all polynomials $x^2+ax+b$, where $a^2 \geq 4b$, that divide $x^{2n} + ax^n + b$.
Let $A$ be an $n\times n$ real matrix with minimal polynomial $x^n + x - 1$. Prove that the trace of $(nA^{n-1} + I)^{-1}A^{n-2}$ is zero.
Let $a, b, c, d$ be integers. Prove that for any positive integer $n$, there are at least $\left \lfloor{\frac{n}{4}}\right \rfloor $ positive integers $m \leq n$ such that $m^5 + dm^4 + cm^3 + bm^2 + 2023m + a$ is not a perfect square. [i]Proposed by Ilir Snopce[/i]
Let $n$ be an integer with $n\geq 2.$ Over all real polynomials $p(x)$ of degree $n,$ what is the largest possible number of negative coefficients of $p(x)^2?$
Prove that the polynomial $ x^3 + x + 1 $ is a factor of the polynomial $ P_n(x) = x^{n + 2} + (x+1)^{2n+1} $ for every integer $ n \geq 0 $.
Given a polynomial $P(x)$ with positive real coefficients. Prove that $P(1)P(xy) \ge P(x)P(y)$ for all $x\ge1, y \ge 1$. (K. Gorodnin)
Find all relatively distinct integers $m, n, p\in \mathbb{Z}_{\ne 0}$ such that the polynomial $$F(x) = x(x - m)(x - n)(x - p) + 1$$is reducible in $\mathbb{Z}[x].$