# A-level Mathematics/OCR/C2/Sequences and Series

< A-level Mathematics‎ | OCR‎ | C2

## DefinitionsEdit

A sequence is simply a list of numbers in a particular order. We call these numbers the terms of the sequence. For instance, 2,4,6,8 are the first four terms in the sequence of even positive integers. When we take the sum of the terms in a sequence, we get a series. For example, 2+4+6+8+... is a series.

We denote the terms in a sequence by ${\displaystyle T_{n}}$  where ${\displaystyle n}$  is the number of the term in question. For example, we have ${\displaystyle T_{1}=2}$ , ${\displaystyle T_{2}=4}$ , ${\displaystyle T_{3}=6}$ , and so on, in the sequence described above.

A definition is a rule that tells us how to compute each term in a sequence. For example, a rule for the sequence above is ${\displaystyle T_{n}=2n}$ . A relation describes how each term is related to other terms. For instance, a relation for the above sequence is ${\displaystyle T_{n+1}=T_{n}+2}$ .

## Sigma (${\displaystyle \Sigma }$) NotationEdit

As you might have suspected, describing a series with the help of some of its terms isn't always a good idea --- if too few terms are used, the series can be ambiguous to your reader; on the other hand, you risk insulting your reader by writing out too many terms! To express a series succinctly, we use the sigma ${\displaystyle (\Sigma )}$  notation instead.

In general, a series may be written as ${\displaystyle \sum _{k=k_{0}}^{N}f(k)}$ , which means "sum of all terms beginning with ${\displaystyle f(k_{0})}$  up to and including ${\displaystyle f(N)}$ ". Hence,

${\displaystyle \sum _{k=k_{0}}^{N}f(k)=f(k_{0})+f(k_{0}+1)+f(k_{0}+2)+\cdots +f(N)}$ .

As an example, the series 2+4+6+8+... may be written as ${\displaystyle \sum _{k=1}^{\infty }2k}$ .

## Recognising Simple ProgressionsEdit

A progression is just another word for a sequence. In this module, you are expected to be well-acquainted with two very common types of progressions --- the arithmetic progression and the geometric progression.

Briefly, an arithmetic progression or AP is a sequence in which each successive term is the sum of the previous term and a fixed value. An example of an AP is 1,4,7,10,..., where the difference between successive terms is 3.

A geometric progression or GP is a sequence in which each successive term is the product of the previous term and a fixed value. An example of a GP is 2,4,8,16,32,..., where each term is twice the value of the previous term.

## Arithmetic Progression (AP)Edit

An arithmetic progression (AP) is a sequence that can be written in the following way: ${\displaystyle a,a+d,a+2d,a+3d,a+4d,\ldots }$ , where ${\displaystyle a,d}$  are constants. The first term ${\displaystyle T_{1}}$  in the AP is denoted by ${\displaystyle a}$ , and the common difference between subsequent terms is denoted by ${\displaystyle d}$ . Thus, the series 1,4,7,10,..., is an arithmetic progression with ${\displaystyle a=1}$  and ${\displaystyle d=3}$ .

### RulesEdit

The common difference ${\displaystyle d}$  can be calculated by ${\displaystyle d=T_{n}-T_{n-1}}$ , where ${\displaystyle n=2,3,4,...}$ .

The ${\displaystyle n}$ th term is given by ${\displaystyle T_{n}=a+(n-1)d}$ .

The sum of the first ${\displaystyle n}$  terms of an AP (with ${\displaystyle T_{1}}$  as its first term and ${\displaystyle T_{n}}$  as its last term) is given by ${\displaystyle S_{n}={\frac {n}{2}}(T_{1}+T_{n})={\frac {n}{2}}(2a+(n-1)d)}$ .

In fact, more generally, the sum of ${\displaystyle n}$  consecutive terms in an AP is given by ${\displaystyle {\frac {\mathrm {number\,of\,terms} }{2}}(\mathrm {first\,term} +\mathrm {last\,term} )}$ .

### ExampleEdit

What is the sum of the even numbers 2, 4, 6, 8, ..., 100?

The given sequence can be expressed as an AP with ${\displaystyle T_{1}=a=2}$ , and ${\displaystyle d=2}$ . We want the sum of the first 50 terms of the AP:

${\displaystyle S_{50}={\frac {50}{2}}(2+100)={\frac {50}{2}}\left(2(2)+(50-1)2\right)=2550}$ .

## Geometric Progression (GP)Edit

A geometric progression (GP) is a sequence that can be written in the following way: ${\displaystyle a,ar,ar^{2},ar^{3},ar^{4},\ldots }$ , where ${\displaystyle a,r}$  are constants. The first term ${\displaystyle T_{1}}$  in the GP is denoted by ${\displaystyle a}$ , and the common ratio between subsequent terms is denoted by ${\displaystyle r}$ .

### RulesEdit

The common ratio ${\displaystyle r}$  can be calculated by ${\displaystyle r={\frac {T_{n}}{T_{n-1}}}}$ , where ${\displaystyle n=2,3,4,...}$ .

The ${\displaystyle n}$ th term is given by ${\displaystyle T_{n}=ar^{n-1}}$ .

The sum of the first ${\displaystyle n}$  terms of an GP is given by ${\displaystyle S_{n}={\frac {a(1-r^{n})}{1-r}}}$ .

Proof of this is given by:

${\displaystyle S_{n}=a+ar+ar^{2}+\ldots +ar^{n-1}}$

${\displaystyle rS_{n}=ar+ar^{2}+ar^{3}+\ldots +ar^{n}}$

${\displaystyle S_{n}-rS_{n}=a-ar^{n}}$

${\displaystyle S_{n}(1-r)=a(1-r^{n})}$

${\displaystyle S_{n}={\frac {a(1-r^{n})}{1-r}}}$

### Sum Of An Infinite Geometric SeriesEdit

We say that the geometric series ${\displaystyle \sum _{k=0}^{\infty }ar^{k}=a+ar+ar^{2}+ar^{3}+ar^{4}+\ldots }$  is convergent if the sum to infinity ${\displaystyle S_{\infty }}$  approaches some limit. This occurs when ${\displaystyle |r|<1}$ . Hence, if ${\displaystyle |r|<1}$ , then

${\displaystyle S_{\infty }=\lim _{n\rightarrow \infty }{\frac {a(1-r^{n})}{1-r}}={\frac {a}{1-r}}}$ .

Proof of this is given by:

${\displaystyle S_{\infty }=a+ar+ar^{2}+ar^{3}+...}$

${\displaystyle rS_{\infty }=ar+ar^{2}+ar^{3}+ar^{4}+...}$

${\displaystyle S_{\infty }-rS_{\infty }=a}$

${\displaystyle S_{\infty }(1-r)=a}$

${\displaystyle S_{\infty }={\frac {a}{1-r}}}$

## Binomial expressionsEdit

A binomial is a polynomial with two parts in the form ${\displaystyle (a+b)}$ , such as ${\displaystyle (x+1)}$ . When a binomial is raised to a power, you could simplify it by multiplying out the brackets several times. The expanded polynomial is called a binomial expansion, and all binomial expansions follow a pattern that can be used to expand binomials quicker than multiplying out several brackets. For now, we will only look at binomial expressions which are raised to positive integers.

### Expansions of ${\displaystyle (x+1)}$ Edit

Here are the expansions of ${\displaystyle x+1}$  raised to different powers.

 ${\displaystyle (x+1)^{1}=}$ ${\displaystyle 1x+1}$ ${\displaystyle (x+1)^{2}=}$ ${\displaystyle 1x^{2}+2x+1}$ ${\displaystyle (x+1)^{3}=}$ ${\displaystyle 1x^{3}+3x^{2}+3x+1}$ ${\displaystyle (x+1)^{4}=}$ ${\displaystyle 1x^{4}+4x^{3}+6x^{2}+4x+1}$ ${\displaystyle (x+1)^{5}=}$ ${\displaystyle 1x^{5}+5x^{4}+10x^{3}+10x^{2}+5x+1}$

If you look at the coefficient of each term, you may notice a pattern. These numbers are called binomial coefficients and are found by adding the two numbers above it.

### Pascal's triangleEdit

Binomial coefficients are more commonly known as Pascal's triangle, named after Blaise Pascal.

The first 10 lines of Pascal's triangle are:

                                       (1)
1     1
1     2     1
1     3     3     1
1     4     6     4     1
1     5     10    10    5     1
1     6     15    20    15    6     1
1     7     21    35    35    21    7     1
1     8     28    56    70    56    28    8     1
1     9     36    84    126   126   84    36    9     1
1     10    45    120   210   252   210   120   45    10    1
1      11    55    165   330   462   462   330   165   55   11     1


Since each number is found by adding the two numbers above it, it is possible to find a few lines of the triangle to help you expand binomials. For binomials raised to powers greater than 10, you should use the binomial coefficient formula.

### Binomial coefficient formulaEdit

When a binomial is raised to a large power, it may be too time consuming to find the binomial coefficients by writing out Pascal's triangle. Fortunately, there is a formula that can find any line of Pascal's triangle.

If ${\displaystyle n}$  is the power of the expansion, and ${\displaystyle r}$  is the number of the term in a single row, the binomial coefficient formula is:

${\displaystyle {n \choose r}={\frac {n!}{r!(n-r)!}}}$

The ${\displaystyle !}$  means factorial and multiplies ${\displaystyle n}$  by every integer less than itself, down to 1.

So ${\displaystyle 3!=3\times 2\times 1=6}$ .

To find the binomial coefficients, you use the formula with the required value of ${\displaystyle n}$ , and ${\displaystyle r=0}$ , ${\displaystyle r=1}$ , ${\displaystyle r=2}$ , and so on, until ${\displaystyle r=n}$ .

Most scientific calculators will have two buttons that will be useful in this process, one is the factorial button, usually labelled n! and the other will actually find ${\displaystyle {n \choose r}}$  and is often labelled nCr or ${\displaystyle C_{r}^{n}}$ . (The C stands for "choose" or "combination" which is based on the formula's use in probability.)

You should be aware that Pascal's triangle is symmetrical, so once a coefficient is repeated, you can write down the rest of the coefficients with ease.

### Expanding binomialsEdit

Now that you know how to find the coefficients in a binomial expansion, you can easily expand any binomial that is raised to a positve integer by following these simple steps:

For a binomial in the form ${\displaystyle (a+b)^{n}}$ ,

1. Write down ${\displaystyle a}$  in descending powers, from ${\displaystyle n}$  to ${\displaystyle 0}$
2. Write down ${\displaystyle b}$  in ascending powers, from ${\displaystyle 0}$  to ${\displaystyle n}$ , making sure that you place the terms so that the powers add up to ${\displaystyle n}$
3. Add the binomial coefficients to each term, either from line ${\displaystyle n}$  in Pascal's triangle (ignoring the 1 at the top), or by using the binomial coefficient formula.

You then simplify where necessary.

For example, for the expansion of ${\displaystyle (x+2)^{4}}$ :

${\displaystyle x}$  in descending powers: ${\displaystyle x^{4}}$  ${\displaystyle +}$  ${\displaystyle x^{3}}$  ${\displaystyle +}$  ${\displaystyle x^{2}}$  ${\displaystyle +}$  ${\displaystyle x^{1}}$  ${\displaystyle +}$  ${\displaystyle x^{0}}$

${\displaystyle 2}$  in ascending powers: ${\displaystyle 2^{0}}$  ${\displaystyle +}$  ${\displaystyle 2^{1}}$  ${\displaystyle +}$  ${\displaystyle 2^{2}}$  ${\displaystyle +}$  ${\displaystyle 2^{3}}$  ${\displaystyle +}$  ${\displaystyle 2^{4}}$

Grouping everything together we now have:

${\displaystyle x^{4}}$ ${\displaystyle 2^{0}}$  ${\displaystyle +}$  ${\displaystyle x^{3}}$ ${\displaystyle 2^{1}}$  ${\displaystyle +}$  ${\displaystyle x^{2}}$ ${\displaystyle 2^{2}}$  ${\displaystyle +}$  ${\displaystyle x^{1}}$ ${\displaystyle 2^{3}}$  ${\displaystyle +}$  ${\displaystyle x^{0}}$ ${\displaystyle 2^{4}}$

Adding in the binomial coefficients:

${\displaystyle 1x^{4}}$ ${\displaystyle 2^{0}}$  ${\displaystyle +}$  ${\displaystyle 4x^{3}}$ ${\displaystyle 2^{1}}$  ${\displaystyle +}$  ${\displaystyle 6x^{2}}$ ${\displaystyle 2^{2}}$  ${\displaystyle +}$  ${\displaystyle 4x^{1}}$ ${\displaystyle 2^{3}}$  ${\displaystyle +}$  ${\displaystyle 1x^{0}}$ ${\displaystyle 2^{4}}$

Finally simplifying will now give us:

${\displaystyle x^{4}}$  ${\displaystyle +}$  ${\displaystyle 8x^{3}}$  ${\displaystyle +}$  ${\displaystyle 24x^{2}}$  ${\displaystyle +}$  ${\displaystyle 32x^{1}}$  ${\displaystyle +}$  $16$

This process is summarised in the equation known as the binomial theorem:

${\displaystyle (x+y)^{n}=\sum _{r=0}^{n}{n \choose r}x^{r}y^{n-r}}$

In case you are not familiar with sigma notion this means:

${\displaystyle (x+y)^{n}={n \choose 0}x^{0}y^{n}+{n \choose 1}x^{1}y^{n-1}+{n \choose 2}x^{2}y^{n-2}+\dots +{n \choose {n-2}}x^{n-2}y^{2}+{n \choose {n-1}}x^{n-1}y^{1}+{n \choose n}x^{n}y^{0}}$

Several simplifications can be made but they aren't worth memorising as you will pick them up automatically: ${\displaystyle (x+y)^{n}=y^{n}+nxy^{n-1}+{n \choose 2}x^{2}y^{n-2}+\dots +{n \choose {n-2}}x^{n-2}y^{2}+nx^{n-1}y+x^{n}}$

This is part of the C2 (Core Mathematics 2) module of the A-level Mathematics text. Appendix A: Formulae