Induction proof concerning a sum of binomial coefficients: $\sum_{j=m}^n\binom{j}{m}=\binom{n+1}{m+1}$ [duplicate]

summation induction binomial-coefficients

I'm looking for a proof of this identity but where j=m not j=0

http://www.proofwiki.org/wiki/Sum_of_Binomial_Coefficients_over_Upper_Index

$$\sum_{j=m}^n\binom{j}{m}=\binom{n+1}{m+1}$$


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.


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

Related

Example where closure of $A+B$ is different from sum of closures of $A$ and $B$
What are the strategies I can use to prove $f^{-1}(S \cap T) = f^{-1}(S) \cap f^{-1}(T)$?
Testing Zeros Of The Riemann Hypothesis [closed]
On a uniqueness proof for solutions of $\ a + x = b\,$ in a group
How many digits of accuracy will an answer have?
Calculating square roots using the recurrence $x_{n+1} = \frac12 \left(x_n + \frac2{x_n}\right)$ [duplicate]
Why does $\lim_{n\to\infty}(1+\frac{1}{n})^n = e$ instead of $1$? [duplicate]
Why the equation of an arbitrary straight line in complex plane is $zz_o + \bar z \bar z_0 = D$
If $G$ is abelian, then the set of all $g \in G$ such that $g = g^{-1}$ is a subgroup of $G$
Decimal Fibonacci Number?
Embedding Fields in Matrix Rings
H0w t0 prove that periodic decimal numbers are rational? $a_1...a_k(b_1b_2..b_l)={m \over n}$