Let be a positive integer and let be a permutation of such that the numbers are pairwise distinct for .
Prove that if and only if .
Problem 1395
Official solution
To prove the given statement, we will break it down into two parts: the "if" part and the "only if" part.
### "If" Part:
We need to show that if , then .
1. Sum of Differences:
The difference is the sum of the descents minus the sum of the ascents. The set of differences of consecutive elements is . Therefore, the sum of all differences is:
2. Sum of Descents and Ascents:
Let the sum of the descents be and the sum of the ascents be . We have:
Given , we can write:
3. **Solving for and **:
Adding and subtracting the two equations:
4. Distribution of Elements:
Let the descents be for . The sum of descents is:
Each element in group must appear as the left element of a descent and never as a right element of a descent. This implies that no two elements of group can be next to each other.
5. Odd Indices:
Since is in group and is in group , all elements in group must have odd indices. Therefore, .
### "Only If" Part:
We need to show that if , then .
1. Odd Indices:
Since elements in group have odd indices, the sum of descents is .
2. Sum of Ascents:
By the previous calculation, the sum of ascents is .
3. Difference Calculation:
Using the relationship , we get:
Thus, we have shown both directions of the statement.