P2.4 - Sequences and series
- Syllabus
- 2019
- Topic
- P2.4
- Level
- AS
A sequence is an ordered list whose position matters. A rule can give a term directly from its position, or generate each term from the previous one.
| Rule type | What must be given | How a term is found |
|---|---|---|
| Explicit: un=f(n) | the formula and term number n | substitute n directly |
| Recursive: xn+1=f(xn) | the recurrence and a starting value | calculate earlier terms in order |
For un=3n−1, the sequence begins 2,5,8,11,… and u7=3(7)−1=20 without finding terms 5 or 6.
For x1=2 and xn+1=xn2−1, x2=3,x3=8,x4=63. Each input is the preceding term, so the starting value is part of the definition.
Keep the indices aligned: xn+1 is the next term produced from xn. Do not replace xn by n, or apply a recurrence without its required starting value.
An arithmetic sequence has a constant difference d. Starting from first term a, moving to term n adds d exactly n−1 times.
un=a+(n−1)d,Sn=2n(2a+(n−1)d)=2n(a+l)
The sum formula follows by writing the same finite sum forwards and backwards: Sn=a+(a+d)+⋯+[a+(n−1)d], Sn=[a+(n−1)d]+⋯+(a+d)+a. Each of the n paired columns totals 2a+(n−1)d, so doubling and then halving gives the formula.
Sigma notation compresses an addition: ∑r=1nur means u1+u2+⋯+un. Setting a=1,d=1 gives 1+2+⋯+n=2n(n+1).
For 7,11,15,…, a=7 and d=4. Thus u20=83 and S20=220(7+83)=900.
Term n uses n−1 differences. In a finite sum, identify the number of terms before substituting; it is not automatically the value of the final term.
Classify a sequence by comparing consecutive terms or by identifying an exact repeating cycle.
| Type | Test |
|---|---|
| Strictly increasing | un+1>un for every relevant n |
| Strictly decreasing | un+1<un for every relevant n |
| Periodic with period p | un+p=un; the order is the smallest positive such p |
For an explicit sequence, inspect un+1−un: a value always positive proves increasing, while one always negative proves decreasing. For un=n2+1, un+1−un=2n+1>0 for positive integer n, so the sequence is increasing.
The sequence 4,43,−31,4,43,−31,… repeats every three terms, so it is periodic of order 3. With a one-step deterministic recurrence, returning to an earlier value makes the same following cycle repeat.
A few rising or falling terms do not prove the pattern continues. Equality also fails the strict tests; and a stated period is not the order if a smaller positive period works.
A geometric sequence multiplies by the same common ratio r each time. With first term a, its terms and finite sum are
un=arn−1,Sn=1−ra(1−rn)(r=1)
Write Sn=a+ar+⋯+arn−1 and multiply by r. Subtracting rSn from Sn cancels the middle terms, leaving (1−r)Sn=a−arn, which gives the finite-sum formula.
Only when ∣r∣<1 does rn→0, so only then does the geometric sum converge to S∞=1−ra. A negative ratio may converge while the terms alternate signs.
For a=5,r=0.8, requiring Sn>24 gives 25(1−0.8n)>24, hence 0.8n<0.04. Therefore n>log(0.8)log(0.04)≈14.43, so the smallest integer is 15.
Use arn−1 for term n, not arn. Never use S∞ unless ∣r∣<1; when solving an inequality with 0<r<1, dividing by logr<0 reverses its direction.
For a positive integer n, the binomial theorem gives every term of (a+bx)n without repeated multiplication.
(a+bx)n=r=0∑n(rn)an−r(bx)r,(rn)=r!(n−r)!n!
Here n!=n(n−1)⋯2⋅1 and 0!=1. The index r is the power of x, so choosing r=0,1,2,… produces terms in ascending powers.
For (2−3x)4, (2−3x)4==24+(14)23(−3x)+(24)22(−3x)2+(34)2(−3x)3+(−3x)416−96x+216x2−216x3+81x4.
The sign belongs inside (bx)r: odd powers keep a negative sign and even powers become positive. This formula here is restricted to positive integer n and terminates after n+1 terms.