avatar
l*f
1
Suppose C(m,n) means m!/(m-n!)n!, can anyone simplify the following
expression, no matter by hand or by Maple or something?
Sum(f(k),k=1,2,...,n), where
f(k)=Sum[C(2k-1+j,k-1)C(m+n-2k-j,m-k),j=0,1,...,(n-k)]/mC(m+n,n)
What I already know is when m=n, the answer is just 1/2, for any m or n.
If anyone has a clue, please email me at l****[email protected] I really appreciate
your help!
avatar
st
2
your home? and it has nothing to do with .net?

【在 l****f 的大作中提到】
: Suppose C(m,n) means m!/(m-n!)n!, can anyone simplify the following
: expression, no matter by hand or by Maple or something?
: Sum(f(k),k=1,2,...,n), where
: f(k)=Sum[C(2k-1+j,k-1)C(m+n-2k-j,m-k),j=0,1,...,(n-k)]/mC(m+n,n)
: What I already know is when m=n, the answer is just 1/2, for any m or n.
: If anyone has a clue, please email me at l****[email protected] I really appreciate
: your help!

avatar
l*f
3
This is something I get from Economics.

appreciate

【在 st 的大作中提到】
: your home? and it has nothing to do with .net?
相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。