Problem #PRU-109599

Problems Calculus Number sequences Boundedness, monotonicity Algebra Number theory. Divisibility Divisibility of a number. General properties Methods Examples and counterexamples. Constructive proofs Polynomials Algebraic identities for polynomials Identical transformations Sequences Sequences

Problem

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\).