April 2005
Intermediate to advanced
944 pages
24h 6m
English
Series arise in estimating software product performance, for example, in queueing theory. This appendix collects some useful results.
Successive terms of the arithmetic progression differ by a constant amount, d. The sum of the first n terms is
a+(a+d)+(a+2d)+(a+3d)+…+{a+(n-1)d}
![]()
Successive terms of the geometric progression differ by a constant factor, r. The sum of the first n terms is
![]()
If r2 < 1, then
![]()
Read now
Unlock full access