459 views

1 Answer

0 votes
0 votes
we can easily verify options for

a0= 0,

a1=0, a2=1, a3=2(001,100) ;a4=5 (0010,0011,0100,1100,1001)

 

so this will be satisfied by only D ; answer is D

Related questions

22 votes
22 votes
1 answer
1
P C asked Dec 31, 2022
1,617 views
What is the recurrence relation for the ternary strings of length $n$ which can be constructed using 0,1 or 2 only such that the number of 0’s and number of 1's is od...
1 votes
1 votes
2 answers
2
aditi19 asked May 14, 2019
861 views
What will be solution of recurrence relation if roots are like this: r1=-2, r2=2, r3=-2, r4=2is this the case of repetitive roots?
0 votes
0 votes
0 answers
3
0 votes
0 votes
0 answers
4
aditi19 asked May 13, 2019
656 views
Consider the nonhomogeneous linear recurrence relation $a_n$=$3a_{n-1}$+$2^n$in the book solution is given $a_n$=$-2^{n+1}$but I’m getting $a_n$=$3^{n+1}-2^{n+1}$