1

Apologies to bother you with this, but how is the following arithmetic sequence solved?

$$\dfrac1n \left(\sum_{k=1}^{n-1}\dfrac{n-k+1}2\right)$$

2 Answers2

1

First, you can pull out everything from the sum that does not depend on $k$. So $$\dfrac1n \left(\sum_{k=1}^{n-1}\dfrac{n-k+1}2\right)=\frac 1n \left(\frac {(n-1)(n+1)}2-\frac 12\sum_{k=1}^{n-1}k\right)$$ where I pulled out $\frac {n+1}2$ and multiplied by $n-1$ as the number of terms. Can you do the last?

Ross Millikan
  • 374,822
  • @P..: I see. Soon to fix – Ross Millikan Apr 24 '13 at 20:48
  • Apologies I still cannot use the correct math symbols, but I have this derivation as ((n-1)/2) - (1/2n) where this last term is multiplied by sigma K. – user74185 Apr 24 '13 at 20:56
  • Does this sound correct. I need the final answer only in terms on n, so what would happen to the lone K now??? – user74185 Apr 24 '13 at 20:57
  • @user74185: the $k$ is a dummy variable. It represents all the values you are summing up. Less formally, the last sum represents (without the leading $\frac 12$) $1+2+3+\ldots n-1$. There is no $k$. Have you seen that sum? You might look at the triangular numbers. – Ross Millikan Apr 24 '13 at 21:01
  • So we completely drop the k, which would lead to the final solution I derived from your formula, which was ((n-1)/2) - (1/2n) – user74185 Apr 24 '13 at 21:09
0

Write $$ \dfrac1n \left(\sum_{k=1}^{n-1}\dfrac{n-k+1}2\right)=\dfrac{n}{2n}\sum_{k=1}^{n-1}1-\dfrac1{2n}\sum_{k=1}^{n-1}k+\dfrac1{2n}\sum_{k=1}^{n-1}1 $$ and see this.

P..
  • 14,929