Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

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


Math Forum » Discussions » Math Topics » discretemath

Topic: Probability and Combinatorics
Replies: 0  

Advanced Search

Back to Topic List Back to Topic List  
martin

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

Hi!

Does anybody know how to solve the following problem:


[tex]\sum_{p=0}^{M}\binom{2M+2}{p}(M+1-p)=?[/tex]

Well, actually i know that the solution is:

[tex](2M+1)\binom{2M}{m}=\frac{2^{2M+1}\Gamma(\frac{3}{2}+M)}{\sqrt{\pi}\Gamma(M+1)}[/tex]

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]

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