This is a modification of a problem in Rudin.
Let $(a_n)$ be a sequence of positive numbers (that is $a_n \geq 0)$. Then $\sum a_n$ converges iff $\sum \frac{a_n}{1+a_n}$ converges.
My attempt:
$\Rightarrow$ $$\frac{a_n}{1+a_n} \leq a_n$$ and this follows from comparison test.
$\Leftarrow$
Since $$a_n = \frac{a_n}{1+a_n} (1+a_n) = \frac{a_n}{1+a_n} + \frac{a_n^2}{1+a_n}$$
it suffices to show that $\sum \frac{a_n^2}{1+a_n}$ converges. For this, it suffices to show that $(a_n)$ is bounded, because then the result follows from the comparison test. Indeed, let $M$ be an upperbound. Then
$$\frac{a_n^2}{1+a_n} \leq \frac{Ma_n}{1+a_n}$$
We will prove that $a_n \to 0$, and this will prove the boundedness.
Let $\epsilon > 0$. Choose $N$ such that $\frac{a_n}{1+a_n} < \frac{\epsilon}{1+ \epsilon}$ for $n \geq N$, which is possible since $\frac{a_n}{1+a_n} \to 0$ since the series converges.
Then, $n \geq N$ implies that $a_n < \epsilon$ and the result follows.
Is this correct? Is there an easier way?