P

Initializing...

Lemma 1 — success probability of the $k$-max algorithm (corrected: $\ge kp^k(1-p)$, and $=kp^k(1-p)+p^n$ for increasing order, $n\ge k+1$) · Prove2Me