Define the following statistic as follows:
D(a1,a2,…,an):
Start at an. Go back from an until you get to the nearest element of the list smaller than it. Suppose that the first element smaller than it is ak. We break the list there (right after ak).
Then, repeat from ak... go back until you get nearest element in the list smaller than ak.
By the end, you will have split the list a certain number of times, x, creating x+1 sub-lists.
Now, consider the expression:
G(n) = D(1,2,3,…,(n−1),n)+D(1,2,3,…,n,(n−1),…+D(n,(n−1),…,2,1)n! where the numerator is D evaluated at all n! permutations of 1,2,3,4,…,n.
For example, for n=3, we have:
G(3)=D(1,2,3)+D(1,3,2)+D(2,1,3)+D(2,3,1)+D(3,1,2)+D(3,2,1)3!, which can be shown to equal 116.
Prove that G(n) is the nth harmonic number!!!!!!!!!!!!!!!!!
Thank you so much in advance.
You asked me to clarify my last answer.
I did that at length.
I am still waiting on a response from you.