CMO 1982 Problem 4
- Paper
Let be a permutation of the set . An element is called a fixed point of if . Let be the number of permutations having no fixed points, and be the number with exactly one fixed point. Show that .
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.