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

2016 CentroAmerican, 3

Tags: algebra , polynomial , root
The polynomial $Q(x)=x^3-21x+35$ has three different real roots. Find real numbers $a$ and $b$ such that the polynomial $x^2+ax+b$ cyclically permutes the roots of $Q$, that is, if $r$, $s$ and $t$ are the roots of $Q$ (in some order) then $P(r)=s$, $P(s)=t$ and $P(t)=r$.

2002 Tournament Of Towns, 3

Show that if the last digit of the number $x^2+xy+y^2$ is $0$ (where $x,y\in\mathbb{N}$ ) then last two digits are zero.

1996 Brazil National Olympiad, 6

Let p(x) be the polynomial $x^3 + 14x^2 - 2x + 1$. Let $p^n(x)$ denote $p(p^(n-1)(x))$. Show that there is an integer N such that $p^N(x) - x$ is divisible by 101 for all integers x.

2020 Iranian Our MO, 6

Find all functions $f:\mathbb{R}^+ \to \mathbb{R}^+$ and plynomials $P(x),Q(x),R(x)$ with positive real coefficients such that $Q(-1)=-1$ and for all positive reals $x,y$:$$f(\frac{x}{y}+R(y))=\frac{f(x)}{Q(y)}+P(y).$$ [i]Proposed by Alireza Danaie, Ali Mirazaie Anari[/i] [b]Rated 2[/b]

2006 Federal Math Competition of S&M, Problem 4

Tatjana imagined a polynomial $P(x)$ with nonnegative integer coefficients. Danica is trying to guess the polynomial. In each step, she chooses an integer $k$ and Tatjana tells her the value of $P(k)$. Find the smallest number of steps Danica needs in order to find the polynomial Tatjana imagined.

2007 Putnam, 5

Let $ k$ be a positive integer. Prove that there exist polynomials $ P_0(n),P_1(n),\dots,P_{k\minus{}1}(n)$ (which may depend on $ k$) such that for any integer $ n,$ \[ \left\lfloor\frac{n}{k}\right\rfloor^k\equal{}P_0(n)\plus{}P_1(n)\left\lfloor\frac{n}{k}\right\rfloor\plus{} \cdots\plus{}P_{k\minus{}1}(n)\left\lfloor\frac{n}{k}\right\rfloor^{k\minus{}1}.\] ($ \lfloor a\rfloor$ means the largest integer $ \le a.$)

2003 Manhattan Mathematical Olympiad, 4

Let $p$ and $a$ be positive integer numbers having no common divisors except of $1$. Prove that $p$ is prime if and only if all the coefficients of the polynomial \[ F(x) = (x-a)^p - (x^p - a) \] are divisible by $p$.

2007 Princeton University Math Competition, 8

How many pairs of $2007$-digit numbers $\underline{a_1a_2}\cdots\underline{a_{2007}}$ and $\underline{b_1b_2}\cdots\underline{b_{2007}}$ are there such that $a_1b_1+a_2b_2+\cdots+a_{2007}b_{2007}$ is even? Express your answer as $a \** b^c + d \** e^f$ for integers $a$, $b$, $c$, $d$, $e$, and $f$ with $a \nmid b$ and $d \nmid e$.

VMEO III 2006 Shortlist, A9

Is there any polynomial $P(x)$ with degree $n$ such that $ \underbrace{P(...(P(x))...)}_{m\,\, times \,\, P}$ has all roots from $1,2,..., mn$ ?

1990 Romania Team Selection Test, 3

Find all polynomials $P(x)$ such that $2P(2x^2 -1) = P(x)^2 -1$ for all $x$.

2013 Kosovo National Mathematical Olympiad, 2

Find all integer $n$ such that $n-5$ divide $n^2+n-27$.

2008 Iran MO (3rd Round), 5

Find all polynomials $ f\in\mathbb Z[x]$ such that for each $ a,b,x\in\mathbb N$ \[ a\plus{}b\plus{}c|f(a)\plus{}f(b)\plus{}f(c)\]

2014 Contests, 3

Let $l$ be the tangent line at the point $P(s,\ t)$ on a circle $C:x^2+y^2=1$. Denote by $m$ the line passing through the point $(1,\ 0)$, parallel to $l$. Let the line $m$ intersects the circle $C$ at $P'$ other than the point $(1,\ 0)$. Note : if $m$ is the line $x=1$, then $P'$ is considered as $(1,\ 0)$. Call $T$ the operation such that the point $P'(s',\ t')$ is obtained from the point $P(s,\ t)$ on $C$. (1) Express $s',\ t'$ as the polynomials of $s$ and $t$ respectively. (2) Let $P_n$ be the point obtained by $n$ operations of $T$ for $P$. For $P\left(\frac{\sqrt{3}}{2},\ \frac{1}{2}\right)$, plot the points $P_1,\ P_2$ and $P_3$. (3) For a positive integer $n$, find the number of $P$ such that $P_n=P$.

2015 Saudi Arabia Pre-TST, 1.2

How many polynomials $P$ of integer coefficients and degree at most $4$ satisfy $0 \le P(x) < 72$ for all $x\in \{0, 1, 2, 3, 4\}$? Harvard-MIT Mathematics Tournament 2011

PEN Q Problems, 9

For non-negative integers $n$ and $k$, let $P_{n, k}(x)$ denote the rational function \[\frac{(x^{n}-1)(x^{n}-x) \cdots (x^{n}-x^{k-1})}{(x^{k}-1)(x^{k}-x) \cdots (x^{k}-x^{k-1})}.\] Show that $P_{n, k}(x)$ is actually a polynomial for all $n, k \in \mathbb{N}$.

2000 Romania National Olympiad, 4

Let $ f $ be a polynom of degree $ 3 $ and having rational coefficients. Prove that, if there exist two distinct nonzero rational numbers $ a,b $ and two roots $ x,y $ of $ f $ such that $ ax+by $ is rational, then all roots of $ f $ are rational.

2003 Poland - Second Round, 3

Let $W(x) = x^4 - 3x^3 + 5x^2 - 9x$ be a polynomial. Determine all pairs of different integers $a$, $b$ satisfying the equation $W(a) = W(b)$.

2018 India National Olympiad, 4

Find all polynomials with real coefficients $P(x)$ such that $P(x^2+x+1)$ divides $P(x^3-1)$.

1998 ITAMO, 5

Suppose $a_1,a_2,a_3,a_4$ are distinct integers and $P(x)$ is a polynomial with integer coefficients satisfying $P(a_1) = P(a_2) = P(a_3) = P(a_4) = 1$. (a) Prove that there is no integer $n$ such that $P(n) = 12$. (b) Do there exist such a polynomial and $a_n$ integer $n$ such that $P(n) = 1998$?

2006 Iran MO (3rd Round), 6

$P,Q,R$ are non-zero polynomials that for each $z\in\mathbb C$, $P(z)Q(\bar z)=R(z)$. a) If $P,Q,R\in\mathbb R[x]$, prove that $Q$ is constant polynomial. b) Is the above statement correct for $P,Q,R\in\mathbb C[x]$?

2014 France Team Selection Test, 3

Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.

2010 Junior Balkan MO, 1

The real numbers $a$, $b$, $c$, $d$ satisfy simultaneously the equations \[abc -d = 1, \ \ \ bcd - a = 2, \ \ \ cda- b = 3, \ \ \ dab - c = -6.\] Prove that $a + b + c + d \not = 0$.

2014 Iran MO (3rd Round), 3

Let $p,q\in \mathbb{R}[x]$ such that $p(z)q(\overline{z})$ is always a real number for every complex number $z$. Prove that $p(x)=kq(x)$ for some constant $k \in \mathbb{R}$ or $q(x)=0$. [i]Proposed by Mohammad Ahmadi[/i]

1952 Miklós Schweitzer, 4

Let $ K$ be a finite field of $ p$ elements, where $ p$ is a prime. For every polynomial $ f(x)\equal{}\sum_{i\equal{}0}^na_ix^i$ ($ \in K[x]$) put $ \overline{f(x)}\equal{}\sum_{i\equal{}0}^n a_ix^{p^i}$. Prove that for any pair of polynomials $ f(x),g(x)\in K[x]$, $ \overline{f(x)}|\overline{g(x)}$ if and only if $ f(x)|g(x)$.

2001 National Olympiad First Round, 16

The polynomial $P(x)=x^3+ax+1$ has exactly one solution on the interval $[-2,0)$ and has exactly one solution on the interval $(0,1]$ where $a$ is a real number. Which of the followings cannot be equal to $P(2)$? $ \textbf{(A)}\ \sqrt{17} \qquad\textbf{(B)}\ \sqrt[3]{30} \qquad\textbf{(C)}\ \sqrt{26}-1 \qquad\textbf{(D)}\ \sqrt {30} \qquad\textbf{(E)}\ \sqrt [3]{10} $