← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

C 附录C 计数与概率

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.799Z

this inequality k − i times gives b(i; n, p) < xk−i b(k; n, p) for 0 ≤ i < k, and hence ▪

Corollary C.5 Consider a sequence of n Bernoulli trials, where success occurs with probability p and failure with probability q = 1 − p. Then for 0 < k ≤ np/2, the probability of fewer

than k successes is less than half the probability of fewer than k + 1 successes. Proof B

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix003.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea