Difference between revisions of "1987 IMO Problems/Problem 1"
(creation) |
Baijiangchen (talk | contribs) m (→Solution) |
||
Line 13: | Line 13: | ||
== Solution == | == Solution == | ||
− | The sum in | + | The sum in question simply counts the total number of fixed points in all permutations of the set. But for any element <math>i </math> of the set, there are <math>(n-1)! </math> permutations which have <math>i </math> as a fixed point. Therefore |
<center> | <center> |
Revision as of 19:08, 18 November 2011
Problem
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 .)
Solution
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
,
as desired.
Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.
1987 IMO (Problems) • Resources | ||
Preceded by First question |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 2 |
All IMO Problems and Solutions |