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

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.

2011 USA Team Selection Test, 3

Let $p$ be a prime. We say that a sequence of integers $\{z_n\}_{n=0}^\infty$ is a [i]$p$-pod[/i] if for each $e \geq 0$, there is an $N \geq 0$ such that whenever $m \geq N$, $p^e$ divides the sum \[\sum_{k=0}^m (-1)^k {m \choose k} z_k.\] Prove that if both sequences $\{x_n\}_{n=0}^\infty$ and $\{y_n\}_{n=0}^\infty$ are $p$-pods, then the sequence $\{x_ny_n\}_{n=0}^\infty$ is a $p$-pod.

2020/2021 Tournament of Towns, P2

Baron Munchausen presented a new theorem: if a polynomial $x^{n} - ax^{n-1} + bx^{n-2}+ \dots$ has $n$ positive integer roots then there exist $a$ lines in the plane such that they have exactly $b$ intersection points. Is the baron’s theorem true?

2017 China Team Selection Test, 4

Show that there exists a degree $58$ monic polynomial $$P(x) = x^{58} + a_1x^{57} + \cdots + a_{58}$$ such that $P(x)$ has exactly $29$ positive real roots and $29$ negative real roots and that $\log_{2017} |a_i|$ is a positive integer for all $1 \leq i \leq 58$.

2018 Romania National Olympiad, 4

For any $k \in \mathbb{Z},$ define $$F_k=X^4+2(1-k)X^2+(1+k)^2.$$ Find all values $k \in \mathbb{Z}$ such that $F_k$ is irreducible over $\mathbb{Z}$ and reducible over $\mathbb{Z}_p,$ for any prime $p.$ [i]Marius Vladoiu[/i]

2016 Balkan MO, 3

Find all monic polynomials $f$ with integer coefficients satisfying the following condition: there exists a positive integer $N$ such that $p$ divides $2(f(p)!)+1$ for every prime $p>N$ for which $f(p)$ is a positive integer. [i]Note: A monic polynomial has a leading coefficient equal to 1.[/i] [i](Greece - Panagiotis Lolas and Silouanos Brazitikos)[/i]

2007 ISI B.Math Entrance Exam, 5

Let $P(X)$ be a polynomial with integer coefficients of degree $d>0$. $(a)$ If $\alpha$ and $\beta$ are two integers such that $P(\alpha)=1$ and $P(\beta)=-1$ , then prove that $|\beta - \alpha|$ divides $2$. $(b)$ Prove that the number of distinct integer roots of $P^2(x)-1$ is atmost $d+2$.

2019 IFYM, Sozopol, 4

Is it true that for $\forall$ prime number $p$, there exist non-constant polynomials $P$ and $Q$ with $P,Q\in \mathbb{Z} [x]$ for which the remainder modulo $p$ of the coefficient in front of $x^n$ in the product $PQ$ is 1 for $n=0$ and $n=4$; $p-2$ for $n=2$ and is 0 for all other $n\geq 0$?

2004 VJIMC, Problem 4

Let $f:\mathbb R\to\mathbb R$ be an infinitely differentiable function. Assume that for every $x\in\mathbb R$ there is an $n\in\mathbb N$ (depending on $x$) such that $$f^{(n)}(x)=0.$$Prove that $f$ is a polynomial.

2019 Singapore MO Open, 4

Let $p \equiv 2 \pmod 3$ be a prime, $k$ a positive integer and $P(x) = 3x^{\frac{2p-1}{3}}+3x^{\frac{p+1}{3}}+x+1$. For any integer $n$, let $R(n)$ denote the remainder when $n$ is divided by $p$ and let $S = \{0,1,\cdots,p-1\}$. At each step, you can either (a) replaced every element $i$ of $S$ with $R(P(i))$ or (b) replaced every element $i$ of $S$ with $R(i^k)$. Determine all $k$ such that there exists a finite sequence of steps that reduces $S$ to $\{0\}$. [i]Proposed by fattypiggy123[/i]

2021 China Second Round Olympiad, Problem 11

The function $f(x) = x^2+ax+b$ has two distinct zeros. If $f(x^2+2x-1)=0$ has four distinct zeros $x_1<x_2<x_3<x_4$ that form an arithmetic sequence, compute the range of $a-b$. [i](Source: China National High School Mathematics League 2021, Zhejiang Province, Problem 11)[/i]

2012 Pre - Vietnam Mathematical Olympiad, 2

Let $(a_n)$ defined by: $a_0=1, \; a_1=p, \; a_2=p(p-1)$, $a_{n+3}=pa_{n+2}-pa_{n+1}+a_n, \; \forall n \in \mathbb{N}$. Knowing that (i) $a_n>0, \; \forall n \in \mathbb{N}$. (ii) $a_ma_n>a_{m+1}a_{n-1}, \; \forall m \ge n \ge 0$. Prove that $|p-1| \ge 2$.

2008 Indonesia TST, 1

A polynomial $P(x) = 1 + x^2 + x^5 + x^{n_1} + ...+ x^{n_s} + x^{2008}$ with $n_1, ..., n_s$ are positive integers and $5 < n_1 < ... <n_s < 2008$ are given. Prove that if $P(x)$ has at least a real root, then the root is not greater than $\frac{1-\sqrt5}{2}$

2022 Switzerland Team Selection Test, 7

Let $n$ be a positive integer. Find all polynomials $P$ with real coefficients such that $$P(x^2+x-n^2)=P(x)^2+P(x)$$ for all real numbers $x$.

1953 AMC 12/AHSME, 4

The roots of $ x(x^2\plus{}8x\plus{}16)(4\minus{}x)\equal{}0$ are: $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 0,4 \qquad\textbf{(C)}\ 0,4,\minus{}4 \qquad\textbf{(D)}\ 0,4,\minus{}4,\minus{}4 \qquad\textbf{(E)}\ \text{none of these}$

2021 Mediterranean Mathematics Olympiad, 1

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]

2002 Stanford Mathematics Tournament, 1

Completely factor the polynomial $x^4-x^3-5x^2+3x+6$

1987 Polish MO Finals, 3

$w(x)$ is a polynomial with integer coefficients. Let $p_n$ be the sum of the digits of the number $w(n)$. Show that some value must occur infinitely often in the sequence $p_1, p_2, p_3, ...$ .

2003 AMC 12-AHSME, 12

What is the largest integer that is a divisor of \[ (n\plus{}1)(n\plus{}3)(n\plus{}5)(n\plus{}7)(n\plus{}9) \]for all positive even integers $ n$? $ \textbf{(A)}\ 3 \qquad \textbf{(B)}\ 5 \qquad \textbf{(C)}\ 11 \qquad \textbf{(D)}\ 15 \qquad \textbf{(E)}\ 165$

2011 AMC 12/AHSME, 20

Let $f(x)=ax^2+bx+c$, where $a$, $b$, and $c$ are integers. Suppose that $f(1)=0$, $50 < f(7) < 60$, $70 < f(8) < 80$, and $5000k < f(100) < 5000(k+1)$ for some integer $k$. What is $k$? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5 $

2007 Grigore Moisil Intercounty, 2

Prove that if all roots of a monic cubic polynomial have modulus $ 1, $ then, the two middle coefficients have the same modulus.

1986 Swedish Mathematical Competition, 1

Show that the polynomial $x^6 -x^5 +x^4 -x^3 +x^2 -x+\frac34$ has no real zeroes.

2006 Iran Team Selection Test, 4

Let $n$ be a fixed natural number. Find all $n$ tuples of natural pairwise distinct and coprime numbers like $a_1,a_2,\ldots,a_n$ such that for $1\leq i\leq n$ we have \[ a_1+a_2+\ldots+a_n|a_1^i+a_2^i+\ldots+a_n^i \]

2013 BMT Spring, 6

The [i]minimal polynomial[/i] of a complex number $r$ is the unique polynomial with rational coefficients of minimal degree with leading coefficient $1$ that has $r$ as a root. If $f$ is the minimal polynomial of $\cos\frac\pi7$, what is $f(-1)$?

2014 Greece National Olympiad, 1

Find all the polynomials with real coefficients which satisfy $ (x^2-6x+8)P(x)=(x^2+2x)P(x-2)$ for all $x\in \mathbb{R}$.