Navigation 
 Home 
 Search 
 Site map 

 Contact Graeme 
 Home 
 Email 
 Twitter

 Skip Navigation LinksMath Help > Math Puzzles > Recurrence Relation Puzzle 1

Recurrence Relation Puzzle 1

>
>

The Fibonacci Numbers are defined as F1 = F2 = 1 and Fn+1 = Fn + Fn-1.

Calculate the following infinite sum:

 F1      3F2      32F3          3nFn+1 
---  +  ----  +  ----- + ... + ----- + ...
 1        5        52           5n

Source: Original with Graeme McRae

Click here for the answer.

Related pages in this website

Recurrence Relations

Fibonacci Numbers -- whose successive ratios approach the Golden Ratio

Increasing Function Puzzle 1 -- Find the closed form of this function defined as a recurrence relation

 

 

The webmaster and author of this Math Help site is Graeme McRae.