After login you will be able to create your own lists of problems.

Problems

Sort

Age

Difficulty

Found: 1

Problems Calculus Number sequences Boundedness, monotonicity Algebra Polynomials Algebraic identities for polynomials Identical transformations Sequences

14–16 5.0

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$ .