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

2024 Canada National Olympiad, 3

Let $N{}$ be the number of positive integers with $10$ digits $\overline{d_9d_8\cdots d_0}$ in base $10$ (where $0\le d_i\le9$ for all $i$ and $d_9>0$) such that the polynomial \[d_9x^9+d_8x^8+\cdots+d_1x+d_0\] is irreducible in $\Bbb Q$. Prove that $N$ is even. (A polynomial is irreducible in $\Bbb Q$ if it cannot be factored into two non-constant polynomials with rational coefficients.)

2004 Austrian-Polish Competition, 10

For each polynomial $Q(x)$ let $M(Q)$ be the set of non-negative integers $x$ with $0 < Q(x) < 2004.$ We consider polynomials $P_n(x)$ of the form \[P_n(x) = x^n + a_1 \cdot x^{n-1} + \ldots + a_{n-1} \cdot x + 1\] with coefficients $a_i \in \{ \pm1\}$ for $i = 1, 2, \ldots, n-1.$ For each $n = 3^k, k > 0$ determine: a.) $m_n$ which represents the maximum of elements in $M(P_n)$ for all such polynomials $P_n(x)$ b.) all polynomials $P_n(x)$ for which $|M(P_n)| = m_n.$

2008 Bulgaria Team Selection Test, 3

Let $G$ be a directed graph with infinitely many vertices. It is known that for each vertex the outdegree is greater than the indegree. Let $O$ be a fixed vertex of $G$. For an arbitrary positive number $n$, let $V_{n}$ be the number of vertices which can be reached from $O$ passing through at most $n$ edges ( $O$ counts). Find the smallest possible value of $V_{n}$.

1995 Austrian-Polish Competition, 4

Determine all polynomials $P(x)$ with real coefficients such that $P(x)^2 + P\left(\frac{1}{x}\right)^2= P(x^2)P\left(\frac{1}{x^2}\right)$ for all $x$.

2021 Tuymaada Olympiad, 8

In a sequence $P_n$ of quadratic trinomials each trinomial, starting with the third, is the sum of the two preceding trinomials. The first two trinomials do not have common roots. Is it possible that $P_n$ has an integral root for each $n$?

2010 All-Russian Olympiad Regional Round, 9.1

Three quadratic polynomials $f_1(x) = x^2+2a_1x+b_1$, $f_2(x) = x^2+2a_2x+b_2$, $f_3(x) = x^2 + 2a_3x + b_3$ are such that $a_1a_2a_3 = b_1b_2b_3 > 1$. Prove that at least one polynomial has two distinct roots.

2010 Baltic Way, 4

Find all polynomials $P(x)$ with real coefficients such that \[(x-2010)P(x+67)=xP(x) \] for every integer $x$.

1983 AMC 12/AHSME, 6

When \[x^5, \quad x+\frac{1}{x}\quad \text{and}\quad 1+\frac{2}{x} + \frac{3}{x^2}\] are multiplied, the product is a polynomial of degree $ \textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 6\qquad\textbf{(D)}\ 7\qquad\textbf{(E)}\ 8 $

2019 AMC 12/AHSME, 17

Let $s_k$ denote the sum of the $\textit{k}$th powers of the roots of the polynomial $x^3-5x^2+8x-13$. In particular, $s_0=3$, $s_1=5$, and $s_2=9$. Let $a$, $b$, and $c$ be real numbers such that $s_{k+1} = a \, s_k + b \, s_{k-1} + c \, s_{k-2}$ for $k = 2$, $3$, $....$ What is $a+b+c$? $\textbf{(A)} \; -6 \qquad \textbf{(B)} \; 0 \qquad \textbf{(C)} \; 6 \qquad \textbf{(D)} \; 10 \qquad \textbf{(E)} \; 26$

2017 AMC 10, 24

For certain real numbers $a$, $b$, and $c$, the polynomial \[g(x) = x^3 + ax^2 + x + 10\] has three distinct roots, and each root of $g(x)$ is also a root of the polynomial \[f(x) = x^4 + x^3 + bx^2 + 100x + c.\] What is $f(1)$? $\textbf{(A)}\ -9009 \qquad\textbf{(B)}\ -8008 \qquad\textbf{(C)}\ -7007 \qquad\textbf{(D)}\ -6006 \qquad\textbf{(E)}\ -5005$

2017 Purple Comet Problems, 6

For some constant $k$ the polynomial $p(x) = 3x^2 + kx + 117$ has the property that $p(1) = p(10)$. Evaluate $p(20)$.

1988 China Team Selection Test, 4

There is a broken computer such that only three primitive data $c$, $1$ and $-1$ are reserved. Only allowed operation may take $u$ and $v$ and output $u \cdot v + v.$ At the beginning, $u,v \in \{c, 1, -1\}.$ After then, it can also take the value of the previous step (only one step back) besides $\{c, 1, -1\}$. Prove that for any polynomial $P_{n}(x) = a_0 \cdot x^n + a_1 \cdot x^{n-1} + \ldots + a_n$ with integer coefficients, the value of $P_n(c)$ can be computed using this computer after only finite operation.

1970 Regional Competition For Advanced Students, 4

Find all real solutions of the following set of equations: \[72x^3+4xy^2=11y^3\] \[27x^5-45x^4y-10x^2y^3=\frac{-143}{32}y^5\]

2007 Germany Team Selection Test, 1

Let $ k \in \mathbb{N}$. A polynomial is called [i]$ k$-valid[/i] if all its coefficients are integers between 0 and $ k$ inclusively. (Here we don't consider 0 to be a natural number.) [b]a.)[/b] For $ n \in \mathbb{N}$ let $ a_n$ be the number of 5-valid polynomials $ p$ which satisfy $ p(3) = n.$ Prove that each natural number occurs in the sequence $ (a_n)_n$ at least once but only finitely often. [b]b.)[/b] For $ n \in \mathbb{N}$ let $ a_n$ be the number of 4-valid polynomials $ p$ which satisfy $ p(3) = n.$ Prove that each natural number occurs infinitely often in the sequence $ (a_n)_n$ .

1967 IMO Longlists, 7

Find all real solutions of the system of equations: \[\sum^n_{k=1} x^i_k = a^i\] for $i = 1,2, \ldots, n.$

2012 USA TSTST, 6

Positive real numbers $x, y, z$ satisfy $xyz+xy+yz+zx = x+y+z+1$. Prove that \[ \frac{1}{3} \left( \sqrt{\frac{1+x^2}{1+x}} + \sqrt{\frac{1+y^2}{1+y}} + \sqrt{\frac{1+z^2}{1+z}} \right) \le \left( \frac{x+y+z}{3} \right)^{5/8} . \]

2017 India IMO Training Camp, 1

Let $P_c(x)=x^4+ax^3+bx^2+cx+1$ and $Q_c(x)=x^4+cx^3+bx^2+ax+1$ with $a,b$ real numbers, $c \in \{1,2, \dots, 2017\}$ an integer and $a \ne c$. Define $A_c=\{\alpha | P_c(\alpha)=0\}$ and $B_c=\{\beta | P(\beta)=0\}$. (a) Find the number of unordered pairs of polynomials $P_c(x), Q_c(x)$ with exactly two common roots. (b) For any $1 \le c \le 2017$, find the sum of the elements of $A_c \Delta B_c$.

2003 Iran MO (3rd Round), 5

Let $p$ be an odd prime number. Let $S$ be the sum of all primitive roots modulo $p$. Show that if $p-1$ isn't squarefree (i. e., if there exist integers $k$ and $m$ with $k>1$ and $p-1=k^2m$), then $S \equiv 0 \mod p$. If not, then what is $S$ congruent to $\mod p$ ?

2005 District Olympiad, 4

Let $f:\mathbb{Q}\rightarrow \mathbb{Q}$ a monotonic bijective function. a)Prove that there exist a unique continuous function $F:\mathbb{R}\rightarrow \mathbb{R}$ such that $F(x)=f(x),\ (\forall)x\in \mathbb{Q}$. b)Give an example of a non-injective polynomial function $G:\mathbb{R}\rightarrow \mathbb{R}$ such that $G(\mathbb{Q})\subset \mathbb{Q}$ and it's restriction defined on $\mathbb{Q}$ is injective.

1994 Moldova Team Selection Test, 1

Let $P(X)=X^n+a_1X^{n-1}+\ldots+a_n$ be a plynomial with real roots $x_1. x_2,\ldots,x_n$. Denote $E_k=x_1^k+x_2^k+\ldots+x_n^k, \forall k\in\mathbb{N}$. There exists an $m\in\mathbb{N}$ such that $E_m=E_{m+1}=E_{m+2}=1$. Find $\max\{P(-2),P(2)\}$.

2012 International Zhautykov Olympiad, 3

Let $P, Q,R$ be three polynomials with real coefficients such that \[P(Q(x)) + P(R(x))=\text{constant}\] for all $x$. Prove that $P(x)=\text{constant}$ or $Q(x)+R(x)=\text{constant}$ for all $x$.

2004 Austrian-Polish Competition, 4

Determine all $n \in \mathbb{N}$ for which $n^{10} + n^5 + 1$ is prime.

2009 District Olympiad, 1

Let $A,B,C\in \mathcal{M}_3(\mathbb{R})$ such that $\det A=\det B=\det C$ and $\det(A+iB)=\det(C+iA)$. Prove that $\det (A+B)=\det (C+A)$.

1978 Polish MO Finals, 3

Prove that if $m$ is a natural number and $P,Q,R$ polynomials of degrees less than $m$ satisfying $$x^{2m}P(x,y)+y^{2m}Q(x,y) = (x+y)^{2m}R(x,y),$$ then each of the polynomials is zero.

1985 IMO Longlists, 92

Find a method by which one can compute the coefficients of $P(x) = x^6 + a_1x^5 + \cdots+ a_6$ from the roots of $P(x) = 0$ by performing not more than $15$ additions and $15$ multiplications.