Dat Do edited beginproblem__Consid.tex  almost 10 years ago

Commit id: a560741bca6f95db4ee15880b8ee567f90c18633

deletions | additions      

       

\\  $Z_3 = 17$  \\  $(a)$ (a)  To compute the recurrence, we can look at the possible endings for the strings. \\  In the event that the string ends with a $0$ or $1$, any other number can precede this instance. Giving us $2*Z_{n-1}$.  \\