A Combinatorial Problem

被引:0
|
作者
K.L.Chung
机构
[1] Stanford
[2] U. S. A.
关键词
A Combinatorial Problem;
D O I
暂无
中图分类号
学科分类号
摘要
This formula is actually impractical for large n. However it seems not easy to sera closed form except for the particular case α=1. We hope the interested reader would like to try his hand at the evaluation or simplification of the summation mentioned above.
引用
收藏
页码:108 / 108
页数:1
相关论文
共 50 条