English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

3 answers

This is also 7 ∑ (1 + 11 + 111 + ... ).

Notice each of these numbers inside the term can be written in the form 10^0 + 10^1 + 10^2 + .... + 10^k. This is a geometric series, so its sum is (1 - 10^(k+1)) / (1-10), or
(10^(k+1) - 1)/9. So the series now becomes

7 ∑ [ (10^(1) - 1)/9 + (10^(2) - 1)/9 + (10^(3) - 1)/9 + ... ] =
(7/9) ∑ [ (10^(1) - 1) + (10^(2) - 1) + (10^(3) - 1) + ... ] =
(7/9)( [ ∑ 10^(1) + 10^(2) + 10^(3) + ... + 10^n ] - n )=
(7/9)( 10 [ ∑ 10^(0) + 10^(2) + 10^(3) + ... + 10^(n-1) ] - n )=
(7/9)( 10 [ (1 - 10^n) / (1-10) ] - n )=
(7/9)[ (10/9)(10^n - 1) - n ]

This is a general forumla for the sum, where "n" is the number of terms you have in the original problem.

2007-04-09 06:42:58 · answer #1 · answered by Anonymous · 0 0

This may be written as the double sum:

[j=1, n]∑[k=0, j-1]∑7*10^k

The inner term is a geometric series, and you will recall that the sum of a geometric series with terms a_1, a_2... a_n is simply (a_1-a_(n+1))/(1-r), where r is the common ratio. Thus, the inner series sums to:

[j=1, n]∑(7-7*10^j)/(1-10)

Or being simplified:

7/9 [j=1, n]∑(10^j-1)

Breaking this into two sums:

7/9 [j=1, n]∑10^j - 7/9 [j=1, n]∑1

Evaluating the geometric series and the constant sum:

7/9 (10-10^(n+1))/(-9) - 7n/9

Or being simplified:

(7*10^(n+1) - 63n - 70)/81

And we are done.

2007-04-09 13:40:07 · answer #2 · answered by Pascal 7 · 0 0

progressive convergence

2007-04-09 13:25:29 · answer #3 · answered by Anonymous · 0 0

fedest.com, questions and answers