4.3.2 Adding Consecutive Terms of Arbitrary Fibonacci Sequence, Method 2

This method uses your knowledge of the Standard Fibonacci Sequence, FnF_n, instead of computing additional terms.

The Formula

Sum of first n terms=A1×Fn+A2×(Fn+11)\text{Sum of first } n \text{ terms} = A_1 \times F_n + A_2 \times (F_{n+1} - 1)

Example: Sum of first 7 terms of 4, 7, 11, …, 47, 76

X=4×F7+7×(F81)=4×13+7×(211)=52+140=192X = 4 \times F_7 + 7 \times (F_8 - 1) = 4 \times 13 + 7 \times (21 - 1) = 52 + 140 = 192

Standard Fibonacci Reference

nF_n
11
21
32
43
55
68
713
821
934
1055
1189
12144

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,...