Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I am reading Introduction with Algorithms book and my first doubt arises in time analysis of my first insertions sort's algorithm uses these sigma problems. I learned about this in junior classes but never solved complicated ones.Even appendix in the book discuss very little about complicated sigma addition. Somebody answer the solution for two of the problems mentioned below?

I know:

$$\sum^n_{j=1}j = n(n+1)/2 $$

but how these two evaluated?

$$\sum^n_{j=2}j = n(n+1)/2-1 $$

I understood why we subtracted -1 because we are starting from base j=2 if i am right please mention that and explain me next doubt written below if not mention why we are using -1 at the end?

$$\sum^n_{j=2}(j-1)= n(n-1)/2 $$

share|cite|improve this question
up vote 3 down vote accepted

$$\sum_{j=1}^n j = 1+2+3+\ldots+(n-1)+n=\frac{n(n+1)}{2}$$ $$\sum_{j=2}^n j = 2+3+\ldots+(n-1)+n=2+3+\ldots+(n-1)+n+1-1=\frac{n(n+1)}{2}-1$$

share|cite|improve this answer
can you edit your answer by mistake i wrote the last summation problem wrong – Abhimanyu Aryan Jul 13 '14 at 12:25
You should take a look at the parenthesis. $\sum_{j=2}^{n}j-1 \neq \sum_{j=2}^{n}(j-1)$. – REr Jul 13 '14 at 12:44
@user2804303 thanks i forgot to use those edited now – Abhimanyu Aryan Jul 13 '14 at 20:11

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.