ashleygrl87
New member
- Joined
- Apr 3, 2010
- Messages
- 1
Solve the recurrence relation subject to the initial conditions; the solutions involve complex numbers
Prove that the number of binary strings of length n with no two consecutive 0s is given by the Fibonacci sequence term F (n+2). (hint: Write a recurrence relation; consider stings length n that end in 1 and those that end in 0)
Prove that the number of binary strings of length n with no two consecutive 0s is given by the Fibonacci sequence term F (n+2). (hint: Write a recurrence relation; consider stings length n that end in 1 and those that end in 0)