diff --git a/Changes b/Changes
--- a/Changes
+++ b/Changes
@@ -1,3 +1,5 @@
+0.1.0.2:
+    Fixed doc bugs
 0.1.0.1:
     Elaborate on overflow, work more on native Ints in Eratosthenes
 0.1.0.0:
diff --git a/Math/NumberTheory/Primes/Sieve.hs b/Math/NumberTheory/Primes/Sieve.hs
--- a/Math/NumberTheory/Primes/Sieve.hs
+++ b/Math/NumberTheory/Primes/Sieve.hs
@@ -18,6 +18,7 @@
 module Math.NumberTheory.Primes.Sieve
     ( -- * Limitations
       -- $limits
+
       -- * Sieves and lists
       primes
     , sieveFrom
@@ -41,7 +42,7 @@
 -- (3) The internal representation of the state
 --
 -- An Eratosthenes type sieve needs to store the primes up to the square root of
--- the currently sieved region, thus requires @/O/(n\/log n)@ space.We store @16@ bytes
+-- the currently sieved region, thus requires @/O/(sqrt n\/log n)@ space.We store @16@ bytes
 -- of information per prime, thus a Gigabyte of memory takes you to about @1.6*10^18@.
 -- The @log@ doesn't change much in that range, so as a first approximation, doubling
 -- the storage increases the sieve range by a factor of four.
diff --git a/arithmoi.cabal b/arithmoi.cabal
--- a/arithmoi.cabal
+++ b/arithmoi.cabal
@@ -1,5 +1,5 @@
 name                : arithmoi
-version             : 0.1.0.1
+version             : 0.1.0.2
 cabal-version       : >= 1.6
 author              : Daniel Fischer
 copyright           : (c) 2011 Daniel Fischer