Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Recursionmedium
0:00.0

Let wnw_nwn​ be the number of binary strings of length nnn with no two consecutive 1s. We know wn=wn−1+wn−2w_n = w_{n-1} + w_{n-2}wn​=wn−1​+wn−2​. If we define vnv_nvn​ as the number of binary strings of length nnn with no two consecutive 1s AND ending with a 0, what is the recurrence relation for vnv_nvn​?