Mock AIME 2 2006-2007 Problems/Problem 13

Revision as of 12:03, 10 February 2008 by 1=2 (talk | contribs) (wikify, and I don't have a solution.)


In his spare time, Richard Rusczyk shuffles a standard deck of 52 playing cards. He then turns the cards up one by one from the top of the deck until the third ace appears. If the expected (average) number of cards Richard will turn up is $m/n,$ where $m$ and $n$ are relatively prime positive integers, find $m+n.$


This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

Problem Source

4everwise thought of this problem when watching Round 4 of the Professional Poker Tour. (What else can one do during the commercial breaks? Razz.gif

Invalid username
Login to AoPS