diff --git a/pages/CSE347/CSE347_L9.md b/pages/CSE347/CSE347_L9.md
index f643ea2..09239f6 100644
--- a/pages/CSE347/CSE347_L9.md
+++ b/pages/CSE347/CSE347_L9.md
@@ -85,7 +85,7 @@ Claim: If we choose $h$ randomly from a universal family of hash functions, $H$,
 
 Question: What are some good properties and what does it mean by with high probability?
 
-Claim: Given a universal family of hash functions, $H$, $S=\{a_1,a_2,\cdots,a_n\}\subset \mathbb{N}$. For any probability $0\leq \delta\leq 1$, if $n\leq \sqrt{4m\delta}$, the chance that no two keys hash to the same slot is $\geq1-\delta$.
+Claim: Given a universal family of hash functions, $H$, $S=\{a_1,a_2,\cdots,a_n\}\subset \mathbb{N}$. For any probability $0\leq \delta\leq 1$, if $n\leq \sqrt{2m\delta}$, the chance that no two keys hash to the same slot is $\geq1-\delta$.
 
 Example: If we pick $\delta=\frac{1}{2}$. As long as $n<\sqrt{2m}$, the chance that no two keys hash to the same slot is $\geq\frac{1}{2}$.