2007 Alabama ARML TST Problems/Problem 8
Problem
Krugman is a little odd. Really odd actually. He has a collection of Massachusetts state quarters and New Hampshire state quarters. All 29 of his Massachusetts quarters are kept face up, while all 11 of his New Hampshire quarters are kept face down on display in his office. Eric, being the prankster that he is, sneaks into Krugman’s office and randomly turns over 20 of Krugman’s quarters. Find the expected number of Krugman’s quarters that are heads up when Eric is ﬁnished.
Solution
Solution 1
First thing to note is that once we know the number of New Hampshire quarters Eric flipped, we know the final number of quarters that are heads up: These will be the flipped New Hampshire quarters, and the not flipped Massachusetts quarters.
We could now solve the task by brute force: for each we can compute the probability that Eric flips exactly of the New Hampshire quarters, and then compute the sum .
However, one more observation can help us avoid this tedious computation: The number of quarters Eric flips is in this case exactly one half of the total number of quarters. We can now take all the possibilities which quarters Eric picked, and divide them into complementary pairs.
Pick one such pair. If Eric flipped of the New Hampshire quarters in one of the possibilities, he flipped the other New Hampshire quarters in the other possibility. In the first case, he would get quarters heads up, in the second case there would be such quarters. The average of these two values is . And as this holds for each pair of possibilities, the expected number of quarters that are heads up is obviously .
Solution 2
As the number of quarters Eric flips is in this case exactly one half of the total number of quarters, each quarter has probability that it will be flipped. Therefore for each quarter the probability that it will be heads up at the end is , and the expected number of quarters that are heads up is .
See also
2007 Alabama ARML TST (Problems) | ||
Preceded by: Problem 7 |
Followed by: Problem 9 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 |