I'm a bit confused regarding what the sequence is supposed to be. Is it correct to say that
S1=6,
S2=66 and so-on? And the problem is asking for a formula for the sum of all terms from
S1 through
Sn given some value for
n?
Assuming I interpret this correctly, my train of thought is as follows...
Each term in the sequence can be given with the following formula:
Sn=32(10n−1)
This isn't actually in the form of a
geometric series, as the terms are not separated by a common ratio. 6 to 66 is a ratio of 11, 66 to 666 is a ratio of
10.09, etc.
The running sum of terms is given with the following formula (given that
Σ0=0):
Σn=Σn−1+Sn
This is a
recurrence relation, and I never did learn how to work those out. Wolfram|Alpha
tells me that:
Σn=2720(10n−1)−32n
This solves the problem as I understand it.
I'm interested to know how to resolve the formula properly--how to convert the recursive formula into something that is not recursive. I see this come up a lot in various contexts and it always flies over my head. In a pinch, I don't mind using Wolfram|Alpha for implementing solutions, but I like to know to do things "without a calculator" as it were. Any insights into this would be appreciated.