Difference between revisions of "2003 AMC 12B Problems/Problem 19"
(sol) |
|||
Line 15: | Line 15: | ||
[[Category:Introductory Combinatorics Problems]] | [[Category:Introductory Combinatorics Problems]] | ||
+ | {{MAA Notice}} |
Revision as of 09:27, 4 July 2013
Problem
Let be the set of permutations of the sequence for which the first term is not . A permutation is chosen randomly from . The probability that the second term is , in lowest terms, is . What is ?
Solution
There are choices for the first element of , and for each of these choices there are ways to arrange the remaining elements. If the second element must be , then there are only choices for the first element and ways to arrange the remaining elements. Hence the answer is , and .
See also
2003 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 18 |
Followed by Problem 20 |
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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.