Use any summation method which is linear and stable , find the sum of all the positive Fibonacci numbers ,
1 + 1 + 2 + 3 + 5 + 8 + ⋯ .
Give your answer to 1 decimal place.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
How is this possible? First term is itself greater than sum!
Log in to reply
Suggested reading: sum of divergent series
Log in to reply
I read but I am thinking why is that a sum ?
Log in to reply
@Prince Loomba – This is a way to assign a number to a divergent 'sum' which behaves intuitively similar to a sum. For example, it is stable and linear. Though in normal sense it does not converge and does not have a sum, its sum should be that number if it really exists.
It's a similar summation method to 1 + 2 + 3 + 4 + … = − 1 2 1 .
Log in to reply
I am new to these methods. I didnt know before
We can also use Binet's formula for nth Fibonacci number.
Log in to reply
Seems a interesting approach. Could you show your solution here?
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Sums Of Divergent Series
Let S = 1 + 1 + 2 + 3 + 5 + 8 + ⋯ , then
0 = S − S = ( 1 + 1 + 2 + 3 + 5 + 8 + ⋯ ) − ( 1 + 1 + 2 + 3 + 5 + 8 + ⋯ ) = 1 + ( 1 + 2 + 3 + 5 + 8 + ⋯ ) − ( 1 + 1 + 2 + 3 + 5 + 8 + ⋯ ) (stability) = 1 + ( 0 + 1 + 1 + 2 + 3 + ⋯ ) (linearity) = 1 + S So S = − 1
Another method is to use Abel sum.
S = x → 1 − lim ( 1 + x + 2 x 2 + 3 x 3 + ⋯ ) = x → 1 − lim 1 − x − x 2 1 = − 1