← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

A 附录A 求和

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

h of the terms a1, a2, … , an−1 is added in exactly once and subtracted out exactly once.

We say that the sum telescopes. Similarly, As an example of a telescoping sum, consider the series Rewriting each term as gives Reindexing summations A series can sometimes be simplified by changing its index, often reversing the order of summation. Consider the series . Because the terms in this summation are an, an−1,

… , a0, we can reverse the order of indices by letting j = n − k and rewrite this summati

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea