Here's Prob. 11, Chap. 3, in the book Principles of Mathematical Analysis by Walter Rudin, 3rd edition:
Suppose $a_n > 0$, $s_n = a_1 + \cdots + a_n$, and $\sum a_n$ diverges.
(a) Prove that $\sum \frac{a_n}{1+ a_n}$ diverges. [ I have no clue of how to prove this!]
(b) Prove that $$ \frac{a_{N+1}}{s_{N+1}} + \cdots + \frac{a_{N+k}}{s_{N+k}} \geq 1- \frac{s_N}{s_{N+k}}$$ [I can show this.] and deduce that $\sum \frac{a_n}{s_n}$ diverges. [How to?]
(c) Prove that $$ \frac{a_n}{s_n^2} \leq \frac{1}{s_{n-1}} - \frac{1}{s_n}$$ and deduce that $\sum \frac{a_n}{s_n^2}$ converges. [This I can show, I think.]
(d) What can be said about (the convergence or divergence of) $$\sum \frac{a_n}{1+ n a_n} \ \ \ \mbox{ and } \ \ \ \sum \frac{a_n}{1+ n^2 a_n}?$$ [ How to answer this?]
I would prefer those answers that use only the machinary developed by Rudin himself upto this point in the book.
Here's what I can show:
Since $a_n > 0$, we have $0 < s_{N+1} < \cdots < s_{N+k}$ and so $$ \frac{a_{N+1}}{s_{N+1}} + \cdots + \frac{a_{N+k}}{s_{N+k}} \geq \frac{a_{N+1} + \cdots + a_{N+k}}{s_{N+k}} = 1- \frac{s_N}{s_{N+k}}.$$ As $a_n > 0$, so, for all $n = 2, 3, 4, \ldots$, we have $0 < s_{n-1} < s_n$ and therefore $$ \frac{a_n}{s_n^2} = \frac{s_n - s_{n-1}}{s_n^2} \leq \frac{s_n - s_{n-1}}{s_n s_{n-1}} = \frac{1}{s_{n-1}} - \frac{1}{s_n},$$ and hence $$ 0 \leq \sum_{k=1}^n \frac{a_k}{s_k^2} = \frac{1}{a_1} + \sum_{k=2}^n \frac{a_k}{s_k^2} \leq \frac{1}{a_1} + \sum_{k=2}^n \left( \frac{1}{s_{k-1}} - \frac{1}{s_k} \right) = \frac{1}{a_1} + \frac{1}{s_1} - \frac{1}{s_n} \to \frac{2}{a_1} + 0 $$ as $n \to \infty$ because $a_n > 0$ and $\sum a_n$ diverges and hence $s_n = a_1 + \cdots + a_n \to \infty$ as $n \to \infty$. So if $\lim_{n\to\infty} \sum_{k=1}^n \frac{a_k}{s_k^2} $ exists [ but how to show this?}, then we must have $$ 0 \leq \lim_{n\to\infty} \sum_{k=1}^n \frac{a_k}{s_k^2} \leq \frac{2}{a_1}.$$
Am I right?