olymmath

AUSTRIAN-POLISH 1990 Problem 5

    Let n>1n>1 be an integer and let f1f_1 , f2f_2 , ..., fn!f_{n!} be the n!n! permutations of 11 , 22 , ..., nn . (Each fif_i is a bijective function from {1,2,...,n}\{1,2,...,n\} to itself.) For each permutation fif_i , let us define S(fi)=∑k=1n∣fi(k)−k∣S(f_i)=\sum^n_{k=1} |f_i(k)-k| . Find 1n!∑i=1n!S(fi)\frac{1}{n!} \sum^{n!}_{i=1} S(f_i) .

    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 austrian-polish/1990/p5 · Tag W1HKPVBY0M · Edit this page on GitHub · Keys: j next, k previous