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'm looking for a proof of this identity but where j=m not j=0


share|cite|improve this question

marked as duplicate by pizza, Davide Giraudo, Najib Idrissi, Aaron Maroja, Jack D'Aurizio Apr 8 '15 at 15:56

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

To clarify what you mean: you want a proof of $$\sum_{j=m}^n\binom{j}{m}=\binom{n+1}{m+1}$$ correct? – Zev Chonoles Oct 22 '11 at 15:02
(-1) ${}{}{}{}{}{}$ – The Chaz 2.0 Dec 21 '11 at 16:14

It seems to me that you are looking for the proof of the identity: $$ \sum_{j=m}^n\binom{j}{m}=\binom{n+1}{m+1}$$

This is actually known as the Hockey-Stick Identity.You can find different methods of proving this in this page.

Please note that there are many applications of the hockey stick identity and all the combinatorial identities you may encounter, this is the one most worth remembering. It makes a lot of apparently hard problems very easy.

share|cite|improve this answer
Any idea why it's called the hockey stick identity? – Alex Oct 22 '11 at 16:00
@Alex: when you go to the URL FoolForMath provided, it shows a picture with the above identity represented on Pascal's triangle, on which the relevant numbers form a 'hockey stick'. – Gerben Oct 22 '11 at 16:23
@Gerben: Oh, I guess that's a little hockey stick like. Neat! Thanks! – Alex Oct 22 '11 at 16:28

Hint: what is $\binom{2}{4}$? what is $\binom{n-1}{n}?$

share|cite|improve this answer

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