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

2013 Balkan MO Shortlist, A4

Find all positive integers $n$ such that there exist non-constant polynomials with integer coefficients $f_1(x),...,f_n(x)$ (not necessarily distinct) and $g(x)$ such that $$1 + \prod_{k=1}^{n}\left(f^2_k(x)-1\right)=(x^2+2013)^2g^2(x)$$

2012 NIMO Problems, 6

The polynomial $P(x) = x^3 + \sqrt{6} x^2 - \sqrt{2} x - \sqrt{3}$ has three distinct real roots. Compute the sum of all $0 \le \theta < 360$ such that $P(\tan \theta^\circ) = 0$. [i]Proposed by Lewis Chen[/i]

1975 All Soviet Union Mathematical Olympiad, 217

Given a polynomial $P(x)$ with a) natural coefficients; b) integer coefficients; Let us denote with $a_n$ the sum of the digits of $P(n)$ value. Prove that there is a number encountered in the sequence $a_1, a_2, ... , a_n, ...$ infinite times.

2002 Hungary-Israel Binational, 3

Let $p(x)$ be a polynomial with rational coefficients, of degree at least $2$. Suppose that a sequence $(r_{n})$ of rational numbers satisfies $r_{n}= p(r_{n+1})$ for every $n\geq 1$. Prove that the sequence $(r_{n})$ is periodic.

2004 China Team Selection Test, 3

Given arbitrary positive integer $ a$ larger than $ 1$, show that for any positive integer $ n$, there always exists a n-degree integral coefficient polynomial $ p(x)$, such that $ p(0)$, $ p(1)$, $ \cdots$, $ p(n)$ are pairwise distinct positive integers, and all have the form of $ 2a^k\plus{}3$, where $ k$ is also an integer.

1979 IMO Longlists, 38

Prove the following statement: If a polynomial $f(x)$ with real coefficients takes only nonnegative values, then there exists a positive integer $n$ and polynomials $g_1(x), g_2(x),\cdots, g_n(x)$ such that \[f(x) = g_1(x)^2 + g_2(x)^2 +\cdots+ g_n(x)^2\]

1975 Vietnam National Olympiad, 2

Solve this equation $\frac{y^{3}+m^{3}}{\left ( y+m \right )^{3}}+\frac{y^{3}+n^{3}}{\left ( y+n \right )^{3}}+\frac{y^{3}+p^{3}}{\left ( y+p \right )^{3}}-\frac{3}{2}+\frac{3}{2}.\frac{y-m}{y+m}.\frac{y-n}{y+n}.\frac{y-p}{y+p}=0$

2003 Italy TST, 3

Let $p(x)$ be a polynomial with integer coefficients and let $n$ be an integer. Suppose that there is a positive integer $k$ for which $f^{(k)}(n) = n$, where $f^{(k)}(x)$ is the polynomial obtained as the composition of $k$ polynomials $f$. Prove that $p(p(n)) = n$.

2003 India IMO Training Camp, 7

$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$

2005 Iran MO (3rd Round), 4

a) Year 1872 Texas 3 gold miners found a peice of gold. They have a coin that with possibility of $\frac 12$ it will come each side, and they want to give the piece of gold to one of themselves depending on how the coin will come. Design a fair method (It means that each of the 3 miners will win the piece of gold with possibility of $\frac 13$) for the miners. b) Year 2005, faculty of Mathematics, Sharif university of Technolgy Suppose $0<\alpha<1$ and we want to find a way for people name $A$ and $B$ that the possibity of winning of $A$ is $\alpha$. Is it possible to find this way? c) Year 2005 Ahvaz, Takhti Stadium Two soccer teams have a contest. And we want to choose each player's side with the coin, But we don't know that our coin is fair or not. Find a way to find that coin is fair or not? d) Year 2005,summer In the National mathematical Oympiad in Iran. Each student has a coin and must find a way that the possibility of coin being TAIL is $\alpha$ or no. Find a way for the student.

2013 Costa Rica - Final Round, 5

Determine the number of polynomials of degree $5$ with different coefficients in the set $\{1, 2, 3, 4, 5, 6, 7, 8\}$ such that they are divisible by $x^2-x + 1$. Justify your answer.

1992 IMO Longlists, 51

Let $ f, g$ and $ a$ be polynomials with real coefficients, $ f$ and $ g$ in one variable and $ a$ in two variables. Suppose \[ f(x) \minus{} f(y) \equal{} a(x, y)(g(x) \minus{} g(y)) \forall x,y \in \mathbb{R}\] Prove that there exists a polynomial $ h$ with $ f(x) \equal{} h(g(x)) \text{ } \forall x \in \mathbb{R}.$

2023 Indonesia TST, N

Let $P(x)$ and $Q(x)$ be polynomials of degree $p$ and $q$ respectively such that every coefficient is $1$ or $2023$. If $P(x)$ divides $Q(x)$, prove that $p+1$ divides $q+1$.

2016 Azerbaijan Team Selection Test, 2

Find all polynomials $P(x)$ with real coefficents, such that for all $x,y,z$ satisfying $x+y+z=0$, the equation below is true: \[P(x+y)^3+P(y+z)^3+P(z+x)^3=3P((x+y)(y+z)(z+x))\]

1922 Eotvos Mathematical Competition, 2

Prove that $$x^4 + 2x^2 + 2x + 2$$ is not the product of two polynomials $x^2 + ax + b$ and $x^2 + cx + d$ in which $a$, $b$, $c$, $d$ are integers.

1995 Taiwan National Olympiad, 1

Let $P(x)=a_{0}+a_{1}x+...+a_{n}x^{n}\in\mathbb{C}[x]$ , where $a_{n}=1$. The roots of $P(x)$ are $b_{1},b_{2},...,b_{n}$, where $|b_{1}|,|b_{2}|,...,|b_{j}|>1$ and $|b_{j+1}|,...,|b_{n}|\leq 1$. Prove that $\prod_{i=1}^{j}|b_{i}|\leq\sqrt{|a_{0}|^{2}+|a_{1}|^{2}+...+|a_{n}|^{2}}$.

2018 Singapore MO Open, 5

Consider a polynomial $P(x,y,z)$ in three variables with integer coefficients such that for any real numbers $a,b,c,$ $$P(a,b,c)=0 \Leftrightarrow a=b=c.$$ Find the largest integer $r$ such that for all such polynomials $P(x,y,z)$ and integers $m,n,$ $$m^r\mid P(n,n+m,n+2m).$$ [i]Proposed by Ma Zhao Yu

2010 AIME Problems, 10

Find the number of second-degree polynomials $ f(x)$ with integer coefficients and integer zeros for which $ f(0)\equal{}2010$.

1996 Niels Henrik Abels Math Contest (Norwegian Math Olympiad) Round 2, 7

If 1,2, and 3 are solutions to the equation $ x^4 \plus{} ax^2 \plus{} bx \plus{} c \equal{} 0,$ then $ a\plus{}c$ equals A. -12 B. 24 C. 35 D. -61 E. -63

1986 Polish MO Finals, 4

Find all $n$ such that there is a real polynomial $f(x)$ of degree $n$ such that $f(x) \ge f'(x)$ for all real $x$.

2016 Federal Competition For Advanced Students, P2, 4

Let $a,b,c\ge-1$ be real numbers with $a^3+b^3+c^3=1$. Prove that $a+b+c+a^2+b^2+c^2\le4$, and determine the cases of equality. (Proposed by Karl Czakler)

2020 Serbia National Math Olympiad, 1

Find all monic polynomials $P(x)$ such that the polynomial $P(x)^2-1$ is divisible by the polynomial $P(x+1)$.

2014 ELMO Shortlist, 7

Find all positive integers $n$ with $n \ge 2$ such that the polynomial \[ P(a_1, a_2, ..., a_n) = a_1^n+a_2^n + ... + a_n^n - n a_1 a_2 ... a_n \] in the $n$ variables $a_1$, $a_2$, $\dots$, $a_n$ is irreducible over the real numbers, i.e. it cannot be factored as the product of two nonconstant polynomials with real coefficients. [i]Proposed by Yang Liu[/i]

2004 USAMTS Problems, 3

Find, with proof, a polynomial $f(x,y,z)$ in three variables, with integer coefficients, such that for all $a,b,c$ the sign of $f(a,b,c)$ (that is, positive, negative, or zero) is the same as the sign of $a+b\sqrt[3]{2}+c\sqrt[3]{4}$.

1970 Putnam, B2

The time-varying temperature of a certain body is given by a polynomial in the time of degree at most three. Show that the average temperature of the body between $9$ am and $3$ pm can always be found by taking the average of the temperatures at two fixed times, which are independent of the polynomial. Also, show that these two times are $10\colon \! 16$ am and $1\colon \!44$ pm to the nearest minute.