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_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]
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]
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)
The polynomial $P(x)=a_0+a_1x+a_2x^2+...+a_8x^8+2009x^9$ has the property that $P(\tfrac{1}{k})=\tfrac{1}{k}$ for $k=1,2,3,4,5,6,7,8,9$. There are relatively prime positive integers $m$ and $n$ such that $P(\tfrac{1}{10})=\tfrac{m}{n}$. Find $n-10m$.
Let $p$ be a prime number. Determine the maximal degree of a polynomial $T(x)$ whose coefficients belong to $\{ 0,1,\cdots,p-1 \}$, whose degree is less than $p$, and which satisfies \[T(n)=T(m) \; \pmod{p}\Longrightarrow n=m \; \pmod{p}\] for all integers $n, m$.
Let $$f(X)=a_{n}X^{n}+a_{n-1}X^{n-1}+\cdots +a_{1}X+a_{0}$$be a polynomial with real coefficients which satisfies $$a_{n}\geq a_{n-1}\geq \cdots \geq a_{1}\geq a_{0}>0.$$Prove that for every complex root $z$ of this polynomial, we have $|z|\leq 1$.
Let $P(x)$ be a polynomial taking integer values at integer inputs. Are there infinitely many natural numbers that are not representable in the form $P(k)-2^n$ where $n{}$ and $k{}$ are non-negative integers? [i]Proposed by F. Petrov[/i]
Let $p$ be a prime satisfying $p^2\mid 2^{p-1}-1$, and let $n$ be a positive integer. Define \[ f(x) = \frac{(x-1)^{p^n}-(x^{p^n}-1)}{p(x-1)}. \] Find the largest positive integer $N$ such that there exist polynomials $g(x)$, $h(x)$ with integer coefficients and an integer $r$ satisfying $f(x) = (x-r)^N g(x) + p \cdot h(x)$. [i]Proposed by Victor Wang[/i]
Let n, k be positive integers. Let $f_a(x) := ||x - a||^{2n}$ , where the vectors $x = (x_1, ..., x_k) , a\in R^k$ , and ||·|| is the Euclidean norm. Let the vector space $Q_{n, k}$ be generated by the functions $f_a$ ($a\in R^k$). What is the largest integer N for which $Q_{n, k}$ contains all polynomials of $x_1, ..., x_k$ whose total degree is at most N?
Prove that for every polynomial $P(x)$ with real coefficients there exist a positive integer $m$ and polynomials $P_{1}(x),\ldots , P_{m}(x)$ with real coefficients such that \[P(x) = (P_{1}(x))^{3}+\ldots +(P_{m}(x))^{3}\]
Prove that for every natural number $ n$ there exists a polynomial $ p(x)$ with integer coefficients such that$ p(1),p(2),...,p(n)$ are distinct powers of $ 2$ .
Let $a \geq 3$ be a real number, and $P$ a polynomial of degree $n$ and having real coefficients. Prove that at least one of the following numbers is greater than or equal to $1:$ $$|a^0- P(0)|, \ |a^1-P(1)| , \ |a^2-P(2)|, \cdots, |a^{n + 1}-P(n + 1)|.$$
One considers for $n > 2$ the polynomial: $$(x^2-x+1)^n - (x^2-x+2)^n+ (1+x)^n+(2-x)^n$$ Show that the degree of this polynomial is $2n - 2$. The polynomial is written in the form $$a_0+a_1x+a_2x^2+...+a_{2n-2}x^{2n-2}$$ Prove that $a_2+a_3+...+a_{2n-2}=0$
As $a$, $b$ and $c$ range over [i]all[/i] real numbers, let $m$ be the smallest possible value of $$2\left(a+b+c\right)^2+\left(ab-4\right)^2+\left(bc-4\right)^2+\left(ca-4\right)^2$$ and $n$ be the number of ordered triplets $\left(a,b,c\right)$ such that the above quantity is minimized. Compute $m+n$. [i]2016 CCA Math Bonanza Team #8[/i]