deletions | additions       diff --git a/stuff.tex b/stuff.tex  index 607be39..974729c 100644  --- a/stuff.tex  +++ b/stuff.tex 
...
We hypothesize that:  \[T(2^n) = n(5 \cdot 2^{2(n-1)})\]  \begin{proof} \textbf{Proof by induction:}  We have already seen that it holds for the base cases $n \in \{0, 1, 2, 3, 4\}$:  Now we show that the above expression is true for all $n \geq 0$: 
...
&= (n + 1)(5 \cdot 2^{2n})  \end{split}  \end{equation}  \end{proof} \blacksquare  Which gives us that:  \begin{equation}