Extension worksheet Oxford University Press 2012: this may be reproduced for class use solely for the

e purchasers institute
1
EXTENSION MATERIAL
Mathematics as the
science of patterns
1
Try this worksheet after you have completed Chapter 1.
Exercise
1 a A sequence of numbers is given by u
n
n n
=
+
1 1
1
.
i Simplify the expression for u
n
in terms of n and write down the rst six terms
of the sequence.
ii Find u
r
r
n
=

1
in terms of n.
b A sequence of numbers is dened as u
1
= 3, u
n
= 3 + u
n1
n 2, n .
i Write the rst six terms of the sequence.
ii Find S u
n r
r
n
=
=

1
and P u
n r
r
n
=

1
in terms of n.
iii Hence show that P S
n n
=
9
2
n(n + 1)!
2 a Prove using mathematical induction that r
r
n
n
2
1
6
=

= (n + 1)(2n + 1)
b Given that a
n
= 2
n1
and b
n
= n(n 1), evaluate the following:
i a
r
r
n
=

1
and b
r
r
n
=

1
ii a
r
r
n
=

1
and b
r
r
n
=

1
iii
a
a
r
r
n
r
r
n
=
=

+
1
1
1
and
b
b
r
r
n
r
r
n
=
=

1
1
3 Let S
n
n
n
= + + + + +
1
2
2
3
3
4
4
5
1
! ! ! !
...
!
, n
+
.
a Show that S
1
1
2
= , S
2
5
6
= and S
3
23
24
= .
b Find S
4
, S
5
and S
6
.
c Use your results to a and b to make a conjecture about S
n
.
d Prove your conjecture using mathematical induction.
4 A geometric sequence has common ratio
1
1
+

c
c
c . Show that for this sequence to
converge c < 0. S
1
is the sum of a convergent geometric sequence with rst term 1
and common ratio
1
1
1
1
+

c
c
and S
2
is the sum of a convergent geometric sequence with
rst term 1 and ratio
1
1
2
2
+

c
c
. Show that S S
c c
c c
1 2
1 2
1 2
2
=

.
5 Prove by mathematical induction that r n n
r
n
3 2 2
1
1
4
1
=

= + ( ) .
Let S = 1
3
+ 3
3
+ 5
3
+ ... + (2n + 1)
3
show that S = (n + 1)
2
(2n
2
+ 4n + 1).
6 In how many ways can seven girls and ve boys wait in a line if no two boys stand
next to each other?
Notation
When dealing with sequences
we defne
a a a a a
r
r
n
n
=1
1 2 3
= + + + +... , that is
the sum of the frst n terms
of the sequence in Sigma (or
sum) notation and
a a a a a
r
r
n
n
=
1 2 3
1

= ... , that is
the product of the frst n terms
of the sequence in product
notation.
Extension worksheet Oxford University Press 2012: this may be reproduced for class use solely for the purchasers institute
2
EXTENSION MATERIAL
7 A club consists of six men and seven women.
a In how many ways can a committee of ve club members be formed?
b In how many ways can a committee of three men and two women be formed?
c In how many ways can we select a committee of ve members that has at most
one man?
d Two married couples Mr and Mrs Park and Mr and Mrs Kim are members of
the club. In how many different ways can the club members sit around a table
given that Mr Park and Mr Kim sit next to their wives?
8 You are given the digits 2, 3, 7 and 8.
a How many different numbers can be formed taking one, two, three and four
digits if each digit appears only once in any number?
b How many different numbers can be formed taking one, two, three and four
digits if digits may appear more than once in any number
c How many of the numbers found in part a are even and smaller than 500?
d How many of the numbers found in part b are odd and greater than 500?
Extension worksheet Oxford University Press 2012: this may be reproduced for class use solely for the purchasers institute
3
EXTENSION MATERIAL
Chapter 1 extension worked solutions
Exercise
1 a i u
n
n n
n n
n n n n
= = =
+
+
+ +
1 1
1
1
1
1
1 ( ) ( )
The rst six terms are
1
2
1
6
1
12
1
20
1
30
1
42
, , , , , .
ii u
r
r
n
n n
=

1
1
1 2
1
2 3
1
3 4
1
1
...
= =
( ) + ( ) +
1
1 2 3 2 3 4 1
1
1 ! ! n n n n ( ) !( )!
b i The rst six terms are 3, 6, 9, 12, 15, 18.
This is an arithmetic sequence so

S n n
n
n n
= + = +
2
3
2
3 3 1 ( ) ( )
P
n
= 3 6 9 12 3n = 3(1 2 3 4 ... n) = 3n!
S P n n n n
n n
n
= + = + 3 1 1
3
2
9
2
! ( ) ( )!
P S n n n n
n n
n
= + = + 3 1 1
3
2
9
2
! ( ) ( )!
2 Let P n r n n
r
n
n
( ) : ( )( )
2
1
6
1 2 1
=

= + +
When n = 1 LHS = 1

RHS = =
1
6
2 3 1 ( )( )
So P (1) is true
Assume that P (k) is true, i.e. r k k
r
k
k
2
1
6
1 2 1
=

= + + ( )( ).
Required to show that P(k + 1) is true i.e. r k k
r
k
k
2
1
1
1
6
2 2 3
=
+

= + +
+ ( )
( )( ).
When n = k + 1

LHS = + + = + + + +
=

r k k k k
r
k
k
2 2 2
1
1 1 2 1 1
6
( ) ( )( ) ( )

= + + +
+

( )
( ) ( )
k
k k k
1
6
2 1 6 1

= + + = + +
+
( )
+ ( ) ( )
( )( )
k k
k k k k
1
6
1
6
2 7 6 2 2 3
2
Since P (1) is true and we have shown that if P (k) is true P (k + 1) is also true, it follows
using the principle of mathematical induction that P (n) is true for all n
+
.
a i a
r
n
r
n
= + + + + +

=

1 2 4 8 2
1
1
... which is a geometric series

a
r
n
n
r
n
=

=

=

1 1 2
1 2
2
1
1
( )

1 1 1 1 1
2 2
( 1)
n n n n n
r r r r r
r
b n n n n n n
= = = = =
= + = + = +
_ _ _ _ _

6 2
( 1)(2 1) ( 1)
n n
n n n + + + + =
( )
2
( 1) ( 1) ( 1)( 2)
6 6 3
(2 1) 3 2 3
n n n n n
n n n n n n
+ + + +
(

= + + = + + =
Extension worksheet Oxford University Press 2012: this may be reproduced for class use solely for the purchasers institute
4
EXTENSION MATERIAL
ii
( )
( 1)
2
1
1 2 3 ( 1) 1 2 3
1 2 2 2 2 2 2
n n
n
r
n n
r
a

=
+ + + +
= = =
[
!
!

b n n
r
n
= + ( )

( ) ( ) ( ) ( ) 1 2 2 3 3 4 1
1
!

= ( ) + ( ) = + 1 2 3 2 3 4 1 1 ! ! n n n n ( ) !( )!
iii
a
a
r
r
n
r
r
n n n
n n n n
n n
=
=

( )+
= = =

1
1
2
2 1 1
2
2
1
2
1
2 1
2
2
( ) ( )
( )
nn
n n
=

2
3
2
( )

b
b
n n
n n n
n n
n n n
r
r
n
r
r
n
=
=

= = =
+
+ +
+
+ +
1
1
1
1 2
3
3 1
1 2
3 !( )!
( )( )
!( )!
( )( )
nn n
n
!( )!
( )

+
1
2
3 a When n = 1 S
1
1
2
1
2
= =
!
When n = 2 S
2
1
2
2
3
1
2
2
6
3
6
2
6
5
6
= + = + = + =
! !
When n = 3 S
3
1
2
2
3
3
4
1
2
2
6
3
24
12
24
8
24
3
24
23
24
= + + = + + = + + =
! ! !
b When n = 4 S
4
23
24
4
5
115
120
4
120
119
120
= + = + =
!
When n = 5 S
5
119
120
5
6
714
720
5
720
719
720
= + = + =
!
When n = 6 S
6
719
720
6
7
5033
5040
6
5040
5039
5040
= + = + =
!
c S
n
n
n
=
+
+
( )!
( )!
1 1
1
d Let S
n
n
n
=

+ + + + +
1
2
2
3
3
4
4
5
1
! ! ! !
...
!
, n
+
.
Let P n
n
n
n
n
r
n
( ) :
! ! ! !
...
!
( )!
( )!
1
2
2
3
3
4
4
5
1 1 1
1
1
+ + + + + =
+
+
=

When n = 1 LHS=
1
2

RHS= =
2 1
2
1
2
!
!
So P (1) is true
Assume that P (k) is true, i.e.
1
2
2
3
3
4
4
5
1 1 1
1
1
! ! ! !
...
!
( )!
( )!
+ + + + + =
+
+
=

k
k
k
k
r
k
.
Required to show that P (k + 1) is true i.e.
1
2
2
3
3
4
4
5 1
2 1
2
1
1
! ! ! !
...
( )!
( )!
( )!
+ + + + + =
+
+
+
=
+

k
k
k
k
r
k
.
When n = k + 1

LHS= + + + + + =
+
=
+

1
2
2
3
3
4
4
5 1
1
1
! ! ! ! ( )!
...
k
k
r
k
Since P (1) is true and we have shown that if P (k) is true P (k + 1) is also true, it
follows using the principle of mathematical induction that P (n) is true for all n
+
.
4 For convergence
1
1
1
+

<
c
c
When c > 0,
1
1
1
+

>
c
c
and so the series will not converge.
When 1 < c < 0, let c = k, k > 0.
r
c
c
k
k
= =
+

+
1
1
1
1
and since k > 0 it follows that 0 > r > 1 hence the series will converge.
When c < 1 it follows that 1 1 1 0 + < < < c c r and so the sum converges.
S
c
c
c c
c
c
c
1
1
1
1
1
1
1 1
1
1
2
1
1
1
1
= = =

( ) ( )
Similarly S
c
c
2
1
2
2
2
=


S S
c
c
c
c
c c c c
c c
1 2
1
2
1
2
1 1
2
1
1
2
2
1 2 2 1
1 2
= = =

( ) ( ) cc c
c c
1 2
1 2
2

Extension worksheet Oxford University Press 2012: this may be reproduced for class use solely for the purchasers institute
5
EXTENSION MATERIAL
5 Consider the statement P(n): r n n
r
n
3 2 2
1
1
4
1
=

= + ( )
When n = 1
LHS = 1
3
= 1

2 2
1
4
RHS = (1 )(2 ) =1
LHS RHS =
so P (1) is true.
Assume P (k) is true i.e. r k k
r
k
3 2 2
1
1
4
1
=

= + ( )
When n = k + 1

LHS = + + = + + + = + + =
=

+ +
r k k k k k k
r
k
k k
3 3 2 2 3 2
1
2
1 1 1 4 4
1
4
1
4
1
( ) ( ) ( ) ( )
( ) ( )) ( )
2 2
2
4
k +
RHS= + + + + =
+ + 1
4
1 2
4
1 1 1
2 2
2 2
( ) ( )
( ) ( )
k k
k k
LHS = RHS
So P (k + 1) is true if P (k) is true. But since it was shown that P (1) is true, it follows
by the principle of mathematical induction that P (n) is true for all n
+

Let R r n n
r
n
n n
= = = + +
=
+

+ +
3 2 2
1
2 1 2 2
2 1 2 2
4
2 1 1
( ) ( )
( ) ( )
S = R (2
3
+ 4
3
+ 6
3
+ 8
3
+...+ (2n)
3
) = R 2
3
(1
3
+ 2
3
+ 3
3
+...+ n
3
)
S n n n n n n
n n
= + + = + + = +
+

( ) ( ) ( ) ( ) ( ) ( )
( )
2 1 1 8 1 2 1 2 1
2 2 2 2 2
2 2
1
4
22 2
2 4 1 ( ) n n + +
6 There are seven girls and ve boys. The number of ways of arranging seven girls is 7!
No two boys are not allowed to stand next to each other so we can solve the problem
by creating spaces which can be lled by boys between the girls as follows.
_ G _ G _ G _ G _ G _ G _ G _
As can be seen the boys can now ll out eight possible spaces, so the number of
arrangement of boys is given by
P
5
8
8
8 5
8
3
= =

!
( )!
!
!
But each of these arrangements can be combined with 7! arrangements for the girls.
So the number of ways of arranging the girls and boys so that no two boys stand
together is given by

8
3
7 33868800
!
!
! =
7 a Since order is not important we are dealing with combinations.
We need to choose 5 out of 13

13
5
1287

=
b
6
3
7
2
420

=
c Two possible committees: one man and four women; or no men and ve women

6
1
7
4
7
5
210 21 231

+ = + =
d Each couple is now taken as one unit. We now have a total of 11 to be seated
around a table. But each couple can sit in two ways (spouse on the left or on the
right).
10! 2! 2! = 14515200
Extension worksheet Oxford University Press 2012: this may be reproduced for class use solely for the purchasers institute
6
EXTENSION MATERIAL
8 a Number of ways of forming 1 digit numbers is 4
Number of ways of forming 2 digit numbers is 4 3 = 12
Number of ways of forming 3 digit numbers is 4 3 2 = 24
Number of ways of forming 4 digit numbers is 4 3 2 1 = 24
In total: 4 + 12 + 24 + 24 = 64
b Number of ways of forming 1 digit numbers is 4
Number of ways of forming 2 digit numbers is 4
2
= 16
Number of ways of forming 3 digit numbers is 4
3
= 64
Number of ways of forming 4 digit numbers is 4
4
= 256
In total: 4 + 16 + 64 + 256 = 340
c We cannot have any 4 digit numbers
Even one digit numbers less than 500 2

Even 2 digit numbers :
Two ways of choosing the units digit
Even three di igit numbers :
Three ways of choosing the tens digit

= 2 3 6
Two ways of choosing the units digit i.e. 2 or 8
If 2 is in the units then there is only one way of choosing the hundreds digit
leaving two ways of choosing the tens digit.
If 8 is the units digit we have two ways of choosing the hundreds digit and
another two ways of choosing the tens digit.
In all 2 + 4 ways of forming 3 digit even numbers less than 500.
In total: 2 + 6 + 6 = 14
d We can only have 3 digit and 4 digit numbers
Odd 3 digit numbers bigger than 500:
2 ways of choosing the hundreds digit
4 ways of choosing the tens digit
2 ways of choosing the units digit
Odd 4 digit numbers greater than 500:
4 ways of choosing the thousands digit
4 ways of choosing the hundreds digit
4 ways of choosing the tens digit
2 ways of choosing the units digit
In total: 2 4 2 + 4
3
2 = 144.