{"ID":2898830,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2507.02759","arxiv_id":"2507.02759","title":"An Easy Proof of a Weak Version of Chernoff inequality","abstract":"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$.","short_abstract":"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$.","url_abs":"https://arxiv.org/abs/2507.02759","url_pdf":"https://arxiv.org/pdf/2507.02759v2","authors":"[\"Sariel Har-Peled\"]","published":"2025-07-03T16:21:00Z","proceeding":"math.PR","tasks":"[\"math.PR\",\"cs.DS\",\"math.CO\"]","methods":"[]","has_code":false}