Olympiad problems

2020 Israel Olympic Revenge, P3

For each positive integer $n$, define $f(n)$ to be the least positive integer for which the following holds: For any partition of $\{1,2,\dots, n\}$ into $k>1$ disjoint subsets $A_1, \dots, A_k$, [u]all of the same size[/u], let $P_i(x)=\prod_{a\in A_i}(x-a)$. Then there exist $i\neq j$ for which \[\deg(P_i(x)-P_j(x))\geq \frac{n}{k}-f(n)\] a) Prove that there is a constant $c$ so that $f(n)\le c\cdot \sqrt{n}$ for all $n$. b) Prove that for infinitely many $n$, one has $f(n)\ge \ln(n)$.

2021 Korea Winter Program Practice Test, 8

Tags: number theory , algebra , polynomial

$P$ is an monic integer coefficient polynomial which has no integer roots. deg$P=n$ and define $A$ $:=${$v_2(P(m))|m\in Z, v_2(P(m)) \ge 1$}. If $|A|=n$, show that all of the elements of $A$ is smaller than $\frac{3}{2}n^2$.

1989 Balkan MO, 2

Tags: absolute value , combinatorial geometry , gauss , derivative , polynomial , algebra , calculus

Let $\overline{a_{n}a_{n-1}\ldots a_{1}a_{0}}$ be the decimal representation of a prime positive integer such that $n>1$ and $a_{n}>1$. Prove that the polynomial $P(x)=a_{n}x^{n}+\ldots +a_{1}x+a_{0}$ cannot be written as a product of two non-constant integer polynomials.

2013 Thailand Mathematical Olympiad, 4

Tags: conic , algebra , polynomial

Determine all monic polynomials $p(x)$ having real coefficients and satisfying the following two conditions: $\bullet$ $p(x)$ is nonconstant, and all of its roots are distinct reals $\bullet$ If $a $and $b$ are roots of $p(x)$ then $a + b + ab$ is also a root of $p(x)$.

1996 IMO Shortlist, 5

Tags: algebra , function , maximization , polynomial , inequalities

Let $ P(x)$ be the real polynomial function, $ P(x) \equal{} ax^3 \plus{} bx^2 \plus{} cx \plus{} d.$ Prove that if $ |P(x)| \leq 1$ for all $ x$ such that $ |x| \leq 1,$ then \[ |a| \plus{} |b| \plus{} |c| \plus{} |d| \leq 7.\]

2020 Iran MO (3rd Round), 4

Tags: equation , algebra , polynomial

We call a polynomial $P(x)$ intresting if there are $1398$ distinct positive integers $n_1,...,n_{1398}$ such that $$P(x)=\sum_{}{x^{n_i}}+1$$ Does there exist infinitly many polynomials $P_1(x),P_2(x),...$ such that for each distinct $i,j$ the polynomial $P_i(x)P_j(x)$ is interesting.

2020 ELMO Problems, P5

Tags: polynomial , number theory , algebra

Let $m$ and $n$ be positive integers. Find the smallest positive integer $s$ for which there exists an $m \times n$ rectangular array of positive integers such that [list] [*]each row contains $n$ distinct consecutive integers in some order, [*]each column contains $m$ distinct consecutive integers in some order, and [*]each entry is less than or equal to $s$. [/list] [i]Proposed by Ankan Bhattacharya.[/i]

1985 Putnam, B1

Tags: polynomial , algebra

Let $k$ be the smallest positive integer for which there exist distinct integers $m_{1}, m_{2}, m_{3}, m_{4}, m_{5}$ such that the polynomial $$p(x)=\left(x-m_{1}\right)\left(x-m_{2}\right)\left(x-m_{3}\right)\left(x-m_{4}\right)\left(x-m_{5}\right)$$ has exactly $k$ nonzero coefficients. Find, with proof, a set of integers $m_{1}, m_{2}, m_{3}, m_{4}, m_{5}$ for which this minimum $k$ is achieved.

1998 Singapore Team Selection Test, 3

Tags: integer polynomial , algebra , polynomial

Suppose $f(x)$ is a polynomial with integer coefficients satisfying the condition $0 \le f(c) \le 1997$ for each $c \in \{0, 1, ..., 1998\}$. Is is true that $f(0) = f(1) = ... = f(1998)$? (variation of [url=https://artofproblemsolving.com/community/c6h49788p315649]1997 IMO Shortlist p12[/url])

2010 Benelux, 2

Tags: polynomial , functional equation , algebra

Find all polynomials $p(x)$ with real coeffcients such that \[p(a + b - 2c) + p(b + c - 2a) + p(c + a - 2b) = 3p(a - b) + 3p(b - c) + 3p(c - a)\] for all $a, b, c\in\mathbb{R}$. [i](2nd Benelux Mathematical Olympiad 2010, Problem 2)[/i]

2015 Balkan MO Shortlist, A6

Tags: polynomial , algebra

For a polynomials $ P\in \mathbb{R}[x]$, denote $f(P)=n$ if $n$ is the smallest positive integer for which is valid $$(\forall x\in \mathbb{R})(\underbrace{P(P(\ldots P}_{n}(x))\ldots )>0),$$ and $f(P)=0$ if such n doeas not exist. Exists polyomial $P\in \mathbb{R}[x]$ of degree $2014^{2015}$ such that $f(P)=2015$? (Serbia)

2004 Romania National Olympiad, 2

Tags: superior algebra , algebra , polynomial , function

Let $f \in \mathbb Z[X]$. For an $n \in \mathbb N$, $n \geq 2$, we define $f_n : \mathbb Z / n \mathbb Z \to \mathbb Z / n \mathbb Z$ through $f_n \left( \widehat x \right) = \widehat{f \left( x \right)}$, for all $x \in \mathbb Z$. (a) Prove that $f_n$ is well defined. (b) Find all polynomials $f \in \mathbb Z[X]$ such that for all $n \in \mathbb N$, $n \geq 2$, the function $f_n$ is surjective. [i]Bogdan Enescu[/i]

1964 Polish MO Finals, 4

Tags: algebra , polynomial

Prove that if the roots of the equation $ x^3 + ax^2 + bx + c = 0 $, with real coefficients, are real, then the roots of the equation $ 3x^2 + 2ax + b = 0 $ are also real.

2021 Mediterranean Mathematics Olympiad, 1

Tags: algebra , integer polynomial , polynomial

Determine the smallest positive integer $M$ with the following property: For every choice of integers $a,b,c$, there exists a polynomial $P(x)$ with integer coefficients so that $P(1)=aM$ and $P(2)=bM$ and $P(4)=cM$. [i]Proposed by Gerhard Woeginger, Austria[/i]

2014 Taiwan TST Round 1, 2

Tags: induction , strong induction , function , modular arithmetic , number theory , algebra , polynomial

For a fixed integer $k$, determine all polynomials $f(x)$ with integer coefficients such that $f(n)$ divides $(n!)^k$ for every positive integer $n$.

2000 Switzerland Team Selection Test, 14

Tags: algebra , polynomial

The polynomial $P$ of degree $n$ satisfies $P(k) = \frac{k}{k +1}$ for $k = 0,1,2,...,n$. Find $P(n+1)$.

2010 Germany Team Selection Test, 1

Tags: algebra , polynomial

Let $a \in \mathbb{R}.$ Show that for $n \geq 2$ every non-real root $z$ of polynomial $X^{n+1}-X^2+aX+1$ satisfies the condition $|z| > \frac{1}{\sqrt[n]{n}}.$

2007 Harvard-MIT Mathematics Tournament, 20

Tags: algebra , vieta , polynomial

For $a$ a positive real number, let $x_1$, $x_2$, $x_3$ be the roots of the equation $x^3-ax^2+ax-a=0$. Determine the smallest possible value of $x_1^3+x_2^3+x_3^3-3x_1x_2x_3$.

2007 Iran Team Selection Test, 1

Tags: polynomial , inequalities , algebra

Find all polynomials of degree 3, such that for each $x,y\geq 0$: \[p(x+y)\geq p(x)+p(y)\]

1983 Bulgaria National Olympiad, Problem 5

Tags: solve equation , complex number , polynomial , algebra

Can the polynomials $x^{5}-x-1$ and $x^{2}+ax+b$ , where $a,b\in Q$, have common complex roots?

2019 Spain Mathematical Olympiad, 3

Tags: algebra , polynomial

The real numbers $a$, $b$ and $c$ verify that the polynomial $p(x)=x^4+ax^3+bx^2+ax+c$ has exactly three distinct real roots; these roots are equal to $\tan y$, $\tan 2y$ and $\tan 3y$, for some real number $y$. Find all possible values of $y$, $0\leq y < \pi$.

2009 IMO Shortlist, 5

Tags: number theory , permutation , algebra , polynomial

Let $P(x)$ be a non-constant polynomial with integer coefficients. Prove that there is no function $T$ from the set of integers into the set of integers such that the number of integers $x$ with $T^n(x)=x$ is equal to $P(n)$ for every $n\geq 1$, where $T^n$ denotes the $n$-fold application of $T$. [i]Proposed by Jozsef Pelikan, Hungary[/i]

1995 Kurschak Competition, 2

Tags: polynomial , algebra

Consider a polynomial in $n$ variables with real coefficients. We know that if every variable is $\pm1$, the value of the polynomial is positive, or negative if the number of $-1$'s is even, or odd, respectively. Prove that the degree of this polynomial is at least $n$.

2019 Thailand TST, 3

Tags: polynomial , algebra

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$.

2023 CMI B.Sc. Entrance Exam, 3

Tags: polynomial , algebra

Consider the polynomial $p(x) = x^4 + ax^3 + bx^2 + cx + d$. It is given that $p(x)$ has its only root at $x = r$ i.e $p(r) = 0$. $\textbf{(a)}$ Show that if $a, b, c, d$ are rational then $r$ is rational. $\textbf{(b)}$ Show that if $a, b, c, d$ are integers then $r$ is an integer. [hide=Hint](Hint: Consider the roots of $p'(x)$ )[/hide]