diff --git a/06-hash/hash.tex b/06-hash/hash.tex
index 55675d66ef9672d115108c81f63649f57cecab97..d5b0eb79c2a0e77287dc7118b0854a36f92c8c4d 100644
--- a/06-hash/hash.tex
+++ b/06-hash/hash.tex
@@ -635,6 +635,10 @@ $f$,~$g$ chosen at random from a~$\lceil 6\log n\rceil$-independent family.
 Then the expected time complexity of \alg{Insert} is $\O(1)$.
 }
 
+\note{
+Setting the timeout to $\lceil 6\log m\rceil$ also works.
+}
+
 \note{
 It is also known that a~6-independent family is not sufficient to guarantee
 expected constant insertion time, while tabulation hashing (even though