Fibonacci hype!

Let \(g_{0},g_{1},g_{2},...g_{n}\) be a sequence satisfying the Fibonacci recurrence relation such that \[g_{n}=g_{n-1}+g_{n-2}\]\[g_{0}=2, g_{1}=-1\] where \(2\leq n\) Find \(g_{6}\) without using brute force.

×

Problem Loading...

Note Loading...

Set Loading...