Found problems: 109
Prove that if the numbers $p_1, p_2, q_1, q_2$ satisfy the condition $$(q_1 - q_2)^2 + (p_1 - p_2)(p_1q_2 -p_2q_1)<0$$
then the square polynomials $x^2 + p_1x + q_1$ and $x^2 + p_2x + q_2$ have real roots, and between the roots of each there is a root of another one.
How many positive integers $n < 2549$ are there such that $x^2 + x - n$ has an integer rooot?
Do there exist quadratic polynomials $P(x)$ and $Q(x)$ with real coeffcients such that the polynomial $P(Q(x))$ has precisely the zeros $x = 2, x = 3, x =5$ and $x = 7$?
Two quadratic trinomials $ f (x) $ and $ g (x) $ differ from each other only by a permutation of coefficients. Could it be that $ f (x) \geq g (x) $ for all real $ x $?
The senior coefficient $a$ in the square polynomial $$P(x) = ax^2 + bx + c$$ is more than $100$. What is the maximal number of integer values of $x$, such that $|P(x)|<50$.
Find all functions $f(x) = ax^2 + bx + c$, with $a \ne 0$, such that $f(f(1)) = f(f(0)) = f(f(-1))$ .
For all valid values of $a, b$, and $c$, solve the equation
$$\frac{a (x-b) (x-c) }{(a-b) (a-c)} + \frac{b (x-c) (x-a)}{(b-c) (b-a)} +\frac{c (x-a) (x-b) }{(c-a ) (c-b)} = x^2$$
How many integers $ x $ satisfy $ x^2 - 9x + 18 < 0 $?
Let $n$ be an integer that is greater than $1$. Prove that the following two statements are equivalent:
(A) There are positive integers $a, b$ and $c$ that are not greater than $n$ and for which that polynomial $ax^2 + bx + c$ has two different real roots $x_1$ and $x_2$ with $| x_2- x_1 | \le \frac{1}{n}$
(B) The number $n$ has at least two different prime divisors.
Consider all quadratic functions $f(x) = ax^2 +bx+c$ with $a < b$ and $f(x) \ge 0$ for all $x$. What is the smallest possible value of the expression $\frac{a+b+c}{b-a}$?
The roots of the two monic square trinomials are negative integers, and one of these roots is common. Can the values of these trinomials at some positive integer point equal 19 and 98?
Given are three numbers $a, b, c \in R-\{0\}$. The parabola with equation $y = ax^2+bx+c$ lies above the line $y = cx$. Prove that the parabola with equation $y = cx^2 - bx + a$ lies above the line $y = cx - b$.
Given the quadratic trinomial $ f (x) = x ^ 2 + ax + b $ with integer coefficients, satisfying the inequality $ f (x) \geq - {9 \over 10} $ for any $ x $. Prove that $ f (x) \geq - {1 \over 4} $ for any $ x $.
Given three quadratic trinomials $f, g, h$ without roots. Their elder coefficients are the same, and all their coefficients for x are different. Prove that there is a number $c$ such that the equations $f (x) + cg (x) = 0$ and $f (x) + ch (x) = 0$ have a common root.
Elías and Juanca solve the same problem by posing a quadratic equation. Elijah is wrong when writing the independent term and gets as results of the problem $-1$ and $-3$. Juanca is wrong only when writing the coefficient of the first degree term and gets as results of the problem $16$ and $-2$. What are the correct results of the problem?
Determine all real numbers $a, b,c$ such that the polynomial $f(x) = ax^2 + bx + c$ satisfi es simultaneously the folloving conditions $\begin{cases} |f(x)| \le 1 \text{ for } |x | \le 1 \\
f(x) \ge 7 \text{ for } x \ge 2 \end{cases} $
Do there exist quadratic polynomials $P(x)$ and $Q(x)$ with real coeffcients such that the polynomial $P(Q(x))$ has precisely the zeros $x = 2, x = 3, x =5$ and $x = 7$?
For which real values of $m$ does the equation $x^2-\frac{m^2+1}{m -1}x+2m+2=0$ has root $x=-1$?
The polynomial $A(x) = x^2 + ax + b$ with integer coefficients has the following property:
for each prime $p$ there is an integer $k$ such that $A(k)$ and $A(k + 1)$ are both divisible by $p$.
Proof that there is an integer $m$ such that $A(m) = A(m + 1) = 0$.
Natural numbers $k, l,p$ and $q$ are such that if $a$ and $b$ are roots of $x^2 - kx + l = 0$ then $a +\frac1b$ and $b + \frac1a$ are the roots of $x^2 -px + q = 0$. What is the sum of all possible values of $q$?
The polynomial $A(x) = x^2 + ax + b$ with integer coefficients has the following property:
for each prime $p$ there is an integer $k$ such that $A(k)$ and $A(k + 1)$ are both divisible by $p$.
Proof that there is an integer $m$ such that $A(m) = A(m + 1) = 0$.
The square polynomial $f(x)=ax^2+bx+c$ is of such a sort, that the equation $f(x)=x$ does not have real roots. Prove that the equation $f(f(x))=0$ does not have real roots also.
Petya and Kolya play the following game: they take turns changing one of the coefficients $a$ or $b$ of the quadratic trinomial $f = x^2 + ax + b$: Petya is on $1$, Kolya is on $1$ or $3$. Kolya wins if after the move of one of the players a trinomial is obtained that has whole roots. Is it true that Kolya can win for any initial integer odds $a$ and $b$ regardless of Petya's game?
[hide=original wording]Петя и Коля играют в следующую игру: они по очереди изменяют один из коэффициентов a или b квадратного трехчлена f = x^2 + ax + b: Петя на 1, Коля- на 1 или на 3. Коля выигрывает, если после хода одного из игроков получается трехчлен, имеющий целые корни. Верно ли,
что Коля может выигратьпр и любых начальных целых коэффициентах a и b независимо от игры Пети?[/hide]
Is there a quadratic trinomial with integer coefficients, such that all values which are natural to be natural powers of two?
Let $P_1$, $P_2$ and $P_3$ be polynomials of degree two with positive coefficient leader and real roots . Prove that if each pair of polynomials has a common root , then the polynomial $P_1 + P_2 + P_3$ has also real roots.