Skip to content
Get started

Chernoff bound on a lopsided coin count

A fair coin is flipped 100100 times. Using the optimised Chernoff bound P(S≥a)≤min⁡t>0e−taE[etS]P(S\ge a)\le\min_{t>0}e^{-ta}E[e^{tS}], bound the probability of at least 7575 heads.

Give the bound in units of 10−610^{-6}, to 2 decimals.

Show hints (2)+
  1. Apply Markov's inequality to etSe^{tS} and factor the MGF over the 100 flips.
  2. The optimal tt satisfies et/(1+et)=0.75e^t/(1+e^t)=0.75.

Answer

Reveal answer →

2.08 (± 0.03)

Create a free account to see the full worked solution and track your progress.

Interview format: Market Maker, Systematic & Data-Driven Trading

Related questions