deletions | additions       diff --git a/a) Number of blits.tex b/a) Number of blits.tex  index 8299d93..595ee3c 100644  --- a/a) Number of blits.tex  +++ b/a) Number of blits.tex 
...
For $n = 2^x$ we try the algorithm for incremental sizes of $x$ to find a pattern for how the algorithm behaves.  \begin{subequations}  \begin{split} \begin{align}  T(2^1) &= 5\\  T(2^2) &= 5 + 5 * 2^2\\  T(2^3) &= 5 + 5 * 2^2 + 5 * 2^4\\  T(2^4) &= 5 + 5 * 2^2 + 5 * 2^4 + 5 * 2^6\\  T(2^5) &= 5 + 5 * 2^2 + 5 * 2^4 + 5 * 2^6 + 5 * 2^8  \end{split} \end{align}  \end{subequations}  Given that: