# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | jiangly | 3578 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | tourist | 3565 |
8 | maroonrk | 3531 |
9 | Radewoosh | 3521 |
10 | Um_nik | 3482 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
Name |
---|
Nice drawing :D
What's that character in brackets after summations before i (?-i)
I don't know if this convince you.
Let's assume the difference is taking an absolute sign. There are $$$n!$$$ permutation of len $$$n$$$. For one permutation there are $$$n-1$$$ adjacent difference. The probability of getting one pair $$$(x,y)$$$ or $$$(y,x)$$$ , having the difference $$$|x-y|$$$ is $$$\frac{2}{n(n-1)}$$$
So the sum will be $$$N! (N-1) \frac{2}{N(N-1)} \sum_{i=1}^{N} \sum_{j=1+1}^{N} (j-i) = N! \frac{2}{N} \sum_{i=1}^{N} \sum_{j=1+1}^{N} (j-i)$$$