← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

A 附录A 求和

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

example, a quick upper bound on the arithmetic series (A.1) is In general, for a series ,

if we let amax = max {ak : 1 ≤ k ≤ n}, then The technique of bounding each term in a series by the largest term is a weak method when the series can in fact be bounded by a geometric series. Given the series , suppose that ak+1/ak ≤ r for all k ≥ 0, where 0 < r < 1 is a constant. You can bound the sum by an infinite

decreasing geometric series, since ak ≤ a0rk, and thus You can apply this method to bound

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea