Drexel dragonThe Math ForumDonate to the Math Forum


Math Forum
 Ask Dr. Math
 Discussions
 Internet Newsletter
 MathTools
 Problems of the Week
 Teacher2Teacher
 Teacher Exchange
 Workshops

Search All of the Math Forum:
Browse our Internet Mathematics Library

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » Math Topics » discretemath

Topic: Combinatorical Proof
Replies: 0  

Advanced Search
Reply to this Topic Reply to this Topic

Back to Topic List Back to Topic List  
Petteri

Posts: 1
Registered: 5/21/10
Combinatorical Proof
Posted: May 21, 2010 5:22 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Hi all!

I've been looking for solution for next problem:

How to prove:

\binom{n}{k}= 1 +
\sum_{j=0}^{k-1}\sum_{i=0}^{n-k-1}\binom{i+j}{j}


It is known as Pascal?s 3rd Identity. I have tried double induction for n and k, but have not succeeded.

Would make me very happy!

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2013. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.