First, I don't know if this is a geometry question but I didn't know where else to put it.
This has to do with entries on Pascal's Triangle.
Prove that (k choose k) + (k+1 choose k) +...+(n choose k) = (n+1 choose k+1). where k and n are whole numbers and n >= k.
For example, if n=5 and k=2,
(2 choose 2)+(3 choose 2)+(4 choose 2)+(5 choose 2)=(6 choose 3)
which says that, 1+3+6+10=20
Any suggestions? Thanks!
This has to do with entries on Pascal's Triangle.
Prove that (k choose k) + (k+1 choose k) +...+(n choose k) = (n+1 choose k+1). where k and n are whole numbers and n >= k.
For example, if n=5 and k=2,
(2 choose 2)+(3 choose 2)+(4 choose 2)+(5 choose 2)=(6 choose 3)
which says that, 1+3+6+10=20
Any suggestions? Thanks!
