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

1982 Spain Mathematical Olympiad, 4

Determine a polynomial of non-negative real coefficients that satisfies the following two conditions: $$p(0) = 0, p(|z|) \le x^4 + y^4,$$ being $|z|$ the module of the complex number $z = x + iy$ .

2007 ITAMO, 2

We define two polynomials with integer coefficients P,Q to be similar if the coefficients of P are a permutation of the coefficients of Q. a) if P,Q are similar, then $P(2007)-Q(2007)$ is even b) does there exist an integer $k > 2$ such that $k \mid P(2007)-Q(2007)$ for all similar polynomials P,Q?

1967 IMO Longlists, 43

The equation \[x^5 + 5 \lambda x^4 - x^3 + (\lambda \alpha - 4)x^2 - (8 \lambda + 3)x + \lambda \alpha - 2 = 0\] is given. Determine $\alpha$ so that the given equation has exactly (i) one root or (ii) two roots, respectively, independent from $\lambda.$

I Soros Olympiad 1994-95 (Rus + Ukr), 11.8

A polynomial with rational coefficients is called [i]integer[/i], if it takes integer values ​​for all integer values ​​of the variable. For an integer polynomial $P$, consider the sequence $(-1)^{P(1)},(-1)^{P(2)},(-1)^{P(3)},...$ a) Prove that this sequence is periodic, the period of which is some power of two (i.e. for some integer $k$ and for all natural $i$, the $i$-th and ($i+2^k$)th members of the sequence are equal). b) Prove that for any periodic sequence consisting of $(- 1)$ and $ 1$ and with a period of some power of two, there exists a integer, polynomial P for which this sequence is $(-1)^{P(1)},(-1)^{P(2)},(-1)^{P(3)},...$

Oliforum Contest IV 2013, 4

Let $p,q$ be integers such that the polynomial $x^2+px+q+1$ has two positive integer roots. Show that $p^2+q^2$ is composite.

2023 Bangladesh Mathematical Olympiad, P10

Let all possible $2023$-degree real polynomials: $P(x)=x^{2023}+a_1x^{2022}+a_2x^{2021}+\cdots+a_{2022}x+a_{2023}$, where $P(0)+P(1)=0$, and the polynomial has 2023 real roots $r_1, r_2,\cdots r_{2023}$ [not necessarily distinct] so that $0\leq r_1,r_2,\cdots r_{2023}\leq1$. What is the maximum value of $r_1 \cdot r_2 \cdots r_{2023}?$

The Golden Digits 2024, P2

Find all the functions $\varphi:\mathbb{Z}[x]\to\mathbb{Z}[x]$ such that $\varphi(x)=x,$ any integer polynomials $f, g$ satisfy $\varphi(f+g)=\varphi(f)+\varphi(g)$ and $\varphi(f)$ is a perfect power if and only if $f{}$ is a perfect power. [i]Note:[/i] A polynomial $f\in \mathbb{Z}[x]$ is a perfect power if $f = g^n$ for some $g\in \mathbb{Z}[x]$ and $n\geqslant 2.$ [i]Proposed by Pavel Ciurea[/i]

2018 Brazil Undergrad MO, 21

Consider $ p (x) = x ^ n + a_ {n-1} x ^ {n-1} + ... + a_ {1} x + 1 $ a polynomial of positive real coefficients, degree $ n \geq 2 $ e with $ n $ real roots. Which of the following statements is always true? a) $ p (2) <2 (2 ^ {n-1} +1) $ (b) $ p (1) <3 $ c) $ p (1)> 2 ^ n $ d) $ p (3 ) <3 (2 ^ {n-1} -2) $

2007 Estonia Math Open Senior Contests, 4

The Fibonacci sequence is determined by conditions $ F_0 \equal{} 0, F1 \equal{} 1$, and $ F_k\equal{}F_{k\minus{}1}\plus{}F_{k\minus{}2}$ for all $ k \ge 2$. Let $ n$ be a positive integer and let $ P(x) \equal{} a_mx^m \plus{}. . .\plus{} a_1x\plus{} a_0$ be a polynomial that satisfies the following two conditions: (1) $ P(F_n) \equal{} F_{n}^{2}$ ; (2) $ P(F_k) \equal{} P(F_{k\minus{}1}) \plus{} P(F_{k\minus{}2}$ for all $ k \ge 2$. Find the sum of the coefficients of P.

1956 Putnam, B7

Tags: algebra , root , polynomial
The polynomials $P(z)$ and $Q(z)$ with complex coefficients have the same set of numbers for their zeros but possibly different multiplicities. The same is true for the polynomials $$P(z)+1 \;\; \text{and} \;\; Q(z)+1.$$ Prove that $P(z)=Q(z).$

2007 China Team Selection Test, 3

Prove that for any positive integer $ n$, there exists only $ n$ degree polynomial $ f(x),$ satisfying $ f(0) \equal{} 1$ and $ (x \plus{} 1)[f(x)]^2 \minus{} 1$ is an odd function.

2006 MOP Homework, 6

Tags: algebra , root , polynomial
Let $n$ be an integer greater than $3$. Prove that all the roots of the polynomial $P(x) = x^n - 5x^{n-1} + 12x^{n-2}- 15x^{n-3} + a_{n-4}x^{n-4} +...+ a_0$ cannot be both real and positive.

2004 Purple Comet Problems, 3

How many real numbers are roots of the polynomial \[x^9 - 37x^8 - 2x^7 + 74x^6 + x^4 - 37x^3 - 2x^2 + 74x?\]

1961 AMC 12/AHSME, 29

Let the roots of $ax^2+bx+c=0$ be $r$ and $s$. The equation with roots $ar+b$ and $as+b$ is: $ \textbf{(A)}\ x^2-bx-ac=0$ $\qquad\textbf{(B)}\ x^2-bx+ac=0$ $\qquad\textbf{(C)}\ x^2+3bx+ca+2b^2=0$ ${\qquad\textbf{(D)}\ x^2+3bx-ca+2b^2=0 }$ ${\qquad\textbf{(E)}\ x^2+bx(2-a)+a^2c+b^2(a+1)=0} $

2021 Indonesia TST, A

Given a polynomial $p(x) =Ax^3+x^2-A$ with $A \neq 0$. Show that for every different real number $a,b,c$, at least one of $ap(b)$, $bp(a)$, and $cp(a)$ not equal to 1.

2010 AMC 10, 24

The number obtained from the last two nonzero digits of $ 90!$ is equal to $ n$. What is $ n$? $ \textbf{(A)}\ 12 \qquad \textbf{(B)}\ 32 \qquad \textbf{(C)}\ 48 \qquad \textbf{(D)}\ 52 \qquad \textbf{(E)}\ 68$

2006 MOP Homework, 2

Let $a, b_1, b_2, \dots, b_n, c_1, c_2, \dots, c_n$ be real numbers such that \[x^{2n} + ax^{2n - 1} + ax^{2n - 2} + \dots + ax + 1 = \prod_{i = 1}^{n}{(x^2 + b_ix + c_i)}\] Prove that $c_1 = c_2 = \dots = c_n = 1$. As a consequence, all complex zeroes of this polynomial must lie on the unit circle.

2003 Tuymaada Olympiad, 4

Given are polynomial $f(x)$ with non-negative integral coefficients and positive integer $a.$ The sequence $\{a_{n}\}$ is defined by $a_{1}=a,$ $a_{n+1}=f(a_{n}).$ It is known that the set of primes dividing at least one of the terms of this sequence is finite. Prove that $f(x)=cx^{k}$ for some non-negative integral $c$ and $k.$ [i]Proposed by F. Petrov[/i] [hide="For those of you who liked this problem."] Check [url=http://www.artofproblemsolving.com/Forum/viewtopic.php?t=62259]this thread[/url] out.[/hide]

2016 Saudi Arabia GMO TST, 3

Find all polynomials $P,Q \in Z[x]$ such that every positive integer is a divisor of a certain nonzero term of the sequence $(x_n)_{n=0}^{\infty}$ given by the conditions: $x_0 = 2016$, $x_{2n+1} = P(x_{2n})$, $x_{2n+2} = Q(x_{2n+1})$ for all $n \ge 0$

2005 MOP Homework, 4

Deos there exist a function $f: \mathbb{R} \rightarrow \mathbb{R}$ such that for all $x$, $y \in \mathbb{R}$, $f(x^2y+f(x+y^2))=x^3+y^3+f(xy)$

1998 Irish Math Olympiad, 5

If $ x$ is a real number such that $ x^2\minus{}x$ and $ x^n\minus{}x$ are integers for some $ n \ge 3$, prove that $ x$ is an integer.

2002 Stanford Mathematics Tournament, 1

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

2000 AMC 10, 24

Let $f$ be a function for which $f\left(\frac x3\right)=x^2+x+1$. Find the sum of all values of $z$ for which $f(3z)=7$. $\text{(A)}\ -\frac13\qquad\text{(B)}\ -\frac19 \qquad\text{(C)}\ 0 \qquad\text{(D)}\ \frac59 \qquad\text{(E)}\ \frac53$

2001 Brazil Team Selection Test, Problem 1

given that p,q are two polynomials such that each one has at least one root and \[p(1+x+q(x)^2)=q(1+x+p(x)^2)\] then prove that p=q

2005 Mediterranean Mathematics Olympiad, 4

Let $A$ be the set of all polynomials $f(x)$ of order $3$ with integer coefficients and cubic coefficient $1$, so that for every $f(x)$ there exists a prime number $p$ which does not divide $2004$ and a number $q$ which is coprime to $p$ and $2004$, so that $f(p)=2004$ and $f(q)=0$. Prove that there exists a infinite subset $B\subset A$, so that the function graphs of the members of $B$ are identical except of translations