Asymptotics for Lacunary Sums of Binomial Coefficients and a Card Problem with Ranks

被引:0
|
作者
Lengyel, Tamas [1 ]
机构
[1] Occidental Coll, Math Dept, 1600 Campus Rd, Los Angeles, CA 90041 USA
关键词
lacunary sum; asymptotic enumeration; Bernoulli numbers;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We find asymptotics for lacunary sums of binomial coefficients. As an application we determine the exact and approximate probability that the first card has the uniquely highest rank among the top 1 cards of a standard card deck.
引用
收藏
页数:7
相关论文
共 50 条