deletions | additions       diff --git a/beginproblem__Consid.tex b/beginproblem__Consid.tex  index 71e5a0c..903466c 100644  --- a/beginproblem__Consid.tex  +++ b/beginproblem__Consid.tex 
...
\\  $Z_3 = 17$  \\  $(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}$.  \\ 
...
Therefore, the recurrence relation is  \\  $Z_n = 2*Z_{n-1}+Z_{n-2}$  \\