An Easy Proof of a Weak Version of Chernoff inequality
An Easy Proof of a Weak Version of Chernoff inequality
We prove an easy but very weak version of Chernoff inequality. Namely, that the probability that in $6M$ throws of a fair coin, one gets at most $M$ heads is $\leq 1/2^M$.
Sariel Har-Peled
数学
Sariel Har-Peled.An Easy Proof of a Weak Version of Chernoff inequality[EB/OL].(2025-07-04)[2025-07-16].https://arxiv.org/abs/2507.02759.点此复制
评论