Module 1.

3 Finding the nth term of the Fibonacci Sequence

From the previous section, you have learned that the next term of the Fibonacci sequence is the
sum of its two preceding terms. Its recurrence relation is

𝑓! = 𝑓!"# + 𝑓!"$ for 𝑛 = 2, 3, 4, …

where 𝑛 is the number of the term, 𝑓% = 0, and 𝑓# = 1.

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, …

Example 1: What is the 11th Fibonacci Number?

Here 𝑛 = 11. To find the 11th term, you need the 9th and 10th terms of the Fibonacci Sequence.
Since 𝑓#% = 55 and 𝑓& = 34, we have

𝑓## = 𝑓##"# + 𝑓##"$ = 𝑓#% + 𝑓& = 55 + 34 = 89

The 11th Fibonacci number is 89.

Example 2: What is the 13th Fibonacci Number?

Here 𝑛 = 13. To find the 13th term, you need the 11th and 12th terms of the Fibonacci Sequence.
Since 𝑓#$ = 144 and 𝑓## = 89, we have

𝑓#' = 𝑓#'"# + 𝑓#'"$ = 𝑓#$ + 𝑓## = 144 + 89 = 233

The 13th Fibonacci number is 233.

Example 3: The 16th term of the Fibonacci sequence is 987 and the 17th term is 1597. What is the 19th
term?

To find the 19th term of the Fibonacci sequence, you must find first the 18th term.

𝑓#( = 𝑓#("# + 𝑓#("$ = 𝑓#) + 𝑓#* = 1597 + 987 = 2584

𝑓#& = 𝑓#&"# + 𝑓#&"$ = 𝑓#( + 𝑓#) = 2584 + 1597 = 4181

The 19th term of the Fibonacci sequence is 4181.

Alternatively, we can also have

𝑓#& = 𝑓#( + 𝑓#) = [𝑓#) + 𝑓#* ] + 𝑓#) = 𝑓#) + 𝑓#* + 𝑓#) = 2𝑓#) + 𝑓#*
= 2(1597) + 987 = 3194 + 987 = 4181
Example 4. The 27th term of the Fibonacci sequence is 196418 and the 29th term is 514229. What is the
28th term?

Since the given is the preceding and succeeding number of the 28th term, then you rearrange the
equation and then proceed to subtraction.

𝑓$& = 𝑓$&"# + 𝑓$&"$

𝑓$& = 𝑓$( + 𝑓$)
514229 = 𝑓$( + 196418
𝑓$( = 514229 − 196418
𝑓$( = 317811

The 28th term of the Fibonacci sequence is 317811

The Fibonacci sequence recurrence relation necessitates knowing two preceding terms to
determine the nth term of the sequence. Without using the recursion formula, the nth term of the Fibonacci
sequence may be identified through Binet’s formula (with 𝑓# & 𝑓$ = 1).

Definition. Let 𝑓! be the 𝑛th Fibonacci sequence, then the solution of the recurrence relation is
! !
1 + √5 1 − √5
! ! 9 2 : −9 2 :
1 1 + √5 1 − √5
𝑓! = 89 : −9 : ;=
√5 2 2 √5

The closed formula above is called Binet’s formula of the nth term of the Fibonacci sequence. It
was derived by the mathematician Jacques Philippe Marie Binet.

Example 5: What is the 26th Fibonacci number?

(1) Using the recurrence relation and listing the terms, we have

1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946,
17711, 28657, 46368, 75025, 121393, …

Therefore, the 26th Fibonacci number is 121393.

(2) Using Binet’s formula and 𝑛 = 26

$* $*
1 + √5 1 − √5
9 2 : −9 2 :
𝑓$* = = 121393
√5

Example 6. Find the 50th Fibonacci number using Binet’s formula.

Answer. Let 𝑛 = 50
+% +%
1 1 + √5 1 − √5
𝑓+% = 89 : −9 : ; = 1 586 269 025
√5 2 2

Example 7. What is the 55th term in the Fibonacci Sequence using Binet’s formula?

Answer. Let 𝑛 = 55
 ++ ++
1 + √5 1 − √5
9 −9 2 :
2 :
𝑓++ = = 139 583 862 445
√5