Theory 1

Bernoulli: XBer(p)

  • Indicates a win.
  • PX(1)=p,PX(0)=q
  • E[X]=p
  • Var[X]=pq

Binomial: XBin(n,p)

  • Counts number of wins.
  • PX(k)=(nk)pkqnk
  • E[X]=np
  • Var[X]=npq

Geometric: XGeom(p)

  • Counts discrete wait time until first win.
  • PX(k)=qk1p
  • E[X]=1p
  • Var[X]=qp2

Pascal: XPasc(,p)

  • Counts discrete wait time until th win.
  • PX(k)=(k11)qkp
  • E[X]=p
  • Var[X]=qp2

Poisson: XPois(λ)

  • Counts “arrivals” during time interval.
  • PX(k)=eλλkk!
  • E[X]=λ
  • Var[X]=λ