fmt

src/Warm-Ups/Adders/main.typ

@@ -46,10 +46,10 @@ Use two half adders to construct a full adder.
 
 #solution([
   $
-    s_1, c_1 &= "HA"(a, b) \
-    s_2, c_2 &= "HA"(s_1, c_"in") \
-    s_"out" &= s_2 \
-    c_"out" &= "OR"(c_1, c_2)
+    s_1, c_1 & = "HA"(a, b) \
+    s_2, c_2 & = "HA"(s_1, c_"in") \
+     s_"out" & = s_2 \
+     c_"out" & = "OR"(c_1, c_2)
   $
 
   #v(2mm)

src/Warm-Ups/Partition Products/main.typ

@@ -7,7 +7,7 @@
 
 #problem()
 Take any positive integer $n$. \
-Now, write it as sum of smaller positive integers: $n = a_1 + a_2 + ...  a_k$ \
+Now, write it as sum of smaller positive integers: $n = a_1 + a_2 + ... a_k$ \
 Maximize the product $a_1 #sym.times a_2 #sym.times ... #sym.times a_k$
 
 
@@ -17,7 +17,9 @@ Maximize the product $a_1 #sym.times a_2 #sym.times ... #sym.times a_k$
   Of course, all $a_i$ should be greater than $1$. \
   Also, all $a_i$ should be smaller than four, since $x <= x(x-2)$ if $x >= 4$. \
   Thus, we're left with sequences that only contain 2 and 3. \
-  #note([Note that two twos are the same as one four, but we exclude fours for simplicity.])
+  #note(
+    [Note that two twos are the same as one four, but we exclude fours for simplicity.],
+  )
 
   #v(2mm)