edited by
431 views
1 votes
1 votes
A bit string is called legitimate if it contains no consecutive zeros $, e.g., 0101110$ is legitimate, where as $10100111$ is not. Let $a_n$ denote the number of legitimate bit strings of length $n$. Define $a_0=1$. Derive a recurrence relation for $a_n ( i.e.,$  express $a_n$ in terms of the preceding $a_i's).$
edited by

2 Answers

Related questions

0 votes
0 votes
2 answers
1
go_editor asked Sep 18, 2018
416 views
Let $n$ be a fixed positive integer. For any real number $x,$ if for some integer $q,$ $$x=qn+r, \: \: \: 0 \leq r < n,$$ then we define $x \text{ mod } n=r$.Specify the...
1 votes
1 votes
1 answer
2
go_editor asked Sep 18, 2018
468 views
If $\alpha, \beta, \gamma$ are the roots of the equation $x^3+6x+1=0$, then prove that $$\frac{\alpha}{\beta} + \frac{\beta}{\alpha} + \frac{\beta}{\gamma}+ \frac{\gamma}...