diff b34550f..6fbd3ac 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 2d12bd6..0ed628a 100644
--- a/subset_sum_2_power_0_49n_v2.txt
+++ b/subset_sum_2_power_0_49n_v2.txt
@@ -220,7 +220,7 @@ LEMMA 6 (Random-prime collisions). There are absolute constants K, L_*
such that: for L >= L_*, let p be uniform among primes in [2^L, 2^(L+1)).
If D is a nonzero integer with |D| < 2^B, B >= 1, then
Pr[ D = 0 (mod p) ] <= K * B * L * 2^(-L).
-The same bound applies to two fixed unequal integers whose difference has
+The same bound applies to two fixed uneual integers whose difference has
absolute value < 2^B (apply it to the difference).
Proof. The prime number theorem (with the explicit form of Rosser and
@@ -359,7 +359,7 @@ B_j of size d_j = Theta(sqrt n). For a frequency, its PATTERN pi records,
per block, rational approximations D_j, A_j, E_j to the block averages of
D, A, E at the coordinates x_i(k), each to error <= eps, rounded so that
D_j >= 0, A_j <= D_j, E_j <= D_j (possible because of the true entropy
-inequalities). The set of all such grid triples has size
+ineualities). The set of all such grid triples has size
Q_n = |patterns| = 2^(O(sqrt n)). We enumerate PATTERNS, not frequencies.
Put D_pi = (1/n) sum_j d_j D_j, and likewise A_pi, E_pi, and
@@ -841,7 +841,7 @@ rules do not. That is exactly the quantifier of Theorem 1. END.
================================================================
APPENDIX A. THE NUMERICAL CERTIFICATE FOR PROPOSITION 7
================================================================
-We must prove the two circle inequalities of Proposition 7. All integrals
+We must prove the two circle ineualities of Proposition 7. All integrals
are normalized circle integrals; all decimals denote the indicated exact
rationals. Three error sources are controlled in order: finite rational
interval arithmetic on a 64-point grid; inner quadrature (integrand at grid