USAMO
1975


Problem - 3464
A deck of $ n$ playing cards, which contains three aces, is shuffled at random (it is assumed that all possible card distributions are equally likely). The cards are then turned up one by one from the top until the second ace appears. Prove that the expected (average) number of cards to be turned up is $ (n+1)/2$.

report an error