Found problems: 4275
Determine the maximum value of $m^2+n^2$, where $m$ and $n$ are integers in the range $1,2,\ldots,1981$ satisfying $(n^2-mn-m^2)^2=1$.
Let $ \varphi(x) \equal{} ax^3 \plus{} bx^2 \plus{} cx \plus{} d$ be a polynomial with real coefficients. Given that $ \varphi(x)$ has three positive real roots and that $ \varphi(0) < 0$, prove that
\[ 2b^3 \plus{} 9a^2d \minus{} 7abc \leq 0.
\]
An infinite increasing arithmetical progression consists of positive integers and contains a perfect cube. Prove that this progression also contains a term which is a perfect cube but not a perfect square.
Let $(F_n)_{n\geq 1} $ be the Fibonacci sequence $F_1 = F_2 = 1, F_{n+2} = F_{n+1} + F_n (n \geq 1),$ and $P(x)$ the polynomial of degree $990$ satisfying
\[ P(k) = F_k, \qquad \text{ for } k = 992, . . . , 1982.\]
Prove that $P(1983) = F_{1983} - 1.$
If $a, b, c, d$ are the solutions of the equation $x^4-kx-15=0$, find the equation whose solutions are $\frac{a+b+c}{d^2}, \frac{a+b+d}{c^2}, \frac{a+c+d}{b^2}, \frac{b+c+d}{a^2}$.
Consider the trinomial $f(x) = x^2 + 2bx + c$ with integer coefficients $b$ and $c$.
Prove that if $f(n) \ge 0$ for all integers $n$, then $f(x) \ge 0$ even for all rational numbers $x$.
Let $n > 1$ and $x_i \in \mathbb{R}$ for $i = 1,\cdots, n$. Set
\[S_k = x_1^k+ x^k_2+\cdots+ x^k_n\]
for $k \ge 1$. If $S_1 = S_2 =\cdots= S_{n+1}$, show that $x_i \in \{0, 1\}$ for every $i = 1, 2,\cdots, n.$
Suppose $f(x)$ is a polynomial with integer coefficients satisfying the condition $0 \le f(c) \le 1997$ for each $c \in \{0, 1, ..., 1998\}$. Is is true that $f(0) = f(1) = ... = f(1998)$?
(variation of [url=https://artofproblemsolving.com/community/c6h49788p315649]1997 IMO Shortlist p12[/url])
Let $P(x)$ be an odd degree polynomial in $x$ with real coefficients. Show that the equation $P(P(x))=0$ has at least as many distinct real roots as the equation $P(x)=0$.
Let $P(x)$ be a polynomial of degree $n \le 10$ with integral coefficients such that for every $k \in \{1, 2, \dots, 10\}$ there is an integer $m$ with $P(m) = k$. Furthermore, it is given that $|P(10) - P(0)| < 1000$. Prove that for every integer $k$ there is an integer $m$ such that $P(m) = k.$
Let $p(x)$ and $q(x)$ non constant real polynomials of degree at most $n$ ($n > 1$). Show that there exists a non zero polynomial $F(x,y)$ in two variables with real coefficients of degree at most $2n-2,$ such that $F(p(t),q(t)) = 0$ for every $t\in \mathbb{R}$.
Prove that the polynomial $z^{2n} + z^n + 1\ (n \in \mathbb{N})$ is divisible by the polynomial $z^2 + z + 1$ if and only if $n$ is not a multiple of $3$.
$(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 $r$ and $s$ be positive integers. Define $a_0 = 0$, $a_1 = 1$, and $a_n = ra_{n-1} + sa_{n-2}$ for $n \geq 2$. Let $f_n = a_1a_2\cdots a_n$. Prove that $\displaystyle\frac{f_n}{f_kf_{n-k}}$ is an integer for all integers $n$ and $k$ such that $0 < k < n$.
[i]Evan O' Dorney.[/i]
Three nonzero real numbers are given. If they are written in any order as coefficients of a quadratic trinomial, then each of these trinomials has a real root. Does it follow that each of these trinomials has a positive root?
Let $ a,b,c$ be positive real numbers such that $ ab\plus{}bc\plus{}ca\equal{}3$. Prove that
\[ \frac 1{1\plus{}a^2(b\plus{}c)} \plus{} \frac 1{1\plus{}b^2(c\plus{}a)} \plus{} \frac 1 {1\plus{}c^2(a\plus{}b) } \leq \frac 3 {1\plus{}2abc} .\]
Let be a $ 3\times 3 $ real matrix $ A. $ Prove the following statements.
[b]a)[/b] $ f(A)\neq O_3, $ for any polynomials $ f\in\mathbb{R} [X] $ whose roots are not real.
[b]b)[/b] $ \exists n\in\mathbb{N}\quad \left( A+\text{adj} (A) \right)^{2n} =\left( A \right)^{2n} +\left( \text{adj} (A) \right)^{2n}\iff \text{det} (A)=0 $
[i]Laurențiu Panaitopol[/i]
Prove that $$x^4 + 2x^2 + 2x + 2$$ is not the product of two polynomials $x^2 + ax + b$ and $x^2 + cx + d$ in which $a$, $b$, $c$, $d$ are integers.
Let $P(x)$ and $Q(x)$ be two polynomials with integer coefficients, such that no nonconstant polynomial with rational coefficients divides both $P(x)$ and $Q(x).$ Suppose that for every positive integer $n$ the integers $P(n)$ and $Q(n)$ are positive, and $2^{Q(n)}-1$ divides $3^{P(n)}-1.$ Prove that $Q(x)$ is a constant polynomial.
[i]Proposed by Oleksiy Klurman, Ukraine[/i]
Find all pairs of real numbers $(a,b)$ so that there exists a polynomial $P(x)$ with real coefficients and $P(P(x))=x^4-8x^3+ax^2+bx+40$.
Let $n\geq 2$ be an integer. Determine the number of terms in the polynomial $$\prod_{1\leq i< j\leq n}(x_i+x_j)$$ whose coefficients are odd integers.
Prove that in an abelian ring $ A $ in which $ 1\neq 0, $ every element is idempotent if and only if the number of polynomial functions from $ A $ to $ A $ is equal to the square of the cardinal of $ A. $
Find all polynomials $P(x)$ with integer coefficients such that, for all integers $a$ and $b$, $P(a+b) - P(b)$ is a multiple of $P(a)$.
Let $f(x)=a_0x^3+a_1x^2+a_2x+a_3$ be a polynomial with real coefficients ($a_0\ne0$) such that $|f(x)|\le1$ for every $x\in[-1,1]$. Prove that
(a) there exist a constant $c$ (one and the same for all polynomials with the given property), for which
(b) $|a_0|\le4$.
[i]V. Petkov[/i]
Let $f$ and $g$ be two nonzero polynomials with integer coefficients and $\deg f>\deg g$. Suppose that for infinitely many primes $p$ the polynomial $pf+g$ has a rational root. Prove that $f$ has a rational root.