Let $\{ a_0, a_1, \dots\}$ be a sequence of non-negative integers such that for every $n\geq 1$ the sequence satisfies $a_n \leq a'_{n-1} = \max\{ 1, \sum^{n-1}_{k=0}a_k\}$. Show that $$ \sum^{M}_{i=1}\frac{a_i}{\sqrt{a'_{i-1}}} \leq (\sqrt 2 + 1) \sqrt{a'_M}$$
This is my attempt. Let $p$ be first integer for which $a'_p = a_1 + a_2 + \dots + a_{p}$. Thus, each of the first $p$ elements of the sum are bounded by $1$. For $i \geq p$ we can find that $a'_{i+1} - a'_{i} = a_{i+1} \leq a'_{i}$, and thus $\frac{a'_{i+1}}{a'_{i}}\leq 2$. What else could I do?
Induction works.