All topics

s4.3.2

Adding Consecutive Terms of Arbitrary Fibonacci Sequence, Method 2

1,000 questions

This alternative method for summing the first nn terms of an Arbitrary Fibonacci Sequence (AnA_n) uses the Standard Fibonacci numbers (FnF_n). This method is calculation-intensive but does not require you to find later terms in the arbitrary sequence.

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

For the sequence 4, 7, 11, ... (A1=4,A2=7A_1=4, A_2=7), the sum of the first 7 terms is: 4×F7+7×(F81)=4×13+7×(211)=52+140=1924 \times F_7 + 7 \times (F_8 - 1) = 4 \times 13 + 7 \times (21 - 1) = 52 + 140 = 192. This requires memorization of the standard Fibonacci numbers.

Practise this