diff --git a/06-resizing/README.md b/06-resizing/README.md
index 8d41d6b..75fdfca 100644
--- a/06-resizing/README.md
+++ b/06-resizing/README.md
@@ -28,12 +28,13 @@ first prime larger than the base size. To resize up, we double the base size,
 and find the first larger prime, and to resize down, we halve the size and
 find the next larger prime.
 
-Our base sizes start at 50. Instead of storing
+Our base sizes start at 50.
 
-We use a brute-force method to find the next prime, by checking if each
-successive number is prime. While brute-forcing anything sounds alarming, the
-number of values we actually have to check is low, and the time it takes is
-outweighed by the time spent re-hashing every item in the table.
+Instead of storing a list of primes, we use a brute-force approach to find the
+next one by checking each successive number for primality. While brute-forcing
+anything sounds alarming, the number of values we actually have to check is low,
+and the time it takes is outweighed by the time spent re-hashing every item in
+the table.
 
 First, let's define a function for finding the next prime. We'll do this in two
 new files, `prime.h` and `prime.c`.