Difference between revisions of "2001 AMC 12 Problems/Problem 16"
Giratina150 (talk | contribs) (→Solution 1) |
Giratina150 (talk | contribs) (→Solution 1) |
||
Line 19: | Line 19: | ||
=== Solution 1 === | === Solution 1 === | ||
− | Let the spider try to put on all <math>16</math> things in a random order. Each of the <math>16!</math> permutations is equally probable. For any fixed leg, the probability that he will first put on the sock and only then the shoe is clearly <math>\frac{1}{2}</math>. Then the probability that he will correctly put things on all legs is <math>{1}{2^{8}}</math>. Therefore the number of correct permutations must be <math>\boxed{\frac {16!}{2^8}}</math>. | + | Let the spider try to put on all <math>16</math> things in a random order. Each of the <math>16!</math> permutations is equally probable. For any fixed leg, the probability that he will first put on the sock and only then the shoe is clearly <math>\frac{1}{2}</math>. Then the probability that he will correctly put things on all legs is <math>\frac{1}{2^{8}}</math>. Therefore the number of correct permutations must be <math>\boxed{\frac {16!}{2^8}}</math>. |
=== Solution 2 === | === Solution 2 === |
Revision as of 14:06, 27 December 2010
Problem
A spider has one sock and one shoe for each of its eight legs. In how many different orders can the spider put on its socks and shoes, assuming that, on each leg, the sock must be put on before the shoe?
Solution
Solution 1
Let the spider try to put on all things in a random order. Each of the permutations is equally probable. For any fixed leg, the probability that he will first put on the sock and only then the shoe is clearly . Then the probability that he will correctly put things on all legs is . Therefore the number of correct permutations must be .
Solution 2
Each dressing sequence can be uniquely described by a sequence containing two s, two s, ..., and two s -- the first occurrence of number means that the spider puts the sock onto leg , the second occurrence of means he puts the shoe onto leg . The number of such sequences is .
See Also
2001 AMC 12 (Problems • Answer Key • Resources) | |
Preceded by Problem 15 |
Followed by Problem 17 |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
All AMC 12 Problems and Solutions |