Prove that for any natural number \(a_1> 1\) there exists an increasing sequence of natural numbers \(a_1, a_2, a_3, \dots\), for which \(a_1^2+ a_2^2 +\dots+ a_k^2\) is divisible by \(a_1+ a_2+\dots+ a_k\) for all \(k \geq 1\).
A numeric set \(M\) containing 2003 distinct numbers is such that for every two distinct elements \(a, b\) in \(M\), the number \(a^2+ b\sqrt 2\) is rational. Prove that for any \(a\) in \(M\) the number \(q\sqrt 2\) is rational.
The quadratic trinomials \(f (x)\) and \(g (x)\) are such that \(f' (x) g' (x) \geq | f (x) | + | g (x) |\) for all real \(x\). Prove that the product \(f (x) g (x)\) is equal to the square of some trinomial.
One of the roots of the equation \(x^2 + ax + b = 0\) is \(1 + \sqrt 3\). Find \(a\) and \(b\) if you know that they are rational.
Prove that if \((p, q) = 1\) and \(p/q\) is a rational root of the polynomial \(P (x) = a_nx^n + \dots + a_1x + a_0\) with integer coefficients, then
a) \(a_0\) is divisible by \(p\);
b) \(a_n\) is divisible by \(q\).
Prove that the root a of the polynomial \(P (x)\) has multiplicity greater than 1 if and only if \(P (a) = 0\) and \(P '(a) = 0\).
For which \(A\) and \(B\) does the polynomial \(Ax^{n + 1} + Bx^n + 1\) have the number \(x = 1\) at least two times as its root?
Author: A. Khrabrov
Do there exist integers \(a\) and \(b\) such that
a) the equation \(x^2 + ax + b = 0\) does not have roots, and the equation \(\lfloor x^2\rfloor + ax + b = 0\) does have roots?
b) the equation \(x^2 + 2ax + b = 0\) does not have roots, and the equation \(\lfloor x^2\rfloor + 2ax + b = 0\) does have roots?
Note that here, square brackets represent integers and curly brackets represent non-integer values or 0.
The equations \[ax^2 + bx + c = 0 \tag{1}\] and \[- ax^2 + bx + c \tag{2}\] are given. Prove that if \(x_1\) and \(x_2\) are, respectively, any roots of the equations (1) and (2), then there is a root \(x_3\) of the equation \(\frac 12 ax^2 + bx + c\) such that either \(x_1 \leq x_3 \leq x_2\) or \(x_1 \geq x_3 \geq x_2\).
Prove that if \(x_0^4 + a_1x_0^3 + a_2x_0^2 + a_3x_0 + a_4\) and \(4x_0^3 + 3a_1x_0^2 + 2a_2x_0 + a_3 = 0\) then \(x^4 + a_1x^3 + a_2x^2 + a_3x + a_4\) is divisible by \((x - x_0)^2\).