Olympiad problems

2008 VJIMC, Problem 1

Find all complex roots (with multiplicities) of the polynomial $$p(x)=\sum_{n=1}^{2008}(1004-|1004-n|)x^n.$$

1979 Romania Team Selection Tests, 4.

Tags: polynomial , quadratic , inequalities , algebra

Give an example of a second degree polynomial $P\in \mathbb{R}[x]$ such that \[\forall x\in \mathbb{R}\text{ with } |x|\leqslant 1: \; \left|P(x)+\frac{1}{x-4}\right| \leqslant 0.01.\] Are there linear polynomials with this property? [i]Octavian Stănășilă[/i]

2009 Princeton University Math Competition, 3

Tags: algebra , polynomial , rational root theorem

Find the root that the following three polynomials have in common: \begin{align*} & x^3+41x^2-49x-2009 \\ & x^3 + 5x^2-49x-245 \\ & x^3 + 39x^2 - 117x - 1435\end{align*}

2019 Estonia Team Selection Test, 4

Tags: algebra , polynomial

Let us call a real number $r$ [i]interesting[/i], if $r = a + b\sqrt2$ for some integers a and b. Let $A(x)$ and $B(x)$ be polynomial functions with interesting coefficients for which the constant term of $B(x)$ is $1$, and $Q(x)$ be a polynomial function with real coefficients such that $A(x) = B(x) \cdot Q(x)$. Prove that the coefficients of $Q(x)$ are interesting.

2007 IMC, 2

Tags: modular arithmetic , algebra , polynomial

Let $ x$, $ y$ and $ z$ be integers such that $ S = x^{4}+y^{4}+z^{4}$ is divisible by 29. Show that $ S$ is divisible by $ 29^{4}$.

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]

2020 South East Mathematical Olympiad, 3

Tags: algebra , polynomial

Given a polynomial $f(x)=x^{2020}+\sum_{i=0}^{2019} c_ix^i$, where $c_i \in \{ -1,0,1 \}$. Denote $N$ the number of positive integer roots of $f(x)=0$ (counting multiplicity). If $f(x)=0$ has no negative integer roots, find the maximum of $N$.

2013 Romania Team Selection Test, 4

Tags: analytic geometry , algebra , polynomial , combinatorics

Let $k$ be a positive integer larger than $1$. Build an infinite set $\mathcal{A}$ of subsets of $\mathbb{N}$ having the following properties: [b](a)[/b] any $k$ distinct sets of $\mathcal{A}$ have exactly one common element; [b](b)[/b] any $k+1$ distinct sets of $\mathcal{A}$ have void intersection.

1990 Baltic Way, 11

Tags: algebra , polynomial

Prove that the modulus of an integer root of a polynomial with integer coefficients cannot exceed the maximum of the moduli of the coefficients.

2000 Turkey MO (2nd round), 1

Tags: algebra , polynomial , geometric series , number theory

Let $p$ be a prime number. $T(x)$ is a polynomial with integer coefficients and degree from the set $\{0,1,...,p-1\}$ and such that $T(n) \equiv T(m) (mod p)$ for some integers m and n implies that $ m \equiv n (mod p)$. Determine the maximum possible value of degree of $T(x)$

1978 IMO Longlists, 25

Tags: polynomial , vieta , algebra

Consider a polynomial $P(x) = ax^2 + bx + c$ with $a > 0$ that has two real roots $x_1, x_2$. Prove that the absolute values of both roots are less than or equal to $1$ if and only if $a + b + c \ge 0, a -b + c \ge 0$, and $a - c \ge 0$.

2007 Iran MO (3rd Round), 5

Tags: polynomial , geometry , function , algebra

Prove that for two non-zero polynomials $ f(x,y),g(x,y)$ with real coefficients the system: \[ \left\{\begin{array}{c}f(x,y)\equal{}0\\ g(x,y)\equal{}0\end{array}\right.\] has finitely many solutions in $ \mathbb C^{2}$ if and only if $ f(x,y)$ and $ g(x,y)$ are coprime.

1974 Putnam, A6

Tags: algebra , polynomial

Given $n$, let $k = k(n)$ be the minimal degree of any monic integral polynomial $$f(x)=x^k + a_{k-1}x^{k-1}+\ldots+a_0$$ such that the value of $f(x)$ is exactly divisible by $n$ for every integer $x.$ Find the relationship between $n$ and $k(n)$. In particular, find the value of $k(n)$ corresponding to $n = 10^6.$

2009 Indonesia TST, 1

Tags: algebra , polynomial , search , combinatorics

Let $ n \ge 1$ and $ k \ge 3$ be integers. A circle is divided into $ n$ sectors $ a_1,a_2,\dots,a_n$. We will color the $ n$ sectors with $ k$ different colors such that $ a_i$ and $ a_{i \plus{} 1}$ have different color for each $ i \equal{} 1,2,\dots,n$ where $ a_{n \plus{} 1}\equal{}a_1$. Find the number of ways to do such coloring.

2020 IMO Shortlist, A5

Tags: algebra , polynomial , algorithm , lagrange s interpolation

A magician intends to perform the following trick. She announces a positive integer $n$, along with $2n$ real numbers $x_1 < \dots < x_{2n}$, to the audience. A member of the audience then secretly chooses a polynomial $P(x)$ of degree $n$ with real coefficients, computes the $2n$ values $P(x_1), \dots , P(x_{2n})$, and writes down these $2n$ values on the blackboard in non-decreasing order. After that the magician announces the secret polynomial to the audience. Can the magician find a strategy to perform such a trick?

2011 IMC, 2

Tags: matrix , algebra , polynomial , function , linear algebra

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]

2012 ELMO Shortlist, 9

Tags: algebra , polynomial , function , induction , inequalities

Let $a,b,c$ be distinct positive real numbers, and let $k$ be a positive integer greater than $3$. Show that \[\left\lvert\frac{a^{k+1}(b-c)+b^{k+1}(c-a)+c^{k+1}(a-b)}{a^k(b-c)+b^k(c-a)+c^k(a-b)}\right\rvert\ge \frac{k+1}{3(k-1)}(a+b+c)\] and \[\left\lvert\frac{a^{k+2}(b-c)+b^{k+2}(c-a)+c^{k+2}(a-b)}{a^k(b-c)+b^k(c-a)+c^k(a-b)}\right\rvert\ge \frac{(k+1)(k+2)}{3k(k-1)}(a^2+b^2+c^2).\] [i]Calvin Deng.[/i]

2001 Mediterranean Mathematics Olympiad, 2

Tags: polynomial , quadratic , algebra

Find all integers $n$ for which the polynomial $p(x) = x^5 -nx -n -2$ can be represented as a product of two non-constant polynomials with integer coefficients.

2014 Contests, 3

Tags: algebra , polynomial , real analysis

Let $n$ be a positive integer. Show that there are positive real numbers $a_0, a_1, \dots, a_n$ such that for each choice of signs the polynomial $$\pm a_nx^n\pm a_{n-1}x^{n-1} \pm \dots \pm a_1x \pm a_0$$ has $n$ distinct real roots. (Proposed by Stephan Neupert, TUM, München)

2022 Indonesia TST, A

Tags: algebra , polynomial , inequalities

Given a monic quadratic polynomial $Q(x)$, define \[ Q_n (x) = \underbrace{Q(Q(\cdots(Q(x))\cdots))}_{\text{compose $n$ times}} \] for every natural number $n$. Let $a_n$ be the minimum value of the polynomial $Q_n(x)$ for every natural number $n$. It is known that $a_n > 0$ for every natural number $n$ and there exists some natural number $k$ such that $a_k \neq a_{k+1}$. (a) Prove that $a_n < a_{n+1}$ for every natural number $n$. (b) Is it possible to satisfy $a_n < 2021$ for every natural number $n$? [i]Proposed by Fajar Yuliawan[/i]

2022 Thailand Mathematical Olympiad, 4

Tags: polynomial , number theory , algebra

Find all positive integers $n$ such that there exists a monic polynomial $P(x)$ of degree $n$ with integers coefficients satisfying $$P(a)P(b)\neq P(c)$$ for all integers $a,b,c$.

2013 Tuymaada Olympiad, 5

Tags: polynomial , quadratic , linear algebra , matrix , parameterization , algebra

Prove that every polynomial of fourth degree can be represented in the form $P(Q(x))+R(S(x))$, where $P,Q,R,S$ are quadratic trinomials. [i]A. Golovanov[/i] [b]EDIT.[/b] It is confirmed that assuming the coefficients to be [b]real[/b], while solving the problem, earned a maximum score.

2007 Middle European Mathematical Olympiad, 4

Tags: modular arithmetic , algebra , polynomial , divisibility tests , number theory

Find all positive integers $ k$ with the following property: There exists an integer $ a$ so that $ (a\plus{}k)^{3}\minus{}a^{3}$ is a multiple of $ 2007$.

2022 Benelux, 1

Tags: algebra , polynomial

Let $n\geqslant 0$ be an integer, and let $a_0,a_1,\dots,a_n$ be real numbers. Show that there exists $k\in\{0,1,\dots,n\}$ such that $$a_0+a_1x+a_2x^2+\cdots+a_nx^n\leqslant a_0+a_1+\cdots+a_k$$ for all real numbers $x\in[0,1]$.

1968 IMO Shortlist, 16

Tags: algebra , polynomial , calculus , number theory , divisibility

A polynomial $p(x) = a_0x^k + a_1x^{k-1} + \cdots + a_k$ with integer coefficients is said to be divisible by an integer $m$ if $p(x)$ is divisible by m for all integers $x$. Prove that if $p(x)$ is divisible by $m$, then $k!a_0$ is also divisible by $m$. Also prove that if $a_0, k,m$ are non-negative integers for which $k!a_0$ is divisible by $m$, there exists a polynomial $p(x) = a_0x^k+\cdots+ a_k$ divisible by $m.$