lo g 8 1 9 2 ⎝ ⎛ n = 1 ∑ 1 7 2 9 ⎝ ⎛ k = 1 ∑ ∞ 2 k F k n ⎠ ⎞ + 1 ⎠ ⎞
let F k n be the k th term of the n -step Fibonacci number. then evaluate the expression above.
for info go here .
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.
Got a proof?
Log in to reply
Simple rearrangement, there's a problem of mine with a proof.
Problem Loading...
Note Loading...
Set Loading...
Kind of a needless extension of my problem. It can be proven that k = 1 ∑ ∞ 2 k F k ( n ) = 2 n .