Proof of Theorem 2, p.20 — Threshold Add makes at most $n$ queries and Algorithm 1 at most $n(1+L)$ (corrected: $k=1$)

Initializing...

Proof of Theorem 2, p.20 — Threshold Add makes at most $n$ queries and Algorithm 1 at most $n(1+L)$ (corrected: $k=1$) · Prove2Me