find the value?

Question

If g (0)=1,g (1)=1 and g (n)= g (n-1) + g (n –2). Find g (6).
a) 9 b) 13 c) 21 d) 7

with clear steps plz

Answer 1

g(2) = g(1) + g(0) = 1 + 1 = 2
etc ...

Answer 2

The Fibonacci sequence is defined the same way: each term is the sum of the two terms just before it. If the first two terms are arbitrarily defined as 1 and 1, then:
g(2) = 1 + 1 = 2
g(3) = 2 + 1 = 3
g(4) = 3 + 2 = 5
g(5) = 5 + 3 = 8
g(6) = 8 + 5 = 13

So the correct answer is b) 13.

Answer 3

You have been given a formula g which is

g(n) = g(n-1) + g(n-2)
we know g(0) = 1 and g(1) = 1

so from the formula we get g(2) = g(1)+g(0) = 1 + 1 (from above)
so g(2) = 2

We then continue this for all the values of g up to g(6)
so g(3) = g(2) + g(1) = 2 + 1 = 3

I am sure you can do the rest.

Answer 4

That's just the Fibonacci sequence, with a slightly different starting point. Normally,
g(0) = 0, g(1) = 1,
but the rule for generating the next number is the same,
g(n) = g(n-1) + g(n-2)

Answer 5

This is a Fibonacci sequence.

To find g(6), use the recurrence relation given: g(n) = g(n-1) + g(n-2).

First, compute g(2)=g(1)+g(0)=1+1=2.
Then compute g(3)=g(2)+g(1)
and so on, until you arrive at g(6).

Answer 6

g(6) = g(5) + g(4)
= g(4) + g(3) + g(3) + g(2) = g(4) + 2g(3) + g(2)
= g(3) + g(2) + 2[g(2) + g(1)] + g(1) + g(0)
= g(2) + g(1) + g(1) + g(0) + 2[g(1) + g(0) + g(1)] + g(1) + g(0)
= g(1) + g(0) + 2g(1) + g(0) + 2[g(1) + g(0) + g(1)] + g(1) + g(0)
= 1 + 1 + 2 + 1 + 2(3) + 1 + 1 = 13 ans: b

Answer 7

g(2)=1+1=2
g(3)=2+1=3
g(4)=3+2=5
g(5)=5+3=8
g(6)=8+5=13
if it fibonachi frequency

Answer 8

This is the famed Fibbonacci Series:
1,1,2,3,5,8,13,21,34.....

f(6)=13

Answer 9

right i think its like this:

1. if g(n)=g(n-1)+g(n-2) THEN
2. g(6) = (6-1)+(6-2)
3. g(6) = 5+4
4. g(6) = 9