Problems

Age
Difficulty
Found: 32

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.

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.