原书出处
Introduction to Algorithms, Fourth Edition
C 附录C 计数与概率
ribution b(k; n, p) increases with k until it reaches the mean np, and then it decreases.
To prove that the distribution always behaves in this manner, examine the ratio of successive terms: This ratio is greater than 1 precisely when (n + 1)p − k is positive. Consequently, b
(k; n, p) > b(k − 1; n, p) for k < (n + 1)p (the distribution increases), and b(k; n, p) <
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix003.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea