First, figure out what S(n) sums up to. Write S(n) in ascending order, then again in descending order and add them.
__S(n) = 1 + 2 + 3 + ... + n
+ S(n) = n + (n-1) + (n-2) + ... + 1
2S(n) = (n+1) + (n+1) + ... + (n + 1)
Note that you get n+1, n times.
So 2S(n) = n(n+1). Then S(n) = n(n+1)/2. Plug in 2n for n and we find that S(2n) = 2n(2n+1)/2
S(2n) - S(n) = 2n(2n+1)/2 - n(n+1)/2
__________= (4n^2 + 2n - n^2 - n)/2
__________= (3n^2 + n)/2

















