知识卡片
反向换元简化求和
求和式中的索引若以n−k出现,可以设新索引倒序遍历同一组项;变换后上下限必须同步调整。
把含n−k+1的倒数和换元,可化成常见调和和。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
- · 反向换元简化求和
原书出处 · 1 处
- 附录A 求和 · 查看原书依据
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的求和定义、级数性质或界估方法;关键积分夹和图A.1与公式图已核对。
- 原始内容: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 , … , a 0 , we can reverse the order of indices by letting j = n − k and rewrite this summation as Generally, if the summation index appears in the body