知识卡片
望远镜求和消去中项
若求和项可写成相邻量之差ak−a{k−1},内部项会正负相消,只剩两端边界项。
对某些分式可先拆成相邻倒数差;识别望远镜结构比逐项硬算更直接。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 附录A 求和 · 查看原书依据
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,
参考来源
- 位置:《算法导论(第4版)》附录A《求和》(OEBPS/appendix001.xhtml,文本字符[0,5000))。
- 结论依据:附录A.1“Telescoping series”及原书公式图 Art_P1543.jpg、Art_P1545.jpg–Art_P1547.jpg(式A.12及示例):∑_{k=1}^n(a_k−a_{k−1})=a_n−a_0;1/[k(k+1)]=1/k−1/(k+1),故 ∑_{k=1}^{n−1}1/[k(k+1)]=1−1/n。边界项随求和起止点变化。
- 原始内容: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 a n , a n −1 , …