deletions | additions       diff --git a/a) Number of blits.tex b/a) Number of blits.tex  index 2299295..e900f9b 100644  --- a/a) Number of blits.tex  +++ b/a) Number of blits.tex 
...
\section{Number of blits}  The recursive algorithm can be expressed as having the cost:  $f(n) = \begin{cases} n/2, & \mbox{if } n\mbox{ is even} \\ 3n+1, & \mbox{if } n\mbox{ is odd} \end{cases}$  \[T(n) &= \left{(n = 2) ? 5 : 5 + 4 T(n / 2)\]  \[f(n) &= \begin{cases} 5, & n = 2\\ 5 + 4 T(n / 2), & n \not 2  \end{cases}  \] 2\end{cases}\]  \[T(n) &= (n = 2) ? 5 : 5 + 4 T(n / 2)\]