An Easy Proof of a Weak Version of Chernoff inequality
Probability
2025-07-08 v2 Data Structures and Algorithms
Combinatorics
Abstract
We prove an easy but very weak version of Chernoff inequality. Namely, that the probability that in throws of a fair coin, one gets at most heads is .
Cite
@article{arxiv.2507.02759,
title = {An Easy Proof of a Weak Version of Chernoff inequality},
author = {Sariel Har-Peled},
journal= {arXiv preprint arXiv:2507.02759},
year = {2025}
}