diff --git a/cw/cw.tex b/cw/cw.tex
index 71cc543..29f51d4 100644
--- a/cw/cw.tex
+++ b/cw/cw.tex
@@ -51,7 +51,9 @@
 	\section*{1}
 	\subsection*{1.1}
 	key: JDQLWBSNZM
+
 	w1: MONISTICAL
+
 	w2: APHRODITES
 	\subsection*{1.2}
 		The first step was to load all the words from the word list into a tree, where each depth of the tree corresponds with an $i$th letter of the word. The branches that come off each node correspond to the next letter of the word.i.e.
@@ -63,7 +65,7 @@
 
 		Would generate a tree that looks like:
 
-		$$() ->{a->{a, b}, b->{a}}$$
+		$$()\to(a\to(a, b), b\to(a))$$
 
 		Since the words were encrypted with the same key, that means if we were to generate a possible key, that key would need to decrypt both ciphertexts such that when the tree is navigated we navigate to nodes that exist. If the key results in a path in the tree that does not exist, then we can disregard that answer as a possible key and continue with the possible next key.
 		Once you find a key that is the same length as the cipher text, we know that we found the right key.