deletions | additions       diff --git a/beginproblem__Consid.tex b/beginproblem__Consid.tex  index c4ee21c..d1441c9 100644  --- a/beginproblem__Consid.tex  +++ b/beginproblem__Consid.tex 
...
\\  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}$ $2*Z_{n-1}$.  \\  However, if the string ends with $2$, the number preceding it must be $0$, since we cannot have the sequence $12$ or $22$. This gives us $Z_{n-2}