Olympiad problems

2010 Tuymaada Olympiad, 3

Let $f(x) = ax^2+bx+c$ be a quadratic trinomial with $a$,$b$,$c$ reals such that any quadratic trinomial obtained by a permutation of $f$'s coefficients has an integer root (including $f$ itself). Show that $f(1)=0$.

2014 Poland - Second Round, 3.

Tags: algebra , polynomial

For each positive integer $n$, determine the smallest possible value of the polynomial $$ W_n(x)=x^{2n}+2x^{2n-1}+3x^{2n-2}+\ldots + (2n-1)x^2+2nx. $$

2017 IMO, 6

Tags: number theory , polynomial , equation , john berman more like jawnorz

An ordered pair $(x, y)$ of integers is a primitive point if the greatest common divisor of $x$ and $y$ is $1$. Given a finite set $S$ of primitive points, prove that there exist a positive integer $n$ and integers $a_0, a_1, \ldots , a_n$ such that, for each $(x, y)$ in $S$, we have: $$a_0x^n + a_1x^{n-1} y + a_2x^{n-2}y^2 + \cdots + a_{n-1}xy^{n-1} + a_ny^n = 1.$$ [i]Proposed by John Berman, United States[/i]

1995 Hungary-Israel Binational, 3

Tags: algebra , polynomial , inequalities

The polynomial $ f(x)\equal{}ax^2\plus{}bx\plus{}c$ has real coefficients and satisfies $ \left|f(x)\right|\le 1$ for all $ x\in [0, 1]$. Find the maximal value of $ |a|\plus{}|b|\plus{}|c|$.

1995 IMO Shortlist, 3

Tags: induction , algebra , polynomial , iteration , sequence

For an integer $x \geq 1$, let $p(x)$ be the least prime that does not divide $x$, and define $q(x)$ to be the product of all primes less than $p(x)$. In particular, $p(1) = 2.$ For $x$ having $p(x) = 2$, define $q(x) = 1$. Consider the sequence $x_0, x_1, x_2, \ldots$ defined by $x_0 = 1$ and \[ x_{n+1} = \frac{x_n p(x_n)}{q(x_n)} \] for $n \geq 0$. Find all $n$ such that $x_n = 1995$.

2011 Brazil Team Selection Test, 3

Tags: inequalities , algebra , polynomial

Let the real numbers $a,b,c,d$ satisfy the relations $a+b+c+d=6$ and $a^2+b^2+c^2+d^2=12.$ Prove that \[36 \leq 4 \left(a^3+b^3+c^3+d^3\right) - \left(a^4+b^4+c^4+d^4 \right) \leq 48.\] [i]Proposed by Nazar Serdyuk, Ukraine[/i]

2004 China Team Selection Test, 3

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

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.

2014 Online Math Open Problems, 27

Tags: function , modular arithmetic , algebra , polynomial , induction , quadratic

Let $p = 2^{16}+1$ be a prime, and let $S$ be the set of positive integers not divisible by $p$. Let $f: S \to \{0, 1, 2, ..., p-1\}$ be a function satisfying \[ f(x)f(y) \equiv f(xy)+f(xy^{p-2}) \pmod{p} \quad\text{and}\quad f(x+p) = f(x) \] for all $x,y \in S$. Let $N$ be the product of all possible nonzero values of $f(81)$. Find the remainder when when $N$ is divided by $p$. [i]Proposed by Yang Liu and Ryan Alweiss[/i]

1988 IMO Longlists, 39

Tags: polynomial , function , functional equation , algebra

[b]i.)[/b] Let $g(x) = x^5 + x^4 + x^3 + x^2 + x + 1.$ What is the remainder when the polynomial $g(x^{12}$ is divided by the polynomial $g(x)$? [b]ii.)[/b] If $k$ is a positive number and $f$ is a function such that, for every positive number $x, f(x^2 + 1 )^{\sqrt{x}} = k.$ Find the value of \[ f( \frac{9 +y^2}{y^2})^{\sqrt{ \frac{12}{y} }} \] for every positive number $y.$ [b]iii.)[/b] The function $f$ satisfies the functional equation $f(x) + f(y) = f(x+y) - x \cdot y - 1$ for every pair $x,y$ of real numbers. If $f(1) = 1,$ then find the numbers of integers $n,$ for which $f(n) = n.$

1963 Putnam, B1

Tags: polynomial

For what integers $a$ does $x^2 -x+a$ divide $x^{13}+ x +90$ ?

2010 IMO Shortlist, 3

Tags: algebra , polynomial , number theory , sum of squares

Find the smallest number $n$ such that there exist polynomials $f_1, f_2, \ldots , f_n$ with rational coefficients satisfying \[x^2+7 = f_1\left(x\right)^2 + f_2\left(x\right)^2 + \ldots + f_n\left(x\right)^2.\] [i]Proposed by Mariusz Skałba, Poland[/i]

2006 Germany Team Selection Test, 1

Tags: algebra , polynomial , number theory , composite number , prime number

Let $ a$, $ b$, $ c$, $ d$, $ e$, $ f$ be positive integers and let $ S = a+b+c+d+e+f$. Suppose that the number $ S$ divides $ abc+def$ and $ ab+bc+ca-de-ef-df$. Prove that $ S$ is composite.

2019 SG Originals, Q7

Tags: polynomial , number theory

Let $n$ be a natural number. A sequence is $k-$complete if it contains all residues modulo $n^k$. Let $Q(x)$ be a polynomial with integer coefficients. For $k\ge 2$, define $Q^k(x)=Q(Q^{k-1}(x))$, where $Q^1(x)=Q(x)$. Show that if $$0,Q(0),Q^2(0),Q^3(0),\ldots $$is $2018-$complete, then it is $k-$complete for all positive integers $k$. [i]Proposed by Ma Zhao Yu[/i]

2006 Flanders Math Olympiad, 1

Tags: trigonometry , polynomial , vieta , complex number , algebra

(a) Solve for $\theta\in\mathbb{R}$: $\cos(4\theta) = \cos(3\theta)$ (b) $\cos\left(\frac{2\pi}{7}\right)$, $\cos\left(\frac{4\pi}{7}\right)$ and $\cos\left(\frac{6\pi}{7}\right)$ are the roots of an equation of the form $ax^3+bx^2+cx+d = 0$ where $a, b, c, d$ are integers. Determine $a, b, c$ and $d$.

1974 Canada National Olympiad, 3

Tags: algebra , polynomial

Let \[f(x) = a_{0}+a_{1}x+a_{2}x^{2}+\cdots+a_{n}x^{n}\] be a polynomial with coefficients satisfying the conditions: \[0\le a_{i}\le a_{0},\quad i=1,2,\ldots,n.\] Let $b_{0},b_{1},\ldots,b_{2n}$ be the coefficients of the polynomial \begin{align*}\left(f(x)\right)^{2}&= \left(a_{0}+a_{1}x+a_{2}x^{2}+\cdots a_{n}x^{n}\right)\\ &= b_{0}+b_{1}x+b_{2}x^{2}+\cdots+b_{2n}x^{2n}. \end{align*} Prove that $b_{n+1}\le \frac{1}{2}\left(f(1)\right)^{2}$.

1993 Irish Math Olympiad, 2

Tags: polynomial , algebra

Let $ a_i,b_i$ $ (i\equal{}1,2,...,n)$ be real numbers such that the $ a_i$ are distinct, and suppose that there is a real number $ \alpha$ such that the product $ (a_i\plus{}b_1)(a_i\plus{}b_2)...(a_i\plus{}b_n)$ is equal to $ \alpha$ for each $ i$. Prove that there is a real number $ \beta$ such that $ (a_1\plus{}b_j)(a_2\plus{}b_j)...(a_n\plus{}b_j)$ is equal to $ \beta$ for each $ j$.

1963 Miklós Schweitzer, 4

Tags: polynomial , superior algebra , algebra

Call a polynomial positive reducible if it can be written as a product of two nonconstant polynomials with positive real coefficients. Let $ f(x)$ be a polynomial with $ f(0)\not\equal{}0$ such that $ f(x^n)$ is positive reducible for some natural number $ n$. Prove that $ f(x)$ itself is positive reducible. [L. Redei]

2016 India Regional Mathematical Olympiad, 8

Tags: algebra , polynomial , integer

At some integer points a polynomial with integer coefficients take values $1, 2$ and $3$. Prove that there exist not more than one integer at which the polynomial is equal to $5$.

2010 Iran MO (2nd Round), 4

Tags: polynomial , inequalities , algebra

Let $P(x)=ax^3+bx^2+cx+d$ be a polynomial with real coefficients such that \[\min\{d,b+d\}> \max\{|{c}|,|{a+c}|\}\] Prove that $P(x)$ do not have a real root in $[-1,1]$.

Kvant 2019, M2544

Tags: algebra , polynomial , inequalities

Let $P(x)=x^n +a_1x^{n-1}+a_2x^{n-2}+\ldots+a_{n-1}x+a_n$ be a polynomial of degree $n$ and $n$ real roots, all of them in the interval $(0,1)$. Prove that for all $k=\overline{1,n}$ the following inequality holds: \[(-1)^k(a_k+a_{k+1}+\ldots+a_n)>0.\] [i]Proposed by N. Safaei (Iran)[/i]

1995 AIME Problems, 2

Tags: quadratic , modular arithmetic , algebra , polynomial , vieta , logarithm , search

Find the last three digits of the product of the positive roots of \[ \sqrt{1995}x^{\log_{1995}x}=x^2. \]

2024 Brazil Cono Sur TST, 4

Tags: polynomial , translation

In the cartesian plane, consider the subset of all the points with both integer coordinates. Prove that it is possible to choose a finite non-empty subset $S$ of these points in such a way that any line $l$ that forms an angle of $90^{\circ},0^{\circ},135^{\circ}$ or $45^{\circ}$ with the positive horizontal semi-axis intersects $S$ at exactly $2024$ points or at no points.

2023 Spain Mathematical Olympiad, 4

Tags: algebra , polynomial

Let $x_1\leq x_2\leq x_3\leq x_4$ be real numbers. Prove that there exist polynomials of degree two $P(x)$ and $Q(x)$ with real coefficients such that $x_1$, $x_2$, $x_3$ and $x_4$ are the roots of $P(Q(x))$ if and only if $x_1+x_4=x_2+x_3$.

2019 Thailand TST, 3

Tags: polynomial , algebra

Determine all polynomials $P (x, y), Q(x, y)$ and $R(x, y)$ with real coefficients satisfying $$P (ux + vy, uy + vx) = Q(x, y)R(u, v)$$ for all real numbers $u, v, x$ and $y$.

2010 Putnam, B6

Tags: linear algebra , matrix , algebra , polynomial , induction , vector

Let $A$ be an $n\times n$ matrix of real numbers for some $n\ge 1.$ For each positive integer $k,$ let $A^{[k]}$ be the matrix obtained by raising each entry to the $k$th power. Show that if $A^k=A^{[k]}$ for $k=1,2,\cdots,n+1,$ then $A^k=A^{[k]}$ for all $k\ge 1.$