Polish

Advanced/Compression/parts/0 intro.tex

@@ -27,8 +27,9 @@ How many bits will we need? \par
 
 
 \problem{}<naivelen>
-Similarly, we can use a na\"ive coding scheme to encode an $n$-symbol string over an alphabet of size $k$ \par
-using $n \times \lceil \log_2k \rceil$ bits. Convince yourself that this is true.
+Similarly, we can encode an $n$-symbol string over an alphabet of size $k$ \par
+using $n \times \lceil \log_2k \rceil$ bits. Show that this is true. \par
+\note[Note]{We'll call this the \textit{na\"ive coding scheme}.}
 
 
 \vfill