olymmath

CMO 1982 Problem 4

  • Paper

Let pp be a permutation of the set Sn={1,2,…,n}S_n = \{1, 2, \dots, n\} . An element j∈Snj \in S_n is called a fixed point of pp if p(j)=jp(j) = j . Let fnf_n be the number of permutations having no fixed points, and gng_n be the number with exactly one fixed point. Show that ∣fn−gn∣=1|f_n - g_n| = 1 .

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.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator ca-cmo/1982/p4 · Tag 6QYQHV5QYD · Edit this page on GitHub · Keys: j next, k previous