The exercise $10.22.16$ goes as follows:
Let $n_1 < n_2 < n_3 ...$ denote positive integers that do not involve digit 0 in their decimal representation. Thus $n_1 = 1, n_2 = 2, ..., n_9 = 9, n_{10} = 11, ..., n_{18} = 19, n_{19} = 21,$ etc. Show that the series of reciprocals $\sum_{k=1}^{\infty} \frac{1}{n_k}$ converges.
When proving Riemann's rearrangement theorem, we were taking in order positive elements, and then in order negative elements, and iterating like that, and that was fine, because I thought we can do that because we were taking positive and negative elements in order and the sequence is conditionally convergent. However, if I apply a similar approach here (which maybe we could see like iteratively taking in order $10$ elements of $\frac{1}{k}$ sequence, and then the next negative element from the $\frac{1}{10k}$ sequence), I get:
$S = \sum_{k=1}^{\infty} \frac{1}{n_k} = \sum \frac{1}{k} - \sum \frac{1}{10 k} = \sum (\frac{1}{k} - \frac{1}{10 k}) =\frac{9}{10} \sum \frac{1}{k}$
Because we know that $\sum \frac{1}{n}$ diverges, from that I conclude that the series $S$ also diverges, which is a contradiction.
Can you please point out a mistake in my reasoning and a justification why that's incorrect?
I suspect it's because the $2$ harmonic series I was summing and rearranging are not convergent (while in the Riemann theorem's proof the sequence being rearranged is convergent), but I don't know why I could not combine them like I did above.