Appendix A
Useful combinatorial formulas
Recall the following facts about factorials and binomial coefficients:
nn nn+1
n 1
n! n 1 ,
e e
✓ ◆
nk n e k nk
k
k ,
k k k
Xn ✓ ◆
n k n
(x + y)n = x y k
,
k
k=0
X d ✓ ◆ ⇣ en ⌘d
n
,
k d
k=0
p ⇣ n ⌘n
n! ⇠ 2⇡n ,
e
✓ ◆
2n 4n
= (1 + o(1)) p ,
n ⇡n
and ✓ ◆
n
log = (1 + o(1))nH(k/n),
k
where H(p) := p log p (1 p) log(1 p). The third one is the binomial
theorem. The fifth one is Stirling’s formula.
Version: October 8, 2023
Modern Discrete Probability: An Essential Toolkit
Copyright © 2023 Sébastien Roch
501