MEI AS Further Maths Sequences and series

Topic assessment
n
1. Find  (6r  1)(4r  1) , giving your answer in its simplest form.
r 1
[5]

2. Prove by induction that

n

 (3r
r 1
2
 2r )  12 n(n  1)(2n  1) [7]

1 1 1
3. (i) Show that   . [1]
r  1 r  2 (r  1)(r  2)
n
1
(ii) Hence find the sum of the series  (r  1)(r  2) .
r 1
[4]

4. Prove by induction that

 1 4  1  2n 4n 
n

   .
1 3  n 2n  1
[6]

5. A sequence of real numbers u1 , u2 , u3 ,... is defined by

3un
u1  1 and un 1  for n ≥ 1.
5un  6
3
Prove by induction that un  n . [6]
2 5

6. Find the sum of the series

1 9  2  33  3  73  ...  n(8n2  1) ,
giving your answer in a fully factorised form. [5]

1 5 4 3r  2
7. (i) Show that     . [2]
r r  1 r  2 r (r  1)(r  2)
(ii) Hence find the sum of the first n terms of the series
1 4 7
   ... . [6]
1 2  3 2  3  4 3  4  5

n
8. Prove by induction that  r3
r 1
r
 34  14 (2n  1)3n 1 . [7]

n
2r (r 2  2) 2n 1 1
9. Prove by induction that  (r  1) (r  2)
r 1
2 2

( n  2) 2
2
 [7]

Total 56 marks

1 of 6 18/01/17 © MEI
integralmaths.org
 MEI AS FM Series assessment solutions

Solutions to topic assessment

n n
1. 
r
(6r  1)(4r  1)  (24r
1 r 1
2
 10r  1)
n n n
 24 r 2  10  r   1
r 1 r 1 r 1
 24  n(n  1)(2n  1)  10  21 n(n  1)  n
1
6

 n  4(n  1)(2n  1)  5(n  1)  1 

 n  8n 2  12n  4  5 n  5  1 
 n  8n 2  7 n 
 n 2(8n  7)
[5]

n
2. To prove: 
r
(3r
1
2
 2r )  21 n(n  1)(2n  1) .

When n = 1, L.H.S. = 3 – 2 = 1
R.H.S. = 1
2 121  1
So the result is true for n = 1.

k
Assume 
1
r
(3r 2
 2r )  21 k(k  1)(2k  1)
k 1


r
(3r
1
2
 2r )  21 k(k  1)(2k  1)  3(k  1)2  2(k  1)

 21 (k  1) 2k 2  k  6k  6  4 
 21 (k  1)(2k 2  5 k  2)
 21 (k  1)(k  2)(2k  1)
 21 (k  1)(k  2)(2(k  1)  1)

So if the result is true for n = k, then it is true for n = k + 1.

Since it is true for n = 1, then it is true for all positive integers greater than or
equal to 1 by induction.
[7]

1 1 r  2  (r  1)
3. (i)  
r  1 r  2 (r  1)(r  2)
1

(r  1)(r  2)
[1]
n n
1 1 1 
(ii)      
r  1 (r  1)(r  2) r 1  r  1 r 2

2 of 6 18/01/17 © MEI
integralmaths.org
 MEI AS FM Series assessment solutions

1 1 1 1 1 1 
         ...    
2 3 3 4 n  1 n  2 
1 1
 
2 n 2
n 22

2(n  2)
n

2(n  2)
[4]

n
 1 4   1  2n 4n 
4. To prove:  
 1 3   n
 2n  1 
 1  2n 4n   1  2 4   1 4 
For n = 1, 
n 2 n  1  1 2  1  1 3 
    
so true for n = 1.

k
 1 4   1  2k 4k 
Assume true for n = k, so  
 1 3   k
 2k  1 
For n = k+1,
k 1
 1 4   1  2k 4k   1 4 
 1 
 3   k 2k  1   1 3 
 1  2k  4k 4  8k  12k 

 k  2k  1 4k  6k  3 
 1  2k 4  4k 

 k1 2k  3 
 1  2(k  1) 4(k  1) 

 k1 2(k  1)  1 

So if the result is true for n = k, then it is true for n = k + 1.

Since it is true for n = 1, then it is true for all positive integers greater than or
equal to 1 by induction.
[6]

3
5. To prove that un  .
2 5
n

3 3
When n = 1, u1    1
2  5 3
So the result is true for n = 1.

3
Assume uk 
2 5
k

3 of 6 18/01/17 © MEI
integralmaths.org
 MEI AS FM Series assessment solutions

3uk
uk  1 
5 uk  6
3  2k3 5 

5  2k3 5   6
9

15  6(2 k  5 )
3

5  2  2 k  10
3
 k 1
2 5

So if the result is true for n = k, then it is true for n = k + 1.

Since it is true for n = 1, then it is true for all positive integers greater than or
equal to 1 by induction.
[6]
n
6. 1  9  2  33  3  73  ...  n(8n 2  1)   r (8r 2  1)
r 1
n n
 8r 3  r
r 1 r 1

 8  n (n  1)2  21 n(n  1)
1
4
2

 21 n(n  1) 4n(n  1)  1 

 21 n(n  1)(4n 2  4n  1)
 21 n(n  1)(2n  1)2
[5]
1 5 4 (r  1)(r  2)  5 r (r  2)  4r (r  1)
7. (i)    
r r 1 r 2 r (r  1)(r  2)
r  3r  2  5 r 2  10r  4r 2  4r
2

r (r  1)(r  2)
3r  2

r (r  1)(r  2)
[2]
n
1 4 7 1
(ii)    ...  
1  2  3 2  3 4 3 4 5 r  1 r (r  1)(r  2)

4 of 6 18/01/17 © MEI
integralmaths.org
 MEI AS FM Series assessment solutions
n
1 5 4 
      
r 1  r r 1 r 2
 1 5 4   1 5 4  1 5 4
       2  3  4    3  4  5  
 1 2 3     
 1 5 4   1 5 4 
...           
 n 1 n n 1  n n 1 n 2
5 1 4 5 4
 1     
2 2 n 1 n 1 n 2
1 4
1 
n 1 n 2
(n  1)(n  2)  (n  2)  4(n  1)

(n  1)(n  2)
n2

(n  1)(n  2)
[6]

n
8. To prove that 
r
r 3r
1
 3
4  41 (2n  1)3n  1 .

When n = 1, L.H.S. = 1  3  3
R.H.S. = 43  41  1  32  43 
9
4  12
4 3
So the result is true for n = 1.

k
Assume 
1
r
r 3r  43  41 (2k  1)3k  1
k 1


r
r 3r
1
 43  41 (2k  1)3k  1  (k  1)3k  1

 43  41  2k  1  4(k  1) 3k  1
 43  41  6k  3  3k  1
 43  41  2k  1   3  3k  1
 43  41  2(k  1)  1  3k  2

So if the result is true for n = k, then it is true for n = k + 1.

Since it is true for n = 1, then it is true for all positive integers greater than or
equal to 1 by induction.
[7]

n
2 r (r 2  2) 2n 1 1
9. To prove that    .
r  1 (r  1) (r  2) (n  2)
2 2 2
2

2(1  2) 1
When n = 1, L.H.S. = 
2 3
2 2
18

5 of 6 18/01/17 © MEI
integralmaths.org
 MEI AS FM Series assessment solutions

22 1 4 1 1
R.H.S. = 2     
3 2 9 2 18
So the result is true for n = 1.

k
2 r (r 2  2) 2k 1 1
Assume 
r (r  1) (r  2)
1
2 2

(k  2) 2

2
k 1
k 1
2 (r  2)
r 2
2 1 2 k  1((k  1)2  2)

r  1 (r  1) (r  2)
2 2
  
(k  2)2 2 (k  2)2(k  3)2
2 k  1(k  3)2  2 k  1((k  1)2  2) 1
 
(k  2)2(k  3)2 2
k 1
2 (k  6k  9  k  2k  1  2) 1
2 2
 
(k  2)2(k  3)2 2
k 1
2 (2k  8k  8) 1
2
 
(k  2)2(k  3)2 2
k 1
2  2(k  2) 2
1
 
(k  2) (k  3)
2 2
2
k 2
2 1
 
(k  3) 2
2

So if the result is true for n = k, then it is true for n = k + 1.

Since it is true for n = 1, then it is true for all positive integers greater than or
equal to 1 by induction.
[7]

6 of 6 18/01/17 © MEI
integralmaths.org