Home Competitions RO-TST 2014 Problem 16
Let n ∈ N n \in \mathbb{N} n ∈ N and S n S_{n} S n the set of all permutations of { 1 , 2 , 3 , . . . , n } \{1,2,3,...,n\} { 1 , 2 , 3 , ... , n } . For every permutation σ ∈ S n \sigma \in S_{n} σ ∈ S n denote I ( σ ) : = { i : σ ( i ) ≤ i } I(\sigma) := \{ i: \sigma (i) \le i \} I ( σ ) := { i : σ ( i ) ≤ i } .
Compute the sum ∑ σ ∈ S n 1 ∣ I ( σ ) ∣ ∑ i ∈ I ( σ ) ( i + σ ( i ) ) \sum_ {\sigma \in S_{n}} \frac{1}{|I(\sigma )|} \sum_ {i \in I(\sigma)} (i+ \sigma(i)) ∑ σ ∈ S n ∣ I ( σ ) ∣ 1 ∑ i ∈ I ( σ ) ( i + σ ( 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 ro-tst/2014/p16 · Tag 7VAXZNY8BQ · Edit this page on GitHub · Keys: j next, k previous