The Math Forum

Search All of the Math Forum:

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

Math Forum » Discussions » Math Topics » discretemath

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Probability and Combinatorics
Replies: 0  

Advanced Search

Back to Topic List Back to Topic List  

Posts: 2
Registered: 12/20/08
Probability and Combinatorics
Posted: Dec 20, 2008 8:04 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply


Does anybody know how to solve the following problem:


Well, actually i know that the solution is:


but i cannot prove it (mathematica calculates the first sum and gives the answer).

Maybe someone knows the simple (combinatorial?) solution?

The original problem was:

Let [tex]R ^{M} _{P} = \sum_{s = 0}^{P} {M + 1 \choose s}[/tex], for [tex]0 \leqslant P \leqslant M[/tex], [tex]P,M\in \mathbb{N}[/tex]

Proove that:
[tex]\sum_{q = 0}^{M}R^{M}_{q}\cdot R^{M}_{M - q} = (2M + 1) {2M \choose M}[/tex]

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

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.