Difference between revisions of "1987 IMO Problems/Problem 1"
|Line 22:||Line 22:|
Revision as of 01:39, 6 June 2016
Let be the number of permutations of the set , which have exactly fixed points. Prove that
(Remark: A permutation of a set is a one-to-one mapping of onto itself. An element in is called a fixed point of the permutation if .)
The sum in question simply counts the total number of fixed points in all permutations of the set. But for any element of the set, there are permutations which have as a fixed point. Therefore
Slightly Clearer Solution
For any , if there are permutations that have fixed points, then we know that each fixed point is counted once in the product . Therefore the given sum is simply the number of fixed points among all permutations of . However, if we take any such that and is a fixed point, there are ways to arrange the other numbers in the set. Therefore our desired sum becomes , so we are done.
The probability of any number where being a fixed point is . Thus, the expected value of the number of fixed points is .
The expected value is also .
|1987 IMO (Problems) • Resources|
|1 • 2 • 3 • 4 • 5 • 6||Followed by|
|All IMO Problems and Solutions|