olymmath

HMMT 2013 C9

  • Combinatorics
  • Answer

Given a permutation σ\sigma of {1,2,…,2013}\{1,2, \ldots, 2013\}, let f(σ)f(\sigma) to be the number of fixed points of σ\sigma - that is, the number of k∈{1,2,…,2013}k \in\{1,2, \ldots, 2013\} such that σ(k)=k\sigma(k)=k. If SS is the set of all possible permutations σ\sigma, compute

∑σ∈Sf(σ)4\sum_{\sigma \in S} f(\sigma)^{4}

(Here, a permutation σ\sigma is a bijective mapping from {1,2,…,2013}\{1,2, \ldots, 2013\} to {1,2,…,2013}\{1,2, \ldots, 2013\}.)

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

15(2013!)

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 hmmt/2013/c9 · Tag QHEFNHM915 · Edit this page on GitHub · Keys: j next, k previous