diff --git a/exact_quantum_factoring_v2.txt b/exact_quantum_factoring_v2.txt
index f91d137..453a17f 100644
--- a/exact_quantum_factoring_v2.txt
+++ b/exact_quantum_factoring_v2.txt
@@ -95,7 +95,7 @@ First, an order trial whose mass on the true order is a prescribed
 dyadic rational. For a unit a modulo m, its order r is the least
 positive integer with a^r = 1 pmod m. The trial returns no
 candidate, or a positive multiple of r, and the probability of
-returning r is exactly varphi(r)lambda(r), where
+returning r is exactly phi(r)lambda(r), where
 lambda(d) = 2^{-lceillog_2 drceil - 10}. The construction uses a
 phase register that realizes a piecewise-linear interpolant g of the
 complex exponential e(z) = exp(-2pi i z). Controlled modular shifts
@@ -183,7 +183,7 @@ otherwise; every logarithm in a bit bound is base two.
 
 Definition 1. For an input integer N ge 2, set
 
-    n = max{128, lfloorlog_2 Nrfloor + 1},   B = 2^n.
+    n = max{128, floor(log_2 N) + 1},   B = 2^n.
 
 Then N < B. The cutoff at 128 is a fixed constant; it has no effect
 on polynomial-time uniformity and simplifies every strict inequality