4.3.2 Adding Consecutive Terms of Arbitrary Fibonacci Sequence, Method 2
This method uses your knowledge of the Standard Fibonacci Sequence, , instead of computing additional terms.
The Formula
Example: Sum of first 7 terms of 4, 7, 11, …, 47, 76
Standard Fibonacci Reference
| n | F_n |
|---|---|
| 1 | 1 |
| 2 | 1 |
| 3 | 2 |
| 4 | 3 |
| 5 | 5 |
| 6 | 8 |
| 7 | 13 |
| 8 | 21 |
| 9 | 34 |
| 10 | 55 |
| 11 | 89 |
| 12 | 144 |
Tip: This method requires memorizing Standard Fibonacci Numbers but avoids computing sequence terms!
Problem Set 4.3.2
Practice these problems. Type your answer and press Enter to check:
Sum of first 8 terms: 2,5,7,12,19,...
Sum of first 9 terms: 1,5,6,11,17,28,...
Sum of first 8 terms: 3,4,7,11,18,...
Sum of first 9 terms: 2,4,6,10,16,...
Sum of first 9 terms: 4,7,11,18,29,...
Sum of first 10 terms: 2,5,7,12,19,...
Sum of first 9 terms: 3,5,8,13,21,...
Sum of first 9 terms: -3,4,1,5,6,...
Sum of first 9 terms: 4,6,10,16,26,...
Sum of first 9 terms: 1,1,2,3,5,...
Sum of first 10 terms: 4,6,10,16,26,...
Sum of first 10 terms: 3,6,9,15,24,...
Sum of first 10 terms: 0,3,3,6,9,15,...
Sum of first 10 terms: 4,5,9,14,23,...
Sum of first 11 terms: 2,4,6,10,16,...
Sum of first 10 terms: 3,4,7,11,18,...
Sum of first 10 terms: 1,4,5,9,14,...
Sum of first 12 terms: 1,2,3,5,8,...