Ask Question
5 November, 00:07

The Fibonacci numbers are defined by the recursive formula t1 = 0, t2 = 1, tn - 1 + tn - 2, where n ∈ N and n > 2. What are the first 9 Fibonacci numbers?

A) 0, 1, 1, 2, 3, 5, 8, 13, 21

B) 0, 1, 2, 3, 4, 7, 11, 18, 29

D) 0, 1, 2, 3, 6, 9, 15, 24, 39

(Don't worry about C)

+1
Answers (1)
  1. 5 November, 01:26
    0
    Basically fibonachi is

    the 1st term+term before first term=2nd term

    3rd term=1st term+2nd term

    4th term=2nd term+3rd term

    etc

    starting with t1=0 and t2=1

    0,1

    add them to get next

    0+1=1

    now we have

    0,1,1

    1+1=2

    now we have

    0,1,1,2

    1+2=3

    now we have

    0,1,1,2,3

    2+3=5

    now we have

    0,1,1,2,3,5

    3+5=8

    now we have

    0,1,1,2,3,5,8

    5+8=13

    now we have

    0,1,1,2,3,5,8,13

    8+13=21

    now we have

    0,1,1,2,3,5,8,13,21

    answer is A
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “The Fibonacci numbers are defined by the recursive formula t1 = 0, t2 = 1, tn - 1 + tn - 2, where n ∈ N and n > 2. What are the first 9 ...” in 📘 Mathematics if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers