Let $S$ be the set of integers without a 2 in the decimal representation. Does the sum $\sum_{n \in S} n^{-1}$ converge?
I'm not entirely sure how to approach this problem.
Let $S$ be the set of integers without a 2 in the decimal representation. Does the sum $\sum_{n \in S} n^{-1}$ converge?
I'm not entirely sure how to approach this problem.
Hint: how many such numbers have $d$ digits? Estimate the sum of the reciprocals of those numbers.
Thanks to achille hui and Robert Israel for pointing me in the correct direction. I'll answer my own question since I've figured out how to do this.
There are $9^{d-1}8$ integers of length $d$ that don't have a single number (e.g. integers without 2 in the decimal representation). The smallest of these is $10^{d-1}$, so their reciprocals are bounded above by $9^{d-1}8 \times 10^{1-d} = 8 \times (9/10)^{d-1}$. Summing over $d$, this is a geometric series that converges to 80.
Therefore the original sum converges.