Replace "ORMC" with generic "handout"

src/Intermediate/Proof Techniques/main.tex

@@ -3,7 +3,7 @@
 \documentclass[
 	solutions,
 	singlenumbering
-]{../../../lib/tex/ormc_handout}
+]{../../../lib/tex/handout}
 \usepackage{../../../lib/tex/macros}
 
 \usepackage{units}

src/Intermediate/Proof Techniques/parts/2 induction.tex

@@ -190,7 +190,7 @@ For example, see the proof of the statement in \ref{binomsum} on the next page.
 \pagebreak
 
 
-\begin{ORMCbox}{Alternative Proof}{ogrape!10!white}{ogrape}
+\begin{hobox}{Alternative Proof}{ogrape!10!white}{ogrape}
 	Consider the following problem: \par
 	How many ways are there to write a number $x$ as an ordered sum of positive integers? \par
 	\note{
@@ -234,7 +234,7 @@ For example, see the proof of the statement in \ref{binomsum} on the next page.
 	We've found that the number of ways to split $x$ can be written as either
 	$\sum_{n = 1}^{x-1} \binom{x-1}{n}$ or $2^{x-1}$,
 	and therefore $\sum_{n = 1}^{x-1} \binom{x-1}{n} = 2^{x-1}$.
-\end{ORMCbox}
+\end{hobox}
 
 
 \pagebreak