FP1.7 - Series
- Syllabus
- 2019
- Topic
- —
- Level
- AS
A finite sum can be evaluated by rewriting its summand as a polynomial in the index, splitting it term by term, and applying the standard results. Here n is a positive integer.
| Sum from r=1 to n | Standard result |
|---|---|
| ∑1 | n |
| ∑r | 2n(n+1) |
| ∑r2 | 6n(n+1)(2n+1) |
| ∑r3 | (2n(n+1))2 |
Summation is linear: constants may be taken outside and separate polynomial terms may be summed separately. Thus r=1∑n(ar3+br2+cr+d)=ar=1∑nr3+br=1∑nr2+cr=1∑nr+dn. Expand or factor the summand before choosing the formulas.
For the official model form, r=1∑nr(r2+2)=r=1∑n(r3+2r)=(2n(n+1))2+n(n+1). Factoring gives 4n(n+1)(n(n+1)+4). This preserves the equality for every positive integer n, rather than checking only particular values.
For a different lower limit, define F(m)=∑r=1mf(r). Then r=a∑bf(r)=F(b)−F(a−1). For example, with f(r)=r2+2, r=4∑10(r2+2)=F(10)−F(3)=(385+20)−(14+6)=385.
Subtract through a−1, not through a. If a sum starts at r=0, include the r=0 term separately; in particular, ∑r=0nc=c(n+1). The method of differences is not required in FP1, so do not replace this standard-results method with telescoping or partial-fraction differences.