Nick89
- 553
- 0
Homework Statement
I need a way to write the following series in a sum:
\frac{1}{2} + \frac{1}{4} + \frac{1}{32} + \frac{1}{64} + \frac{1}{1024} + \frac{1}{2048} + ...
If you look closely you can see a 2^n pattern in there:
\frac{1}{2} + \frac{1}{4} + \frac{0}{8} + \frac{0}{16} + \frac{1}{32} + \frac{1}{64} + \frac{0}{128} + \frac{0}{256} + \frac{1}{512} + \frac{1}{1024} + ...
The denominator obviously follows 2^n, but the numerator goes 110011001100...
I can't seem to find a function that will allow me to put this in a single sum:
\sum_{n=1}^{\infty} ...
(The sum should converge to 0.8, right?)
The Attempt at a Solution
I tried using the mod operator to determine if n was even or odd, something like this:
\sum_{n=1}^{\infty} \frac{n \mod 2}{2^n} + \frac{n \mod 2}{2^{n+1}}
This doesn't work, because the terms that are discarded when n is even are not discarded the next 'run' when (n+1) is even... Dunno how to explain this properly, but if you calculate it manually it does this:
\frac{1}{2} + \frac{1}{4} + \frac{0}{4} + \frac{0}{8} + \frac{1}{8} + \frac{1}{16} + ...
So if you discard the 0/ ... terms you are just left with the usual 2^(-n) sum...
I have a feeling I'm close, but I can't figure it out :S
Last edited: