The negative hypergeometric distribution describes probabilities for when sampling from a finite population without replacement in which each sample can be classified into two mutually exclusive categories: NHGeom(w,b,r) (Introduction to Probability, Second EditionJoseph K. Blitzstein, Jessica Hwang pages 168-169)
P(X=k)=(r+k−1w+b)(r−1w)(kb)⋅w+b−r−k+1w−r+1
The expected value of NHGeom(w,b,r) is
E(X)=w+1rb If we shuffle a deck of cards and deal them one at a time, the number of cards dealt before uncoveeering the first ace is NHGeom(4,48,1).
P(X=k)=(1+k−14+48)(1−14)(k48)⋅4+48−1−k+14−1+1==(k52)(04)(k48)⋅52−k4 (a) The probability that you will first cut an ace on the 5th cut is
P(X=5−1)=(452)(04)(448)⋅52−44==4!(52−4)!52!1⋅4!(48−4)!48!⋅484=541453243≈0.0599 Or
5248⋅5147⋅5046⋅4945⋅484=541453243≈0.0599
(b) The probability that you will first cut an ace in fewer than 4 cuts is
P(X=1−1)+P(X=2−1)+P(X=3−1)==524+5248⋅514+5248⋅5147⋅504=55251201≈0.2174
(c) The expected waiting time before you cut an ace is
E(X)=4+11⋅48=548=9.6
Comments