Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion 60C05-ApproximatingTheBirthdayProblem.tex
Original file line number Diff line number Diff line change
Expand Up @@ -152,7 +152,7 @@
We also see that if we wish to have an outcome with probability $\varepsilon>0$ of no matches then we can estimate the sample size by:
\[\varepsilon=p(N,k)\approx e^{-k^2/2N};\qquad k\approx \sqrt{2N \ln \frac{1}{\varepsilon}}.\]
So the number of samples required to find a match with probability $\varepsilon>0$ is approximately
\[k=\sqrt{2N\frac{1}{1-\varepsilon}}.\]
\[k=\sqrt{2N \ln \frac{1}{1-\varepsilon}}.\]

\begin{thebibliography}{9}
\bibitem{Wikipedia}
Expand Down