Thus the probability that the algorithm succeeds is at least 1 − ( 1 − 2 n ( n − 1 ) ) m {\displaystyle 1-\left(1-{\frac {2}{n(n-1)}}\right)^{m}} .
Zato je verovatnoća da algoritam uspe najmanje 1 − ( 1 − 2 n ( n − 1 ) ) m {\displaystyle 1-\left(1-{\frac {2}{n(n-1)}}\right)^{m}} .