diff 9e211a6..9506729 subset_sum_2_power_0_49n_v2.txt
diff --git a/subset_sum_2_power_0_49n_v2.txt b/subset_sum_2_power_0_49n_v2.txt
index 59ed6b6..a900efb 100644
--- a/subset_sum_2_power_0_49n_v2.txt
+++ b/subset_sum_2_power_0_49n_v2.txt
@@ -189,7 +189,7 @@ is O(1/n), uniformly in the fixed weights.
Proof. Sample a uniform floor(n/2)-element set V (returning CONTINUE if
the capped sampler fails). Build the two SORTED lists of DISTINCT subset
-sums on V and on [n]\V, one side at a time. Start from {0}; insert index
+sums on V and on [n] minus V, one side at a time. Start from {0}; insert index
i by merging the current list with its translate by c_i and dropping
duplicates. Cap every list at B_n = 2^(ceil(0.489985n)). If a merge
exceeds B_n distinct entries, stop and return CONTINUE. Otherwise, for