原书出处
Introduction to Algorithms, Fourth Edition
A 附录A 求和
, where n is a nonnegative integer, the finite sum a1 + a2 + … + an can be expressed as .
If n = 0, the value of the summation is defined to be 0. The value of a finite series is always well defined, and the order in which its terms are added does not matter. Given an infinite sequence a1, a2,
… of numbers, we can write their infinite sum a1 + a2 + … as , which means . If the limit
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix001.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea