← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

C 附录C 计数与概率

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

To determine bounds on the left tail, simply invert the roles of successes and failures.

Theorem C.2 Consider a sequence of n Bernoulli trials, where success occurs with probability p. Let X be the random variable denoting the total number of successes. Then for 0 ≤ k ≤ n,

the probability of at least k successes is Proof For S ⊆ {1, 2, … , n}, let AS denote the

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea