src/Advanced/Fast Inverse Root/parts/00 int.typ

@@ -8,7 +8,7 @@ In this handout, we'll denote bit strings with the prefix `0b`. \
 That is, $1010 =$ "one thousand and one," while $#text([`0b1001`]) = 2^3 + 2^0 = 9$
 
 #v(2mm)
-We will separate long bit strings with underscores for readability. \
+We will seperate long bit strings with underscores for readability. \
 Underscores have no meaning: $#text([`0b1111_0000`]) = #text([`0b11110000`])$.
 
 #problem()

src/Advanced/Fast Inverse Root/parts/04 bonus.typ

@@ -1,6 +1,6 @@
 #import "@local/handout:0.1.0": *
 
-= Bonus -- More about Floats
+= Bonus: More about Floats
 
 #problem()
 Convince yourself that all numbers that can be represented as a float are rational.
@@ -8,29 +8,13 @@ Convince yourself that all numbers that can be represented as a float are ration
 #problem()
 Find a rational number that cannot be represented as a float.
 
-#v(1fr)
-
 #problem()
-What is the smallest positive 32-bit float?
+How many floats are between $0$ and $1$?
 
-#v(1fr)
-
-#problem()
-What is the largest positive 32-bit float?
-
-#v(1fr)
-
-#problem()
-How many floats are between $-1$ and $1$?
-
-#v(1fr)
 
 #problem()
 How many floats are between $1$ and $2$?
 
-#v(1fr)
 
 #problem()
 How many floats are between $1$ and $128$?
-
-#v(1fr)