diff --git a/README.md b/README.md
index d379051..9b4f8cb 100644
--- a/README.md
+++ b/README.md
@@ -80,4 +80,4 @@ This project licensed under BSD-3-Clause (except for `.gitignore`, which is
 under CC0-1.0), and follows [REUSE](https://reuse.software) licensing
 principles.
 
-[^1]: Note that this is really the Sieve of Erastosthenes, as defined in the classic [The Genuine Sieve of Eratosthenes](https://www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf). Constrast this to other simple prime generation implementations, such as <pre> primes = sieve [2..] where sieve (p : xs) = p : sieve [x | x <- xs, x \`rem\` p > 0]</pre> which are actually trial division and not faithful implementations of the Sieve of Erastosthenes.
+[^1]: Note that this is really the Sieve of Erastosthenes, as defined in the classic [The Genuine Sieve of Eratosthenes](https://www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf). Constrast this to other simple prime generation implementations, such as <pre> primes = sieve [2..] where sieve (p : xs) = p : sieve [x | x <- xs, x \`rem\` p > 0]</pre> which is actually trial division and not faithful implementations of the Sieve of Erastosthenes.
diff --git a/docs/ALGORITHM.md b/docs/ALGORITHM.md
index b5d1697..a9dac8c 100644
--- a/docs/ALGORITHM.md
+++ b/docs/ALGORITHM.md
@@ -221,4 +221,4 @@ applyMerge f xs ys =
 However, `mergeAll` uses $O(n)$ auxiliary space in the worst case, while our
 implementation of `applyMerge` uses just $O(\sqrt{n})$ auxiliary space.
 
-[^1]: Note that this is really the Sieve of Erastosthenes, as defined in the classic [The Genuine Sieve of Eratosthenes](https://www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf). Constrast this to other simple prime generation implementations, such as <pre> primes = sieve [2..] where sieve (p : xs) = p : sieve [x | x <- xs, x \`rem\` p > 0]</pre> which are actually trial division and not faithful implementations of the Sieve of Erastosthenes.
+[^1]: Note that this is really the Sieve of Erastosthenes, as defined in the classic [The Genuine Sieve of Eratosthenes](https://www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf). Constrast this to other simple prime generation implementations, such as <pre> primes = sieve [2..] where sieve (p : xs) = p : sieve [x | x <- xs, x \`rem\` p > 0]</pre> which is actually trial division and not faithful implementations of the Sieve of Erastosthenes.