Let be a sequence satisfying the Fibonacci recurrence relation such that where Find without using brute force.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
g(2)=g(1)+g(0)=2-1=1 given that it satisfies fibonacci recurrence relation the series becomes---->2,-1,1,0,1,1,2.......... g(6)=2