MathGrit
ProblemsTechniquesPricing
Sign inGet started
Back to problems

Permutation Index Set Weighted Sum

2425MasterCombinatoricsCounting Principles

65th NMO Selection Tests for BMO and IMO

Let $n$ be a positive integer, let $S_n$ be the set of all permutations of the set $\{1, 2, \dots, n\}$, and, for each $\sigma$ in $S_n$, let $I(\sigma) = \{i: \sigma(i) \le i\}$. Evaluate the sum $$ \sum_{\sigma \in S_n} \frac{1}{|I(\sigma)|} \sum_{i \in I(\sigma)} (i + \sigma(i)). $$
0 students attempted0% solvedRating 2425

Related practice paths

Olympiad-Style PracticeDeep contest practice for proof-style problem solving.How to Qualify for AIMEScore goals, contest choice, and prep habits for AIME hopefuls.AIME Practice StrategyHow to improve accuracy on high-difficulty problems.

Ready to check your answer?

Create an account to submit answers, save history, and track your rating.

Progressive Hints

Unlock hints one at a time — each reveals a little more without spoiling the solution.

Step-by-Step Solutions1

Multiple solution approaches with detailed walkthroughs, unlocked after you solve the problem.

AI-Powered Grading

Instant feedback on your answer — handles fractions, decimals, and equivalent forms.

Curated problem bank

Supported tracks for AMC, AIME, MATHCOUNTS, and olympiad-style training, plus global problem sources like UKMT, Euclid, and Kangaroo.