You have probably heard a similar problem from 50 challenging problems in probability:
"How many cards do I have to draw until I obtain an ace from a standard deck of playing cards?"
The answer for the above problem is 10.6, which can be obtain through manual calculation or using partitions.
I wanted to extend this problem to drawing two cards of a set, and I was wondering how this could be done.
My initial thoughts on the two approaches were:
Brute force approach:
$E[\text{two kings}] = P[\text{two kings in 2 draws}]\times2 + P[\text{two kings in 3 draws}]\times 3 + \dots + P[\text{two kings in 52 draws}]\times 52$
$E[X] = (\frac{4}{52} \frac{3}{51} 2) + {2 \choose 1} (\frac{4}{52}\frac{48}{51}\frac{3}{50}) + \dots + {52 \choose 1} (\frac{4}{52} \frac{48}{51} \dots \frac{1}{1})$
Partition Approach:
$E[\text{two kings}] = E[\text{second king|first king}] + E[\text{first king}]$
And this is where I draw a blank, if I take the average value of the first king here, I get 10.6, and the partition approach no longer works. Any assistance on this would be great.