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

Find all complex polynomial $ P(x)$ such that for any three integers $ a,b,c$ satisfying $ a \plus{} b \plus{} c\not \equal{} 0, \frac{P(a) \plus{} P(b) \plus{} P(c)}{a \plus{} b \plus{} c}$ is an integer.
[b]two variable ploynomial[/b] $P(x,y)$ is a two variable polynomial with real coefficients. degree of a monomial means sum of the powers of $x$ and $y$ in it. we denote by $Q(x,y)$ sum of monomials with the most degree in $P(x,y)$. (for example if $P(x,y)=3x^4y-2x^2y^3+5xy^2+x-5$ then $Q(x,y)=3x^4y-2x^2y^3$.) suppose that there are real numbers $x_1$,$y_1$,$x_2$ and $y_2$ such that $Q(x_1,y_1)>0$ , $Q(x_2,y_2)<0$ prove that the set $\{(x,y)|P(x,y)=0\}$ is not bounded. (we call a set $S$ of plane bounded if there exist positive number $M$ such that the distance of elements of $S$ from the origin is less than $M$.) time allowed for this question was 1 hour.
Determine whether there exists a polynomial $f(x_1, x_2)$ with two variables, with integer coefficients, and two points $A=(a_1, a_2)$ and $B=(b_1, b_2)$ in the plane, satisfying the following conditions: (i) $A$ is an integer point (i.e $a_1$ and $a_2$ are integers); (ii) $|a_1-b_1|+|a_2-b_2|=2010$; (iii) $f(n_1, n_2)>f(a_1, a_2)$ for all integer points $(n_1, n_2)$ in the plane other than $A$; (iv) $f(x_1, x_2)>f(b_1, b_2)$ for all integer points $(x_1, x_2)$ in the plane other than $B$. [i]Massimo Gobbino, Italy[/i]
Let $p(x)$ be a nonzero polynomial of degree less than $1992$ having no nonconstant factor in common with $x^3 -x$. Let $$ \frac{d^{1992}}{dx^{1992}} \left( \frac{p(x)}{x^3 -x } \right) =\frac{f(x)}{g(x)}$$ for polynomials $f(x)$ and $g(x).$ Find the smallest possible degree of $f(x)$.
Let $P(x)$ a grade 3 polynomial such that: $$P(1)=1, P(2)=4, P(3)=9$$ Find the value of $P(10)+P(-6)$
We say that a set $S$ of integers is [i]rootiful[/i] if, for any positive integer $n$ and any $a_0, a_1, \cdots, a_n \in S$, all integer roots of the polynomial $a_0+a_1x+\cdots+a_nx^n$ are also in $S$. Find all rootiful sets of integers that contain all numbers of the form $2^a - 2^b$ for positive integers $a$ and $b$.
Consider the polynomial $ax^3+bx^2+cx+d$ where $a,b,c,d$ are integers such that $ad$ is odd and $bc$ is even.Prove that not all of its roots are rational..
Let $a_1, a_2, \cdots, a_k$ be natural numbers. Let $S(n)$ be the number of solutions in nonnegative integers to $a_1x_1 + a_2x_2 + \cdots + a_kx_k = n$. Suppose $S(n) \neq 0$ for all big enough $n$. Show that for all sufficiently large $n$, we have $S(n+1) < 2S(n)$.
Find the number of degree $8$ polynomials $f (x)$ with nonnegative integer coefficients satisfying both $f (1) = 16$ and $f (-1) = 8$.
Given a prime $p$, show that there exist two integers $a, b$ which satisfies the following. For all integers $m$, $m^3+ 2017am+b$ is not a multiple of $p$.
Let $p$ and $q$ be prime numbers. The sequence $(x_n)$ is defined by $x_1 = 1$, $x_2 = p$ and $x_{n+1} = px_n - qx_{n-1}$ for all $n \geq 2$. Given that there is some $k$ such that $x_{3k} = -3$, find $p$ and $q$.
For complex number constant $c$, and real number constants $p$ and $q$, there exist three distinct complex values of $x$ that satisfy $x^3 + cx + p(1 + qi) = 0$. Suppose $c$, $p$, and $q$ were chosen so that all three complex roots $x$ satisfy $\tfrac{5}{6} \leq \tfrac{\mathrm{Im}(x)}{\mathrm{Re}(x)} \leq \tfrac{6}{5}$, where $\mathrm{Im}(x)$ and $\mathrm{Re}(x)$ are the imaginary and real part of $x$, respectively. The largest possible value of $|q|$ can be expressed as a common fraction $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.
Let $ a,b,c,d$ be rational numbers with $ a>0$. If for every integer $ n\ge 0$, the number $ an^{3} \plus{}bn^{2} \plus{}cn\plus{}d$ is also integer, then the minimal value of $ a$ will be $\textbf{(A)}\ 1 \qquad\textbf{(B)}\ \frac{1}{2} \qquad\textbf{(C)}\ \frac{1}{6} \qquad\textbf{(D)}\ \text{Cannot be found} \qquad\textbf{(E)}\ \text{None}$
Let $ \lfloor x \rfloor$ be the greatest integer less than or equal to $ x$. Then the number of real solutions to $ 4x^2 \minus{} 40 \lfloor x \rfloor \plus{} 51 \equal{} 0$ is $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 4$
An irreducible polynomial is a not-constant polynomial that cannot be factored into product of two non-constant polynomials. Consider the following statements :- [b]Statement 1 :[/b] $p(x)$ be any monic irreducible polynomial with integer coefficients and degree $\geq 4$. Then $p(n)$ is a prime for at least one natural number $n$ [b]Statement 2 :[/b] $n^2+1$ is prime for infinitely many values of natural number $n$ Show that if [b]Statement 1[/b] is true then [b]Statement 2[/b] is also true
Let $\tau(n)$ denote the number of positive integer divisors of a positive integer $n$ (for example, $\tau(2022) = 8$). Given a polynomial $P(X)$ with integer coefficients, we define a sequence $a_1, a_2,\ldots$ of nonnegative integers by setting \[a_n =\begin{cases}\gcd(P(n), \tau (P(n)))&\text{if }P(n) > 0\\0 &\text{if }P(n) \leq0\end{cases}\] for each positive integer $n$. We then say the sequence [i]has limit infinity[/i] if every integer occurs in this sequence only finitely many times (possibly not at all). Does there exist a choice of $P(X)$ for which the sequence $a_1$, $a_2$, . . . has limit infinity? [i]Jovan Vuković[/i]
Let $ x,y,z$ be positive real numbers, show that $ \frac {xy}{z} \plus{} \frac {yz}{x} \plus{} \frac {zx}{y} > 2\sqrt [3]{x^3 \plus{} y^3 \plus{} z^3}.$
Prove that, for all integer $a>1$, the prime divisors of $5a^4-5a^2+1$ have the form $20k\pm1,k\in\mathbb{Z}$. [i]Proposed by Géza Kós.[/i]
Can you find three polynomials $P,Q,R$ of three variables $x,y,z$, providing the condition: a)$P(x-y+z)^3 + Q(y-z-1)^3 +R(z-2x+1)^3 = 1$ b)$P(x-y+z)^3 + Q(y-z-1)^3 +R(z-x+1)^3 = 1$ for all $x,y,z$?
Show that for every polynomial $W$ in three variables there exist polynomials $U$ and $V$ such that: $$W(x,y,z) = U(x,y,z)+V(x,y,z),$$ $$U(x,y,z) = U(y,x,z),$$ $$V(x,y,z) = -V(x,z,y).$$
The sequence $(Q_{n}(x))$ of polynomials is defined by $$Q_{1}(x)=1+x ,\; Q_{2}(x)=1+2x,$$ and for $m \geq 1 $ by $$Q_{2m+1}(x)= Q_{2m}(x) +(m+1)x Q_{2m-1}(x),$$ $$Q_{2m+2}(x)= Q_{2m+1}(x) +(m+1)x Q_{2m}(x).$$ Let $x_n$ be the largest real root of $Q_{n}(x).$ Prove that $(x_n )$ is an increasing sequence and that $\lim_{n\to \infty} x_n =0.$
$(USS 3)$ $(a)$ Prove that if $0 \le a_0 \le a_1 \le a_2,$ then $(a_0 + a_1x - a_2x^2)^2 \le (a_0 + a_1 + a_2)^2\left(1 +\frac{1}{2}x+\frac{1}{3}x^2+\frac{1}{2}x^3+x^4\right)$ $(b)$ Formulate and prove the analogous result for polynomials of third degree.
Let $n > 1$ be an integer and let $f(x) = x^n + 5 \cdot x^{n-1} + 3.$ Prove that there do not exist polynomials $g(x),h(x),$ each having integer coefficients and degree at least one, such that $f(x) = g(x) \cdot h(x).$
We have $n$ points in the plane, no three on a line. We call $k$ of them good if they form a convex polygon and there is no other point in the convex polygon. Suppose that for a fixed $k$ the number of $k$ good points is $c_k$. Show that the following sum is independent of the structure of points and only depends on $n$ : \[ \sum_{i=3}^n (-1)^i c_i \]