Difference between revisions of "1975 USAMO Problems/Problem 5"
God of Math (talk | contribs) (→Solution) |
m (→Solution 3) |
||
(16 intermediate revisions by 6 users not shown) | |||
Line 2: | Line 2: | ||
A deck of <math>n</math> 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 <math>(n+1)/2</math>. | A deck of <math>n</math> 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 <math>(n+1)/2</math>. | ||
− | ==Solution== | + | ==Solutions== |
+ | ===Solution 1=== | ||
− | + | We begin by induction. Our base case is naturally when <math>n = 3</math>, as there can be no less than <math>3</math> cards in the deck. The only way to turn up the second ace is to turn up the first, and then turn up the second, which requires <math>2</math> moves. This indeed is equal to <math>(3 + 1)/2</math>. Next, we assume that the expected number of cards required to pull the second ace from a deck of n cards is in fact <math>(n + 1)/2</math>. Now, we see that to simulate the case with <math>n + 1</math> cards, we simply must add a card to our deck. By our assumption, we can expect to turn up <math>(n + 1)/2</math> cards to be turned up, including our second ace. Thus ahead of our second ace, we expect <math>(n - 1)/2</math> cards , and after it <math>(n - 1)/2</math> as well. When we add our card, it is ahead of the second ace half the time, and behind if half the time. Therefore we expect to add one card to the number of cards drawn half the time, and add nothing for half the time. Hence we expect to add half a card, and the expected value is now <math>((n + 1)/2) + 1/2)</math>, or <math>(n + 2)/2</math>, the desired outcome for the <math>n + 1</math> case. | |
− | ==See | + | ===Solution 2=== |
+ | |||
+ | Although we can induct as in the situation above, we can use a more direct approach. | ||
+ | |||
+ | Consider a deck. The second ace is in the <math>k</math>th place. If we draw the deck backwards (which has equal probability as drawing it forwards), then we will draw it in the <math>n+1-k</math>th place, since the <math>n</math>th place will become the first, the <math>n-1</math>th the second, etc. | ||
+ | |||
+ | Also, note that when second ace is still the second ace when we draw the deck backwards. (we need to note this, else this argument holds for the first ace and third ace as well) | ||
+ | |||
+ | Now, this implies that the expected location of the second ace is in the <math>(k+n+1-k)/2=(n+1)/2</math> place. | ||
+ | |||
+ | |||
+ | ===Solution 3=== | ||
+ | |||
+ | Like Solution 2, this solution is also a direct solution. | ||
+ | |||
+ | The three aces divide the deck into four piles with a non-negative number of cards. Let <math>a</math>, <math>b</math>, <math>c</math>, and <math>d</math> be the number of cards in the first, second, third, and fourth piles, respectively, given a random deck <math>D</math>. Also, let <math>E(a), E(b), E(c), E(d)</math> denote the expected value of <math>a</math>, <math>b</math>, <math>c</math>, and <math>d</math> over all decks <math>D</math>. Then <math>a + b + c + d = n - 3</math> (the deck minus the three aces). | ||
+ | |||
+ | For every deck <math>D</math>, there must exist other decks that permute the values of <math>a</math>, <math>b</math>, <math>c</math>, <math>d</math>. (i.e. if there is a deck with <math>a = 2, b = 3, c = 1, d = 4,</math> there exists a deck with <math>a = 1, b = 2, c = 3, d = 4</math>.) Therefore, the value of <math>a</math> over all decks <math>D</math> is a permutation of the value of <math>b</math> over all such decks, and as a result <math>E(a) = E(b)</math>. A similar result holds for <math>b</math>, <math>c</math>, and <math>d</math>, and so <math>E(a) = E(b) = E(c) = E(d)</math>. Because <cmath>E(a) + E(b) + E(c) + E(d) = E(a + b + c + d) = E(n-3) = n-3,</cmath> <math>E(a) = E(b) = \frac{n-3}{4}</math>. We want to compute the number of cards up to and including the second ace, which is just <cmath>E(a) + 1 + E(b) + 1 = \frac{n-3}{2} + 2 = \frac{n+1}{2},</cmath> as desired. | ||
+ | |||
+ | |||
+ | {{alternate solutions}} | ||
+ | |||
+ | ==See Also== | ||
{{USAMO box|year=1975|num-b=4|after=Last Question}} | {{USAMO box|year=1975|num-b=4|after=Last Question}} | ||
+ | {{MAA Notice}} | ||
[[Category:Olympiad Combinatorics Problems]] | [[Category:Olympiad Combinatorics Problems]] |
Latest revision as of 02:30, 30 December 2017
Problem
A deck of 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 .
Solutions
Solution 1
We begin by induction. Our base case is naturally when , as there can be no less than cards in the deck. The only way to turn up the second ace is to turn up the first, and then turn up the second, which requires moves. This indeed is equal to . Next, we assume that the expected number of cards required to pull the second ace from a deck of n cards is in fact . Now, we see that to simulate the case with cards, we simply must add a card to our deck. By our assumption, we can expect to turn up cards to be turned up, including our second ace. Thus ahead of our second ace, we expect cards , and after it as well. When we add our card, it is ahead of the second ace half the time, and behind if half the time. Therefore we expect to add one card to the number of cards drawn half the time, and add nothing for half the time. Hence we expect to add half a card, and the expected value is now , or , the desired outcome for the case.
Solution 2
Although we can induct as in the situation above, we can use a more direct approach.
Consider a deck. The second ace is in the th place. If we draw the deck backwards (which has equal probability as drawing it forwards), then we will draw it in the th place, since the th place will become the first, the th the second, etc.
Also, note that when second ace is still the second ace when we draw the deck backwards. (we need to note this, else this argument holds for the first ace and third ace as well)
Now, this implies that the expected location of the second ace is in the place.
Solution 3
Like Solution 2, this solution is also a direct solution.
The three aces divide the deck into four piles with a non-negative number of cards. Let , , , and be the number of cards in the first, second, third, and fourth piles, respectively, given a random deck . Also, let denote the expected value of , , , and over all decks . Then (the deck minus the three aces).
For every deck , there must exist other decks that permute the values of , , , . (i.e. if there is a deck with there exists a deck with .) Therefore, the value of over all decks is a permutation of the value of over all such decks, and as a result . A similar result holds for , , and , and so . Because . We want to compute the number of cards up to and including the second ace, which is just as desired.
Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.
See Also
1975 USAMO (Problems • Resources) | ||
Preceded by Problem 4 |
Followed by Last Question | |
1 • 2 • 3 • 4 • 5 | ||
All USAMO Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.