Solution:
First, observe that
i=1∑ni=2n(n+1)andi=n+1∑2ni=n2+2n(n+1)
which means that
i=n+1∑2ni−i=1∑ni=n2
Let A={1,2,…,n} and B={n+1,n+2,…,2n}. (Here, we do not distinguish the point labeled x and the number x itself.) Because the numbers are arranged on a circle, one can find a pair {x1,y1}, where x1∈A and y1∈B, such that one arc joining x1 and y1 contains no other labeled points. One can then remove the chord (including x1 and y1) joining these points. Among the remaining labeled points, one can find again a pair {x2,y2}, where x2∈A∖{x1} and y2∈B∖{y1}, such that one arc joining x2 and y2 does not contain a labeled point, and then remove again the chord (including the endpoints) joining x2 and y2. Continuing this process, one can find pairs {x3,y3},{x4,y4}, and so on, and then remove the chords joining the pairs.
We claim that the removed chords satisfy the required properties. Clearly, there are n such chords. Because no labeled point lies on one arc joining xj and yj for any 1≤j≤n, the removed chords are non-intersecting. Finally, the sum of the values assigned to the removed chords is
j=1∑n(yj−xj)=j=1∑nyj−j=1∑nxj=i=n+1∑2ni−i=1∑ni=n2
This ends the proof of our claim.