Ch1-2 Solutions PDF

Worked solutions
From patterns to generalizations:

1 sequences and series
Skills check
1 a 3x  5x  20  20x  4
 8x  20x  20  4
 12x  24
x  2
x 1 x 3
b 
2x  1 2x  1
  x  1 2x  1   x  3 2x  1
 2 x 2  3x  1  2 x 2  7 x  3
 10x  2
1
x 
5
1  2 
2
1 2
2 a 
1 2 1  2 1  2 
12 2 2 32 2
 
12 1
3  2 2
b
2 2

2 2 1 3  
1 3 1  3 1  3 
2 2 2 6

2
 2 6
x 1 2
3  
x  1 2x  1 x  1
x 2x  1  x  1   x  1  x  1  2  x  1 2 x  1

 x  1 2x  1  x  1

  
x 2 x  3x  1  x 2  1  2 2 x 2  x  1
2
  
x 2

 1 2x  1
2 x  3x  x  x  1  4 x 2  2 x  2
3 2 2

x 2

 1 2x  1
2 x 3  3x  1
(x 2  1)(2x  1)
© Oxford University Press 2019 1

Worked solutions
Exercise 1A
1 a Next three terms are 9, 10.5, 12
The sequence is obtained by adding 1.5 to the previous term and can be written as
3, 3  1.5, 3  2(1.5), ..., 3  (n  1)(1.5)

un  1.5n  1.5, n 
b Next three terms are 5, 2, -1
The sequence is obtained by subtracting 3 from the previous term and can be written as
17, 17   3 , 17  2(3), ..., 17  (n  1)(3)

un  20  3n, n 
c Next three terms are 243, 729, 2187
The sequence is obtained by multiplying the previous term by 3 and can be written as
3, 3  3, 3  32, 3  33, ..., 3  3n1
un  3n
13 16 19
d Next three terms are , ,
16 19 22
The sequence is obtained by adding 3 to both the previous numerator and denominator and
1 1  3 1  2  3  1  3 3  1   n  1 3
can be written as , , , , ...,
4 4  3 4  2  3  4  3 3  4   n  1 3
3n  2 
un  , n
3n  1
1 1 1
e Next three terms are , ,
90 132 182
1 1 1 1
The sequence can be written as , , , ...,
12 3 4 5 6 (2n  1)(2n)
1 
un  , n
(2n  1)(2n)
2 a ur  3  2r
u1  3  2  1
u2  3  2  2  1
u3  3  2  3  3
u4  3  2  4  5
u5  3  2  5  7
1, -1, -3, -5, -7
r
b ur 
2r  1
1 2 3 4 5
u1  , u2  , u3  , u4  , u5 
2 1  1 22 1 23 1 24 1 25 1

Worked solutions
1 2 3 4 5
, , , ,
3 5 7 9 11
ur  2r   1 r
r
c
u1  2  1   1  1  1
1
u2  2  2   1  2  6
2
u3  2  3   1  3  3
3
u4  2  4   1  4  12
4
u5  2  5   1  5  5
5
1, 6, 3, 12, 5
ur   1  2
r
d
u1   1  2  2
1
u2   1  2  2
2
u3   1  2  2
3
u4   1  2  2
4
u5   1  2  2
5
-2, 2, -2, 2, -2
3
e ur 
2r 1
3
u1  3
211
3 3
u2  
22 1 2
3 3
u3  
23 1 4
3 3
u4  
24 1 8
3 3
u5  
25 1 16
3 3 3 3
3, , , ,
2 4 8 16
3 a 5, 10, 15, 20, …. The multiples of 5
ur   5r , r 
b 6, 14, 22, 30, … The sequence is obtained by adding 8 to the previous term and can be
written as
ur   8r  2 , r 
1
c The sequence is obtained by multiplying the previous term by and can be written as
2

Worked solutions
1
ur   2r  , r 
 
1
d The sequence is obtained by multiplying the previous term by  and can be written as
3
 1
r 1

ur     3  
, r 


  

e The sequence can be written as 0  2, 1  3, 2  4, 3  5, ..., (n  1)  (n  1)
OR The sequence can be written as 12  1, 22  1, 32  1, 42  1, ...
ur   r 2  1 , r 
4
4 a  2r 1  r   0  4  12  24
r 1
  1
r
b r 2  0  1  4  9  16  25
r 0
5
r 1 2 3 4 5
c  3r  1  2  5  8  11  14
r 1
4
d 5  5  5  5  5
r 1
Explanation: think of this as

4 4 4 4
r
 5   5r
r 1 r 1
0
or 5  5  r
r 1 r 1
3
e  r
r 0
2

 3  3  2  1  6

r 1 11 2 1 3 1 4 1 5 1
5 a 
r 1 r
2
 2  2  2 
1 2 3 42
 2  ...
5
3 4 5 6
2     ...
4 9 16 25
 1  1   1   1   1   1  ...

r 1 2 3 4 5

b  2r 
2 1  1 2 2  1 2 3  1 2  4   1 2 5  1
2 2 2 2 2 2
r 1 1
1 1 1 1
 1      ...
7 17 31 49
20
c  r 5r  1  1 5  1  1  2 5  2  1  3 5  3  1  4 5  4  1  5 5  5  1  ...
r 1
 4  18  42  76  120
5
d  2
r 0
r
     
 3  20  3  21  3  22  3  23  3  24  3  ...     
 3  1  1  5  13  ...

Worked solutions

e r
r 1
r
 11  22  33  44  55  ...  1  4  27  256  3125  ...
6 a The series can be written as 8  8  3  8  2  3  8  3  3  8  4  3
It has five terms and the general term can be written as ur  11  3r
 11  3r 
r 1
b The series can be written as 1  3  2  5  3  7   4  9  5  11
It has five terms and the general term can be written as ur  r  2r  1
 r 2r  1
r 1
0 1 2 3 4 5
c The series can be written as       ...
2 3 4 5 6 7
r 1
It is an infinite series and the general term can be written as ur 
r 1
6
r 1
 r 1
r 1
d The series can be written as 1²  3²  5²  7²  9²
It has five terms and the general term can be written as ur  2r  1 ²
 2r  1
2
r 1
e The series consists of the multiples of 3k
It has five terms and the general term can be written as ur  r  3k 
 3kr
r 1
Exercise 1B
1 a u1  3, d  5
 un  3  5  n  1  5n  2
b u1  101, d  4
 un  101  4  n  1  105  4n
c u1  a  3, d  4
 un  a  3  4  n  1  4n  a  7
d u1  20, d  15

Worked solutions
 un  20  15  n  1  15n  35
2 a u1  5, d  6
 u15  5  6 15  1  5  6 14  89
b u1  10, d  7
u11  10  7 11  1  10  7 10  60
c u1  a, d  2
u17  a  2 17  1  a  2 16  a  32
d u1  16, d  4
 un1  16  4  n  1  1  16  4n
3 a u1  16, d  5
un  21  5n  64
 5n  85
 n  17
b u1  108, d  7
un  7n  115  60
 7n  175
 n  25
c u1  15, d  4
un  11  4n  95
 4n  84
 n  21
d u1  2a  5, d  2
un  2n  2a  7  2a  23
 2n  30
 n  15
4 a u1  5 1  7  2,
u2  5 2   7  3
d  3  (2)  5
b u1  3 1  11  14,
u2  3 2   11  17,
d  17  14  3
c u1  6  11 1  5,
u2  6  11 2   16,
d  16  (5)  11
d u1  2a  2 1  1  2a  3,
u2  2a  2 2   1  2a  5,
d  2a  5  2a  3  2

Worked solutions
5 u6  u1  d 6  1  u1  7 5  u1  35  37
 u1  2
 un  2  7  n  1  7n  5
6 u5  u1  d 5  1  0  u1  4d  0
u15  u1  d 15  1  180  u1  14d  180

Subtracting the first equation from the second:
10d  180  d  18
and substituting this into the first equation,
u1  4 18   72
7 Let the three terms be a, a  d, a  2d
 a   a  d    a  2d   3a  3d  24  a  d  8
and a  a  d   a  2d   640
Substituting the first equation into the second,
 
a  8  a  2  8  a  640
 8a 16  a  640 4, 8, 12
 16a  a2  80
 a2  16a  80  0
  a  20   a  4   0 so a  4 or a  20
If a  4, d  12 so the numbers are -4, 8, 20
If a  20, d  12 so the numbers are 20, 8, -4
Let the three terms be a  d, a, a  d
Sum of terms 3a  24  a  8

Product of terms a a2  d2  640
Substitute for a and solve
 
8 64  d 2  640

 64  d 2  80 
2
 d  144
 d  12
Substituting for a and d in a  d, a, a  d the three numbers would either be or 20, 8,  4
8 In year 2017, Jung Ho earned 38000  17 500  46500
38000  1.5=57000
 38000  500n  57000
 n  38 so in the year 2038
9 a This is an arithmetic series with u1  3, d  3  3  6
un  9  6n  93
 6n  102
 n  17

Worked solutions
n
Using the formula Sn 
2
u1  un 
17 17
S17 
2
3  (93)  2  90  765
b This is an arithmetic series with u1  31, d  40  31  9
un  9n  22  517
 9n  495
 n  55
55 55
 S55 
2
31  517  2 548  15070
c This is an arithmetic series with u1  a  1, d  a  2  (a  1)  3
un   a  1   n  1  3  a  146
 a  3n  4  a  146
 3n  150
 n  50
50
 S50 
2
 a  1  a  146  25 2a  145  50a  3625
10 a Since 3r  8 is linear relation this is an arithmetic series with 50 terms.
u1  3  8  5
u50  150  8  142
50
S50 
2
 5  142  3425
b Since 7  8r is linear relation this is an arithmetic series with 100 terms.
u1  7  8  1
u100  7  800  793
100
S100 
2
 1  793  39700
c Since 2ar  1 is linear relation in r , a is a constant this is an arithmetic series with 20

terms.
u1  2a  1
u20  40a  1
20
S20 
2
2a  1  40a  1  420a  20
11 a This is an arithmetic sequence with u1  4, d  5
n
2
2u1  (n  1)d 
15
 S15 
2
2  4  5  14  465
b This is an arithmetic sequence with u1  3, d  8

Worked solutions
n
2
2u1  (n  1)d 
10
 S10 
2
2  3  9  8  390
c This is an arithmetic sequence with u1  1, d  5
n
2
2u1  (n  1)d 
20
 S20 
2
2  1  5  19  930
12 u5  u1  4d  19
u10  u1  9d  39
 u10  u5  5d  20  d  4
 u1  19  4d  3
25
 S25 
2
2  3  24  4  1275
13 a u3  u1  2d  8
10
S10 
2
2u1  9d   230  2u1  9d  46
Multiplying the first equation by 9: 9u1  18d  72
Multiplying the second equation by 2: 4u1  18d  92
Subtracting: 5u1  20  u1  4
8  u1
b u1  4  d   6
2
13
 S13 
2
2  4  6  12  416
14 S1  6 1  3 1  3  u1  3
2
S2  6 2   3 2   12  12  0
2
So S2  S1  u2  3
d  u2  u1  3  3  6
The first four terms of the sequence are
3, -3, -9, -15
15 S  1  3  5  ...  299 There are 150 odd numbers since 2n  1  299  n  150
n
2
u1  un 
150
S150 
2
1  299  22500
Exercise 1C
1 a u5  34  81

Worked solutions
un  3n1
1
b u5 
2
n 1
1 1
 23 2
1 n
un  8    24 n 
2 2n  4
x9
c u5 
2
x 2 x 2n 1
 
n 1
un  x 
2 2
d u5  3
un  3  1
n
21 1
2 a r  
63 3
5
1 7
u6  63   
3
  27
81 1
b r  
2  243 6
6
1 1
u7  243    
6 192
a 2 1
c r   
6 a 3
4
a  1 a
u5    
2  3 162
0.06
3 a r  3
0.02
0.02  3n 1  393.66
 3n 1  19683
Using solve or Nsolve (depending on GDC type)
n = 10
32 1
b r  
64 2
n 1
1 1
64   
2
  128
 26  21 n  27
 7  n  7
 n  14
or using technology

Worked solutions
4 u4  u1r 3  6
u7  u1r 6  48
u1r 6 48
 3
 r3  8r 2
u1r 6
6 3
 u1  
23 4
5 u3  u1r 2  6
u5  u1r 4  54
u5 u1r 4 54
   r2   9  r  3
u3 u1r 2 6
6 2
 u1  
 3
2
3
2
 3  162 depending on which ratio is used
5
u6  u1r 5 
3
6 u1  9
u5  u1r 4  9r 4  16
16 2 2 3
 r4  r  
9 3 3
So two different sequences arise depending on which common ratio is
used. In either case, the seventh term is
6
 2 3 64
u7  u1r 6  9    
 3 3
 
a2 a4
7 r  
3a  1 a  2
  a  2    a  4  3a  1
2
 a2  4a  4  3a2  11a  4
 2a2  15a  8  0
 2a  1  a  8   0
1
a or a  8
2
1
 2
1 2
If a   , r   3
2  1
3   1
 2
2
If a  8, r 
5
a 1 a 2
8 r  
a 1 a 1

Worked solutions
  a  1   a  2   a  1
2
 a2  2a  1  a2  3a  2
1
 5a  1  a 
5
1
1
3
r  5 
1 2
1
5
4
u1r 3  a  1  
5
3
 2  4 32
 u1        
 3   5  135
1
9 a r 
3
6
 1
1   
 S6  3   3   182
 1 81
1   
 3
4 1
b r  
8 2
10
1
1 
2 1023
 S10  8 
1 64
1
2
0.03
c r   0.3
0.1
1  0.3
15
 S15  0.1   0.143  to 3s.f.

1  0.3
0.03
d r   0.3
0.1
1   0.3
15
S15  0.1
1   0.3
 0.0769 3s.f.
6
1
1 
 7   19608  57.2
6
10 a 7 3 i
 72 
1 343
 to 3s.f.
i 1
1
7
Or using technology
n 1 n 1
10n  1 5
b  5  10
i 0
i
 5 10i  5 
i 0 10  1

9
 
10n  1 11 u1  3

Worked solutions
1
u7  u1r 6  3r 6 
243
1 1
r6  r 
729 3
Therefore there are two possible common ratios, each corresponding
to a different sum to infinity
1 3 9
r  : S  
3  1 4
1   
 3
1 3 9
r  : S  
3 1 2
1
3
3
12 a u1  S1  
2
 1
2
 1 1  3
u2  S2  S1      1      1 
 2  2   4
 1
3
 1 2  3
u3  S3  S2      1      1  
 2   2   8
1
b The terms are in geometric progression with r   . To see this in general, note
2
 1
n
 1 n 1   1 n  1 n 1
un  Sn  Sn 1      1      1        
 2  2    2   2
n 1 n 1
 1  1  3  1
       1     
 2  2  2  2
i.e. the form of a general term in a geometric progression with first
3 1
term  and common ratio 
2 2
u3 28 1  a
13 r   1 a
u2 28
28
S3   28  28 1  a  147
1 a
28
  28a  91
1 a
 28  28a 1  a  91 1  a 
 28  28a  28a2  91  91a
 28a2  63a  63  0
 4a2  9a  9  0
  4a  3   a  3   0
3
so a  or a  3
4
1  a  1  0  a  2 for convergence
3
a 
4
1
 r 1 a 
4
14 Let the three pieces have lengths u1, u2 and u3

Worked solutions
u3  u1r 2  2u1  r 2  2  r  2
Since the length of the pieces must sum to 2,
u1  2u1  2u1  3  2 u1  2 
 u1 
2


2 3 2 
3 2 7
i 2 3 4

x  x  x  x  x 
  1
i
15   1     1    1    1    1  ...
i 0 2  2  2  2  2 
x 
The common ratio is    1 
2 
Therefore the series converges when
x 
   1  1
 2 
x
 1  1
2
x
 1  1  1
2
 2  x  2  2
 4  x  0
When x  0.8,
u1  1 and r  0.6
1 5
 S  
1   0.6  8
Exercise 1D
1 a 220  7 10  290
8
b S8 
2
220  290  2040
1
c 220  10n 
2
600  20n
 20n  80
n4
so 2014
2 Let Jane's starting salary be S
Then,
S 1.015
11
 49650
49650
S  42149.535....
1.015
11
so Jane's starting salary was €42150 to the nearest euro
3 a 2  22  23  24  30
b 2  22  23  24  ...  2n  106
The left hand side is a geometric series with first term 2 and common ratio 2

Worked solutions
2(2n  1)
  106
2 1
 2(2n  1)  106
Using GDC
Answer: 19 generations
10
4 S10 
2
2  200  9  20  2900
so 2.9kg
On the first trial she uses 100g of sugar and on the second
she uses 110g. Thereafter, if the sequence is to become geometric
the common ratio is 1.1
1.1n  1
 0.1  1.5
1.1  1
 1.1n  2.5
Using GDC n  9.614
so 9 trials
In general, the geometric model is not reliable, since if Prisana
were to carry out a large number of trials then the cake will become
excessively sweet (since geometric growth is greater than linear growth)
In fact, the ratio of sugar to flour would eventually become 1 (i.e. the mix
is entirely sugar) in the (albeit unrealistic) case that Prisana carries out the trial
a large number of times
5 a Second: 12  12  2
2 2
 2  2
Third:       1
 2   2 
2 2
1 1 1
Fourth:     
2 2 2
b
3
2  2  1 
2
1
2
1 3 7
2  2  2
 3
     3 2 
 4
7 2  
c The length converges to a finite value since the common ratio between two consecutive side
lengths that are one.
1
d Area of triangle = base  height
2
Required area
1 2  1  
2 2 2 2 2 2 2
1  1  1  1  1  1 
= 1                
2   2 2 2 2  4 4 2 8 8 2  
 
1 1 
2 3 4 5 6 7
1 1 1 1 1 1
 1                    
2  2 2 2 2 2 2  2  
  1 
8
 1 1     
1   2   
8
1
     1     0.996
2 1  2
1
 2 
 

Worked solutions
 
1  1 
e S     1
2  1
 1  
 2
6 a Interest 12% pa  1% per month
Let the payment per month be x . Interest is compounded monthly
After one month the amount due is
1500  1.01  x
After 2 months the amount due is 1500  1.01  x   1.01  x  1500 1.01  1.01 x  x
2
After 3 months the amount due is
1500 1.01 2

 1.01 x  x  1.01  x  1500 1.01  1.01 x  1.01 x  x
3 2
After 24 months the amount due would be
1500 1.01  1.01 x  1.01

24 23 22
x  ...  x  0
 
 1500 1.01  x  1.01  1.01  ...  1   0
24 23 22
 
 Geometric series 
 1.0124  1 
 1500 1.01
24
 x 0
 1.01  1 
 1500 1.01
24

 100 x 1.0124  1 
 15 1.01
24
 x 1.01  24
1 
15 1.01
24
x 
1.01 24
1 
Using technology
Monthly payments of $70.61
b Total amount paid
$70.61  24  $1694.64
=$1695
n
7 a
2

2  30  6  n  1  570 
 60n  6n  n  1  1140
 n2  9n  190  0
  n  19   n  10   0
 n  10
b 3  0.95 10  12.5  12.5m
c 2.4  9(0.15)  3.75m
8 a Rapid: 200  10 0.05 200  300 so $300

Worked solutions
Quick: 200 1.035

10
 282.11975... so $282
Rapid/Quick: 100  10  0.05 100  100 1.035

10
 291.0599... so $291
b Rapid: 200  25 0.05 200  450 so $450
Quick: 200 1.035

25
 472.649... so $473
Rapid/Quick: 100  25  0.05 100  100 1.035

25
 461.324... so $461
c The investments will be approximately equal when
After n years
Rapid investment: 200  10n
Quick investment: 200  1.034n
Rapid/Quick : 100  5n  100  1.035n
Using tables on GDC:
After 21 years the three investments yield approximately the same amount.
9 a Suppose Karim invested $x in savings, therefore $  x  1000 in bonds
and $  4000  2x  in shares

75  0.015  x   0.025  x  1000  0.01  4000  2x 
 90  0.06 x
 x  1500
so $1500 in savings, $2500 in bonds and $1000 in shares
b Now Karim is investing $1500 in savings for 10 years,
$990 in savings for 9 years and $2500 in bonds for 10 years.

Therefore,
1500  10  0.015 1500  990  9  0.015  990  2500 1.025
10
 6048.861...
so $6048.86 =$6049 to the nearest dollar
2500 1.025  2500  10 0.0152500  6048.86136...  26.3500...

10
c
so $26
10 a x(1  0.375  0.3752  0.3753 ) , where x is the amount administered each time.
b x(1  .375  .3752  ...  0.37539 )  8

 1  0.37540 
 x 8
 1  0.375 
8 1  0.375
x

1  0.37540 
5 mg should be administered each time.
c The amount of medication in the bloodsteam after n administrations is given by

Worked solutions
 1  0.375n 
5 7
 1  0.375 
7 1  0.375
 1  0.375n 
5
 0.375n  1 
7 1  0.375
5
Using technology to solve:
There are 7mg/ml drug in the bloodstream after the third administration.
Exercise 1E
1  a  b
2
    
  a  b  a2  2ab  b2  a2  2ab  b2  2a2  2b2  2 a2  b2
2

2 A general odd number can be written in the form 2k  1 with k 
 Consider two general odd numbers 2n  1 and 2m  1, n, m 

Then,
2n  1 2m  1  4nm  2n  2m  1  2 2nm  n  m  1  2p  1
p  2nm  n  m 
 2p  1 is an odd number
3 A four digit number represented by a3a2a1a0 not to be confused with a product 

can be written in the form
N  a3  103  a2  102  a1  10  a0

You are given that a3  a2  a1  a0  9m, m 
 N   999  1 a3   99  1 a2  9  1 a1  a0
  999a3  99a2  9a1    a3  a2  a1  a0 
 9 111a3  11a2  a1   9m
 9(111a3  11a2  a1  m)
i.e. if 9 divides the sum of the digits the number itself is divisible by 9
Hence 3978, 9864 and 5670 are divisible by 9 but 5453 and 7898 are not
 ad  bc    bd  ac 
2 2
4
 a2d 2  2abcd  b2c 2  b2d 2  2abcd  a2c 2

 a2d 2  b2c 2  b2d 2  a2c 2
  
 a2 c 2  d 2  b2 c 2  d 2 

 a b2 2
c  d 
2 2
1 2 1 2 1 2
5 S       ...
3 9 27 81 243 729

Worked solutions
1 1 1 2 2 2
S     ...     ...
3 27 243 9 81 729
1 1 1
2
1 1
4
 1 1  1  1  1 2 
S         ...  2         ...
3 3 3 3 3 9 9 9 9 9 
 
1
Two different infinite geometric series, each with common ratio ,
9
and so both series converge.
 1   1 
 3   
S    2 9 
 1  1   1  1 
 9  9
1 9 1 9 1
     2   
3 8 9 8 8
6 Consider an arbitrary integer n  . Then,
 n  1
2
 n2  n2  2n  1  n2  2n  1 is odd
1 1 1
7  
n 1 n n 1
n  n  1   n  1  n  1  n  n  1

n  n  1  n  1


n  n  n2  1  n2  n
2


n n2  1 
2
n 1


n n2  1 
1 1 1 62  1 37 37
     
5 6 7 6 62  7 
6 29  174 
ab ab
8 Area of trapezium:
2
h
2
 a  b
Similarly, the area in terms of the triangles BAE, BEC and EDC are
1 1 1 1
ab  c 2  ab  ab  c 2
2 2 2 2
Equating the areas,
 a  b
2
1 2
c   a  b   2ab  c 2
2
 ab 
2 2
 a2  2ab  b2  2ab  c 2
 a2  b2  c 2
Exercise 1F
1 Suppose for the sake of contradiction that n2 is odd but n is even
Then n2  2m  1 for some m  and n  2k for some k 

But then n2  2k   4k 2  2m  1
2
4k 2 is even but 2m  1 is odd, so this is a contradiction

 n2 is odd  n is also odd

Worked solutions
m
2 Assume for the sake of contradiction that 3 where m, n 
n
are coprime (i.e. they have no common factors).

a2
Then, 3   a2  3b2
b2
If p is a prime number and p divides a2 , where a   , then p must divide a.
Therefore, a must be a multiple of 3  a  3k for some
k  . This implies 9k 2  3b2  b2  3k 2 so b is also divisible
by 3.
Therefore 3 is a common factor of a and b. But we assumed that
a and b have no common factors, so this is a contradiction.
3 Suppose for the sake of contradiction that 5 2 is irrational
5 5 a
Then 2 can be written in the form 2  where
b

a, b  are relatively coprime (i.e. share no common factors)
 a5  2b5 so 2 divides a  a  2m for some m  
5 4 5 2
 b  2 m so b is even which means that b is also even.
So 2 divides both a and b, but it was assumed that a and b
shared no common factors. This is a contradiction.
4 Suppose for the sake of contradiction that there exist p, q 
such that p2  8q  11  0
 p2  8q  11 so p is an odd integer
 p  2k  1 for some k 
 2k  1  8q  11
2
 4k 2  4k  1  8q  11

 4 k 2  k  2q  10 
 2 k 2
 k  2q   5
but LHS is even whereas RHS is odd; this is a contradiction
5 Suppose for the sake of contradiction that for some a, b  , 12a2  6b2  0
2
a2  a  a
 12a2  6b2  2a2  b2  2     2  ,
b2  b  b
a contradiction since we know that 2 is irrational.
6 Suppose for the sake of contradiction that for a, b, c  , the equation a2  b2  c2
You are given that a2  b2  c2, where a, b, c  and c  2k  1, k 
We are required to prove that either a or b must be even.
Assume that both a and b are odd

Worked solutions
a  2p  1 and b  2q  1, p, q 
 a2  b2  2p  1  2q  1
2 2
 4 p2  4 p  1  4q2  4q  1
 2(2 p2  2 p  2q2  2q  1)  2n, n 
You know that a2  b2  c 2 and c  2k  1, k 

c 2  2k  1  4k 2  4k  1  2 2k 2  2k  1  2m  1, m 
2

2 2 2
a b c
 2n  2m  1
The left-hand side is an even number and the right-hand side represents an odd number.
This is a contradiction.
Now let us assume that both a and b are even a  2p and b  2q

a2  b2  2p   2q   2 2p2  2q2  2s, s 
2 2

2 2 2
a b c
 2s  2m  1
The left-hand side is an even number and the right-hand side represents an odd number which
is a contradiction
Hence, we have proved that precisely one of a or b must be even.
7 Suppose there exists n, k  such that n2  2  4k
Then n must be divisible by 2 and can be written in the form

n  2m with m 
 4m2  2  4k
1
 m2  k  
2
But the left-hand side is an integer whereas the right-hand side is
not; this is a contradiction
8 Suppose p is irrational, q is rational and for the sake of contradiction that
p  q is rational. Then,
a c
q and p  q  for some a, b, c, d 
b d
c c a bc  ad
 p  q    
d d b bd
But by assumption, p was irrational. This is a contradiction.

9 Let m, n  and suppose for the sake of contradiction that m2  n2  1
Then,
m2  n2   m  n   m  n   1
Since m, n  
,  m  n ,  m  n  
The product of two positive integers can only give 1, if both are 1 or both are  1.
i.e.
m  n  m  n  n  n

This is a contradiction since n 

Worked solutions
10 a Take m  n  1
b Take any prime number: the number is certainly divisible by itself
but is still a prime
c Take n  4 : 24  1  16  1  15  35
d Take the same example as in part c.
e 1  2  3  6, not divisible by 4
f 1  2  3  4  10, not divisible by 4
Exercise 1G
1 a i 1 3 1 1 3 5  3 1 1 35 7 5 31
ii 1  4 49 9  16
b based on line divisions

1 3 5  7  9  7 5  3 1 1  3  5  7  9  11  9  7  5  3  1
based on colour 16  25 25  36
c Organizing our findings
13 1  1 4
13 5 3 1  4  9
1  3  5  7  5  3  1  9  16
1  3  5  7  9  7  5  3  1  16  25
1  3  5  7  9  11  9  7  5  3  1  25  36
.
.
.
2 1  3  5  ...  2k  1  2k  1  k 2  (k  1)2
Conjecture: P(n): 2 1  3  5  ...  2n  1  2n  1  n2  (n  1)2, n  

, n2
 
d LHS = 2 1  3  5  ...  2n  1  2n  1
 sum of first n odd numbers 
n 
 2  1  (2n  1)   2n  1
2 
 n(2n)  2n  1
 2n2  2n  1
 n2  n2  2n  1
 n2  (n  1)2
e P(n): 2 1  3  5  ...  2n  1  2n  1  n2  (n  1)2, n  

, n2
When n  2
LHS = 2(1)  3  5
RHS= 12  22  5

Worked solutions
LHS=RHS therefore P(1) is true.


Assume that P(k) is true for some k  2, k 
i.e. 2 1  3  5  ...  2k  1  2k  1  k 2  (k  1)2
Required to prove that P(k+1) is true
i.e. 2 1  3  5  ...  (2k  1)  (2k  1)  2k  3   k  1  (k  2)2 using the assumption

2
LHS=  2 1  3  5  ...  (2k  1)  2(2k  1)  2k  3

 2 1  3  5  ...  (2k  1)  (2k  1)  4k  4
 k 2  (k  1)2  4k  4
 (k  1)2  k 2  4k  2
  k  1  (k  2)2
2

Since P(2) was shown to be true, and it was shown that if P(k) is true, where k  , k 2,
then P(k+1) is true, it follows by the principle of mathematical induction that P(n) is true for

all n  , n2
1  1
2 a P  n : 12  22  32  ...  n2  n  n  1  n  
3  2
When n  1,
LHS  12  1
1  1 1 3
RHS  1 1  1 1 1    2     1
3  2 3 2
LHS = RHS  P(1) is true.

Assume the statement is true for n  k , where k 
1 3
Required to prove that when n  k  1, 12  22  32  ...  k 2   k  1   k  1  k  2  k  2 
2
3  
LHS = 12  22  32  ...  k 2   k  1
2
1  1
k  k  1  k     k  1
2

3  2
1  1 
  k  1  k  k     k  1 
 3  2  
1   1 
  k  1  k  k    3  k  1 
3   2 
1 k

3
 k  1  k 2  2  3k  3 
 
1  2 7k 
  k  1  k   3
3  2 
1  2k 2  7k  6 

3
 k  1 
2

 
1   k  2  2k  3 

3
 k  1  2

 

Worked solutions
1  2k  3 

3
 k  1  k  2  
 2

 
1 3

3
 k  1  k  2  k  2 
 
=RHS

Since it was shown that P(1) is true and that P(k + 1) is true given P(k) is true for k 

it follows by the principle of mathematical induction that P(n) is true for all n 
n  n  1
P  n : 1  4  9  16  ...   1 n2   1
n 1 n 1
b
2
When n  1
LHS = 1
1 1  1
RHS=  1
11
1
2
Assume the statement P  k  is true for some k  
i.e.
k  k  1
1  4  9  16  ...   1 k 2    1
k 1 k 1
2
When n  k  1,
LHS = 1  4  9  16  ...   1 k 2   1  k  1
k 1 k 2 2
Use assumption
k  k  1
  1   1  k  1
k 1 k 2 2
2
k
  1  k  1  2   k  1
k 1
 
 k  2(k  1) 
  1  k  1 
k 1
2 
 
 k  2 
  1  k  1 
k 1

 2 
 k  1   k  1  1
  1
k 2
2
i.e. P  k   P  k  1
Since P 1 is true and P  k   P  k  1 for k  

then by the principle
of mathematical induction, the statement is true for all positive integers
n
c P  n : 2 i
 2n 1  1
i 0
When n  0
0
LHS  2
i 0
i
 20  1
RHS  20 1  1  2  1  1
LHS  RHS  P(1) is true
k
Assume that P  k  is true for some k  i.e. 2 i
 2k 1  1
i 0

Worked solutions
When n  k  1
k 1 k
2
i 0
i
 2
i 0
i
 
 2k 1  2k 1  1  2k 1  2k 1  2k 1  1  2  2k 1  1  2k 2  1
i.e. P  k   P  k  1
Since P 1 is true and P  k   P  k  1 for k  then by the principle

of mathematical induction, the statement is true for all natural numbers
d P  n : 9n  1 is divisible by 8 (for n  )
P(n) : 9n  1  8 A, for n  , A 
When n  0
LHS = 90  1  0 = 8  0
 P(1) is true
Assume P  k  to be true for some k 
i.e. 8 divides 9k  1  9k  1  8m for some m 
Then,
9k 1  1  9  9k  1  9  8m  1  1  9 8m  9  1
 8  9m  8  8  9m  1
so 8 also divides 9k 1  1
i.e. P  k   P  k  1
n2  n  1
2
e P  n : 1  2  3  ...  n 
3 3 3 3
LHS = 13  1
12 1  1
2
RHS  1
4
LHS =RHS
 P 1 is true
Assume P  k  is true for some k 
k 2  k  1
2
i.e. 13  23  33  ...  k 3 
4
Then,
k 2  k  1
2
13  23  ...  k 3   k  1    k  1
3 3
use assumption 4
 k  1  k 2  4k  4
2
 k  1
2

4
 k 2  4  k  1   4
 k  1   k  1  1
2 2
 k  1  k  2
2 2
 
4 4
i.e. P  k   P  k  1

of mathematical induction, the statement is true for all positive integers.
f P  n : n3  n =3A, for n  , A 

Worked solutions
When n  0:
10  1  0 = 3  0
 The statement P  0 is true
Assume P  k  is true for some k 
k 3  k  3m for some m 
 k 3  3m  k
When n  k  1,
 
LHS =  k  1   k  1  k 3  3k 2  3k  1   k  1
3
   
 3m  3 k 2  k  3 m  k 2  k , m  k 2  k 
i.e. P  k   P  k  1

1 1 1 1 n
g P  n :    ...   ,
12 2  3 3 4 n  n  1 n  1
When n  1:
1 1
LHS  
12 2
1 1
RHS= 
11 2
LHS=RHS  P 1 is true
Assume P  k  is true for some k  
1 1 1 k
i.e.   ...  
12 2 3 k  k  1 k  1
When n  k  1,
1 1 1 1
LHS    ...  
12 23 k  k  1  k  1  k  2 
use assumption
k 1 1  1 
   k  
k  1  k  1  k  2  k  1  k  2
1  k  k  2  1  1  k 2  2k  1 
     
k 1 k 2  k 1 k 2 
1   k  1  k  1
2
k 1
  
k  1  k  2  k  2  k  1  1
 
i.e. P  k   P  k  1

h P  n : n3  n = 6A for all n  
,A

Worked solutions
When n  1
13  1  0  0  6
k 3  k  6m for some m 
 k 3  k  6m
When n  k  1,
 k  1
3

  k  1  k 3  3k 2  3k  1   k  1 
2
 k  6m  3k  2k
 6m  3k  k  1
but k  k  1 must be an even number since any pair of consecutive
natural numbers contains an even number
 k  k  1  2r for some r  
  k  1   k  1  6  m  r  which is divisible by 6
3
i.e. P  k   P  k  1

i P  n : 2n2  32n1 =7A n   

,A 
When n  1
LHS=212  32 1  23  33  8  27  35  7  5
Assume that P  k  is true for some k  
2k 2  32k 1  7m for some m  
 2k 2  7m  32k 1
When n  k  1,
LHS =2
k 1  2
 3    2  2k 2  9  32k 1
2 k 1 1
 
 2 7m  32k 1  9  32k 1
2 k 1
 14m  2  3  9  32k 1
2 k 1
 14m  7  3
 
 7 2m  32k 1 where 2m  32k 1 
so P  k   P  k  1

n 2n  1 2n  1
P  n : 12  32  52  ...  2n  1 
2
j
3

Worked solutions
When n  1
LHS =12  1
1 2  1 3
RHS  1
3
LHS =RHS
k 2k  1 2k  1
i.e. 12  32  52  ...  2k  1 
2
3
When n  k  1
LHS =12  32  52  ...  2k  1  2k  1
2 2
use assumption
k 2k  1 2k  1
 2k  1
2

3
2k  1

3
 k 2k  1  3 2k  1 
2k  1

3

2k 2  5k  3 

2k  1 2k  3  k  1
3
 k  1 2  k  1  1 2  k  1  1

3
i.e. P  k   P  k  1

n
n
k P  n :  r  r  1  3  n  1  n  2
r 1
When n  1
1
LHS =  r  r  1  1 1  1  2
r 1
1
RHS = 1  1 1  2   2
3
Assume P  k  to be true for some k  
k
k
i.e.  r  r  1  3  k  1  k  2
r 1
When n  k + 1,
k 1 k
LHS = r  r  1   r  r  1   k  1  k  2
r 1 r 1
k
  k  1  k  2    k  1  k  2 
3
 k  1  k  2 k  3   k  1  k  1  1     k  1  2

3
  3
i.e. P  k   P  k  1


Worked solutions
n
1 n
l P  n :  r  r  1  n  1
r 1
When n  1
1
1 1 1
LHS =  r  r  1  1 1  1  2
r 1
1
RHS =
11
k
1 k
i.e.  r  r  1  k  1
r 1
When n  k  1
k 1
1 k
1 1
LHS =  r  r  1   r  r  1   k  1  k  2
r 1 r 1
k 1
 
k  1  k  1  k  2 
1  1 
 k  
k 1 k  2
1  k  k  2  1 
  
k  1  k 2 
1  k 2  2k  1 
  
k 1 k 2 
1   k  1  k  1
2
 
k 1 k  2  k  2
 
 P(k )  P(k  1)

3 a Best proved by direct argument:
 4n  3   4n  3
2 2
  4n  3  4n  3  4n  3  4n  3
  8n  6   48n  12(4n) so is always divisible by 12
(induction amongst other methods is also valid)
b False: substituting n  1 gives 75 which is not prime
c Best proved by induction:
P  n  : 13  33  ...  2n  1  n2 2n2  1

3
 
When n  1
LHS= 13  1

RHS=12 2  12  1  1 
LHS=RHS
 P 1 is true:

Worked solutions
i.e. 13  33  ...  2k  1  k 2 2k 2  1

3
 
When n  k  1
LHS =13  33  ...  2k  1  2k  1
3 3
Use assumption
k 2
2k 2

 1  2k  1
3
 2k 4  k 2  8k 3  12k 2  6k  1
 2k 4  8k 3  11k 2  6k  1 (use factor theorem to factorize or expand right hand side of P(k+1) to obtain same polynomial)

  k  1 2k  6k  5k  1
3 2


  k  1  k  1 2k  4k  1 2

  k  1 2k  1
2 2
  k  1 2  k  1  1
2 2
so P  k   P  k  1

d Best proved by induction:
P  n  : 1  2  2  3  3  4...   n  1  n 

n n2  1 
3
When n  1
LHS= 0  1  0
RHS=

1 12  1  0
3
LHS=RHS
i.e. 1  2  2  3  3  4...   k  1  k 

k k2  1 
3
When n  k  1
LHS= 1  2  2  3  3  4...   k  1  k  k  k  1
use assumption

k k 1 2
k

3
 k  1
k  k  1 (k  1)  3k  k  1

3
(k  1)(k  k  1  3k )

3


(k  1) (k  1)2  1 
3
so P  k   P  k  1

e Best proved by direct argument:

Worked solutions
 
n3  n  n n2  1   n  1 n  n  1
this is the product of three consecutive positive integers
(in the case n  1, 0 is divisible by 3 so done)
Three consecutive positive integers always include
a multiple of 3, so the product is always divisible by 3
Exercise 1H
1 8! 6! 6!56  1  39600
9! 8! 8!9  1  403200
7! 6! 6!7  1  4320
6! 5! 5!6  1  840
 n  1 ! n! n! n  1  1  n  n!
n !  n  1 !  n  1 ! n  1   n  1  n  1 !
n !  n  1 !  n  1 ! n  1   n  1  n  1!
 n  1 ! n! n! n  1  1   n  2 n!
8! 8  7  6!
2 a   14
4  6! 4  6!
4!  5!  4 3! 5! 4 2
b   
3!  6! 3! 6  5! 6 3
c
10! 8!  10! 8 7 6! 
56
11! 6! 11 10! 6! 11
3 a
 n  1 !   n  1 ! 
n 1
n!   n  1 ! n!1   n  1  n
n ! +  n  1 ! n ! 1  n  1
b   n2
n! n!
 n!  n!  1  n !  1
2
1
c   1  n!
n!  1 n!  1
2n  2 ! n!  (2n  2)(2n  1)  2(2n  1)

2
4
 n  1 ! 2n !
2
(n  1)2 n 1
n n!
5 C2   66
 n  2 !2!

Worked solutions
n!
  n  n  1  132
 n  2 !
 n2  n  132  0
  n  12   n  11  0
n  0 so n  12
6 16  n  1 !  5n!  n  1 !
 16  5n   n  1 n
 n2  6n  16  0
  n  8  n  2  0
n2  n  0
7 a 13!
b 4! 4! 3! 2! 4!  165888
8 26  25  24  10  9  1404000
23
9 a C5  33649
b Number of ways of choosing all boys = 13 C5
10
Number of ways of choosing all girls C5
Number of ways of choosing at least one boy and at least one girl
= 23
C5   13

C5 10 C5  32110
10 a 6  73  2058
b 6  6  5  4  720
c Last digit must be 0, 4 or 8
6  7  7  3  882
d Last digit must be 0
6  7  7  1  290
11 6 C4  15
12 There are 5C3 ways to choose the drivers.
Then, there are 9 ways to choose passenger for small car.

This leaves 8 persons to choose 4 passenghers for second car and the rest
go in the third car.
  5

C3  3!  9 8 C4 4 C4  37800

Worked solutions
Exercise 1I
 x  11 10  x  11 10 9   x   ...

11 2 3
 x
1 a 1    1  11         
 3  3 2!  3 3!  3
11x 55x 2 55x 3

1    ...
3 9 9
 x  7   6   x  7 6  5  x   ...

7 2 3
 x
b 1    1  7        
 2 2 2!  2  3! 2
2 3
7x 21x 35x
1    ...
2 4 8
8 8
 2 8  2 
c  x    x 1  2 
 x  x 
  2   8  7   2  8 7 6   2 3  ...

2
 x 8 1  8  2       2
 x  2!  x 2  3! x  
8 6 4 2
 x  16 x  112x  448x  ...
C4  a  2b
10 4 6
2 a  3360a4b6
2
9  4 
b 11
C2  a  2   880a5
a 
3
5  2y 
c 8
C3  x    2 3
  448x y
 x 
3 General term is given by

r
 2 
Cr  x 
12 12  r 0
  2   Nx
 x 
Comparing powers of x
12  r  2r  0
r 4
4
8  2 
12 C8  x    2   7920
 x 
4 4
 x  x 
4  2    16 1  
 5   10 
  x  4  x  4
2 3
 x  4  x  
4
 16  4 C0  4 C1     C2     C3     C4    
  10   10   10   10  

 2 x 3x 2 x3 x4 
 16 1     
 5 50 250 10000 
32x 24x 2 8x 3 x4
 16    
5 25 125 625
4
 0.05 
 1.99    2 
4

 5 
32  0.05 24 0.05 8 0.05 2 0.05 
2 3 4
16    
5 25 125 125
 15.68239 to 5d.p.

Worked solutions
5 General term is given by

r
 1
 
6r
6
Cr x 2     Nx
6
 x
Comparing powers of x
12  2r  r  6
r 2
2
 1
 
4
6
C2 x 2     15x
6
 x
5 2 3 4 5
 y 5 4 y  3 y  2 y  y y
6 a  x    x  5x    10x    10x    5x     
 x  x
  x
  x
  x
  x
10y 3 5y 4 y 5
 x5  5x 3y  10xy 2   3  5
x x x
 10y 3 5y 4 y 5 
b 2x  y   x5  5x 3y  10xy 2  x
 3  5
x x 

Term in x 3y 2 is
 
y 5x 3y  5x 3y 2 so 5
7 a n 1
C4 
 n  1 !
4!  n  3 !
8  n! 4  n!
b 23 n C3  
 n  3  !3! 3   n  3 !
c
 n  1 ! 
4  n!
4!  n  3 ! 3   n  3 !
4  4!
 n 1   32
3
 n  31
 
5
8 a 3 2
 3  3    2   10  3    2   3   2 
5 4 3 2 2 3
 5  10
 5  3   2     2 
4 5
 9 3  45 2  60 3  60 2  20 3  4 2
 89 3  109 2
4 4
 1   5
b  2    2  
 5   5 
2 3 4
 5  5  5  5
 2  2  2  
4 3 2
 4    6    4 2  
 5   5 
 5   5     
8 10 12 4 10 1
 4   
5 5 25 25
161 44
  10
25 25
1  5   1  5 
7 7
c

Worked solutions

 5  5    5  
3 5 7
 2  7 5  35  21


 2 7 5  175 5  525 5  125 5 
 1664 5
C0  2 n C1  4 n C2  8 n C3  ...   1 2r n Cr  ...   1 2n n Cn

n r n
9 a
 1  2   1
n n
C0 n C1 n C3  ...   1 n Cr  ...   1 n Cn  1  1  0

n r n n
b
Exercise 1J
1
 1  x   1   1 x 
 1  2 x 2   1  2  3 x 3  ...
   
1
1 a
1 x 2! 3!
 1  x  x2  x3  ...
1
 1  2x 
2
b
1  2x 
2
 1   2  2x  
 2  3  2  3  4
 2x   2x 
2 3
  ...
2! 3!
 1  4x  12x 2  32x 3  ...
c Using the answer to part a and substituting 2x for x,
2
1  2x

 2 1  2x   2 1  2x  4x 2  8x 3  ...
1

 2  4x  8x 2  16 x 3  ....
2
 2 1  x 
3
d
1  x 
3

2 1   3   x  
 3  4  x 2   3  4  5  x 3  ...
2!
  3!
  
 
2 3
 2  6 x  12x  20x  ...
1  2x  1  2x  2
1
2 a
1 1 1 1 3

1 2 2 2 2 2
 1  2 x       2x        2x 3  ...
  
2
2 2 3!
1 1
 1  x  x 2  x 3  ...
2 2
31 31 1
3 22 22 2
    x      x 3  ...
1  x 
3
2
b 2
1 x 
2 2! 3!
3 x 3x 2 x 3
1    ...
2 8 16

Worked solutions
1  3x 
 12
c
 1 3  1 3 5

 1  2 2  2 2 2
 1      3x      3x 2 
      3x 3  ...
 
 2  2 3!
3x 27x 2 135 3
1   x  ...
2 8 16
2 1  x  3
1
 1 2 1 2 5 

 1 3 3 3 3 3 
 2 1  x      x2       x 3  ...
 3 2 3! 
 
 
 1 1 2 5 3 
 2 1  x  x  x  ...
 3 9 81 
2 x 2 x 2 10 x 3
2    ...
3 9 81
1 x 1 1
 1  x 2 1  x  2

3
1 x
 1 1 1 1 3   1 3  1 3 5 


1 2 2 2 2 2   2 2  2 2 2 
 1  x      x2       x 3  .. 1  1 x     x2      x 3  ..
 2 2 3!  2 2 3! 
  
  
 x x2 x3  x 3x 2 5x 3 
 1     ... 1     ...
 2 8 16  2 8 16 
x2 x3
1 x    ...
2 2
x
 x 1  x 
2
4
1  x 
2

 x 1   2 x 
 2  3 x 2   2  3  4 x 3  ...

 2! 3! 
 x 1  2x  3x 2  4x 3  ...
 x  2x 2  3x 3  4x 4  ...
3
1 3 
 2  3x 
3
5  1  x 
8 2 
1  3x   3  4   3x   3  4  5   3x 3  ...

2
 1   3          
8   2  2!  2  3!  2  

1 9 x 27x 2 135x 3 
 1     ...
8 2 2 4 
1 9x 27x 2 135x 3
     ...
8 16 16 32
1  4x  1  4x  2
1
6 a

Worked solutions
1 1 1 1 3

1 2 2 2 2 2
 1   4x       4x 2 
      4x 3  ...
 
2 2! 3!
 1  2x  2x 2  4x 3  ...
 1   96  4 2 6
b 1  4      6 
 100   100  10 5
5  1 
c 6  1  4 
2  100 
2 3
5  1   1   1 
 (1  2    2   4   ...)
2  100   100   100 
 2.44949
1
 1  2x 
 12
7 a
1  2x
 1 3  1 3 5

 1  2 2    
 1      2x      2x   2   2   2  2x 3 ....
   
2
 2 2! 3!
3x 2 5x 3
1 x    ...
2 2
(2  3x)3  3x 2 5x 3 
b  (2  3x)3 1  x    ...
1  2x  2 2 
Expanding
 2  2 2 3 


 3  2   3 x   3 2  3 x   3 x  1  x 
3 3x 2 5x 3
2

2

 ...

 8  8 x  12x 2  20x 3  ...
+36x  36 x 2  54 x 3  ...
+54x 2  54 x 3  ...
 27 x 3  ....
 8  44x  102x 2  155x 3  ...

Worked solutions
Chapter review
9
1 u2  u1r  9  u1 
r

S3  u1 1  r  r 2  91 
9

r

1  r  r 2  91 
 9  9r  9r 2  91r
 9r 2  82r  9  0
  9r  1  r  9   0
1
r  or r  9
9
Therefore there are two geometric sequences:
1 1
r   u4 
9 9
r  9 :  u4  243
2 u1  1
1  2  3  4  5  7  8  9  11  13  15  16  17  ...  64
 1  3  5  7  ...  63  2  4  8  16  ...  64 
arithmetic series Finite geometric series,u=2, r=2, n=6
sum of first 32 odd numbers
32 2(26  1)

2
1  63 
2 1
 1024  126
 1150
3 b  a  d, c  a  2d  a  d  12  a  12  d
c a a  2d a
  
b c ad a  2d
 (a  2d )2  a(a  d )
Substituting for a
 12  d  2d   12 12  d 
2
 12  d   144  12d

2
 144  24d  d 2  144  12d  0

 d 2  36d  d  d  36   0
d  0, d  36
a  48
b  48  36  12
c  48  72  24
1 1 1 1
4 a   
1 x  2  1  x 3  2x
3 1  x 
 3 
3  2x  1  x  x 2 x 2
  
1  x  3  2x  3  2 x  3x  2 x 2 2 x 2  5x  3
1
x 2 1 2 
 1  x   1  x 
1
b 2
2 x  5x  3 3 3 

Worked solutions
1 2 4 2 8 3 

 1  x  x 2  x 3  ...   1  x  x 
3 3 9 27
x  ...

2 7 23 2 73 3
  x x  x  ...
3 9 27 81
n! 1
5 a n
C2  n   n  n  n  1  n
 n  2 !2! 2
1 1 1  n  1 !
 n  n  1  2   n  n  1 
2 2 2  n  1 !

 n  1 ! n 1 C2
2!  n  1 !
b n
C2 n 2 Ck 2 
n!

 n  2 !
2!  n  2 !  n  k  !  k  2 !
n! n! 1
  
2!  n  k  !  k  2  !  n  k  ! 2!  k  2  !
n!k ! 1
 
n  k !k ! 2!  k  2  !
n! k!
 
n  k !k ! 2!  k  2  !
n Ck k C2
1  x 
n
6 n C0 n C1x n C2 x2  ... n Cr x r  ... n Cn x n
n C0  n C1  3  n C2  32  ...  n Cr  3r  ...  n Cn  3n
 
n
 1  3  4n  22
n
 22n
1
7 Suppose there exist integers a and b such that 14a  7b  1. Then, 2a  b  .
7
But the left-hand side is an integer whereas the right-hand side is not.
This is a contradiction. Therefore there are no such integers.
13  7
8 Suppose x  3 and 5x  7  13. Then, x   4. But x  3, so this is a contradiction
5
9 a Take, for example, a  0 and b  1
b Take, for example, n  5 : 35  2  245  5  49 which is not prime
c Take, for example, n  1: 2 1  1  1  1 which is rational
d Take, for example, n  1 : 21  1  1 and 1is not prime
10 P  n : 1  1!  22  2!  33  3!  ...   nn  n!   n!

n 1
When n  1
LHS= 1  1!  1
RHS= 1!
11
 12  1
LHS=RHS

Worked solutions

i.e. 1  1!  22  2!  ... k k  k !   k !    k 1
When n  k  1
LHS= 1  1!  22  2!  ... k k  k !        k  1 k 1

  k  1 !
use assumption
  k !   k  1 !  k  1
k 1 k 1
Regrouping
  k  1 k !  k  1 !
k 1

   k  1 !  k  1 !
k 1
   k  1 !
k 2
so P  k   P  k  1
Therefore, it has been shown that P 1 is true and that if P  k  is true
for some k  
then so is P  k  1 . Therefore, the statement is true
for all positive integers by the principle of mathematical induction
11 P  n : n3  2n = 3A, A 
When n  1
13  2 1  3
The statement P 1 is true
k 3  2k  3m for some m  
3
 k  3m  2k
When n  k  1
LHS=  k  1  2  k  1
3
 k 3  3k 2  3k  1  2k  2
 3m  2k  3k 2  5k  3

 3 m  k2  k  1 
 P  k   P  k  1
for some k  
for all positive integers by the principle of mathematical induction.
n n  n  1
12 a P  n : r 
r 1 2
When n  1
1
LHS= r
r 1
1
1 1  1
RHS=  1
2
P 1 is true
k k  k  1
i.e. r
r 1

2

Worked solutions
When n  k  1,
k 1 k k  k  1  k  1
 r   r   k  1 
r 1 r 1 2

1

 k  1  k  2
2
so P  k   P  k  1
for some k  
n n  n  1 2n  1
b P  n : r 2

r 1 6
When n  1
1
LHS= r r 1
2
1
1 1  1 2  1
RHS=  1
6
P 1 is true
k k  k  1 2k  1
i.e. r
r 1
2

6
When n  k  1,
k 1 k k  k  1 2k  1
r r   k  1    k  1
2 2 2 2

r 1 r 1 6
 k  1 k k 1

6 
2k  1  6  k  1  6

2k 2  7k  6 
k 1

6
2k  3  k  2
 k  1  k  2 2  k  1  1

6
so P  k   P  k  1
for some k  
n2  n  1
2
n
c P  n :  r  3
r 1 4
When n  1
1
LHS= r r 1
3
1
12 1  1
2
RHS=  1
4
P 1 is true
k 2  k  1
2
k
i.e.  r3 
r 1 4

Worked solutions
When n  k  1,
k 1 k
r r   k  1
3 3 3

r 1 r 1
 k  1
2 2
k
  k  1
3

4
 k  1
2
 k 2  4  k  1 
4
 k  1  k 2  4k  4
2

4
 k  1  k  2
2 2

4
so P  k   P  k  1
for some k  
n n
  r  r  1  r  2 
r 1
 r
r 1
3
 3r 2  2r 
n n n
 r
r 1
3
 3 r 2  2 r
r 1 r 1
n  n  1 n  n  1 2n  1
2 2
   n  n  1
4 2
n  n  1
 n  n  1  2 2n  1  4
4
n  n  1 2
 n  5n  6 
4
n  n  1  n  2   n  3

4
13 a ‘harmonics’ consists of 9 different letters, so there are 9! arrangements.
b 5 digit numbers:
4 ways of choosing first digit (bigger than 3)
Each of the next three digits can be chosen in 7 ways
The last digit can be 0 or 5
These numbers include 30000 which is not wanted
In all there are 4  73  2  1 five digit numbers
6 digit numbers
6 ways of choosing first digit
7 ways of choosing each of the next four digits
2 ways of choosing last digit Divisible by 5  final digit is 0 or 5
In all there are 4  74  2 six digit numbers
7 digit numbers
6 ways of choosing first digit

Worked solutions
7 ways of choosing each of the next five digits
2 ways of choosing last digit
In all there are 4  75  2 six digit numbers

Answer = 4  73  2  1  4  74  2  4  75  2     
 1371  19208  134456
 155035
c The only possibilities would be to have 3 women and 2 men or 4 women and 1 man
4
C3 7 C2 4 C4 7 C1  4  21  1  7  91
14 a a2  b2   a  b  a  b  2x  2y   4xy
a3   x  y   x3  3x2y  3xy 2  y 3
3
b
b3   x  y   x3  3x2y  3xy 2  y 3
3
c 
 a3  b3  x3  3x2y  3xy 2  y 3  x3  3x2y  3xy 2  y 3   

 2 3x 2y  y 3 

 2y  3x  y 2 2


  a  b  3x  y 2 2

But,
a2  ab  b2  3x 2  y 2
So,
a3  b3   a  b  a2  ab  b2  
a4   x  y   x 4  4x3y  6x2y 2  4xy 3  y 4
4
d
b4   x  y   x 4  4x 3y  6 x 2y 2  4xy 3  y 4
4

 a4  b4  x 4  4x 3y  6 x 2y 2  4xy 3  y 4  x 4  4x 3y  6 x 2y 2  4xy 3  y 4   
3 3
 8x y  8xy

 2y  4 x 3  4 xy 2 

  a  b  a3  a2b  ab2  b3 
e 
Conjecture: an  bn   a  b an1  an2b  an3b2  ...  abn2  bn1 
f 
P  n : an  bn   a  b an1  an2b  an3b2  ...  abn2  bn1 
When n=2
LHS=a2  b2
RHS   a  b   a  b   a2  ab  ab  b2  LHS
P(2) is true

i.e. ak  bk   a  b  ak 1  ak 2b  ak 3b2  ...  abk 1 
 a   a  b a
k
 k 1
a k 2
ba k 3 2
b  ...  ab k 1
b k

Worked solutions
When n  k  1
ak 1  bk 1  a ak  bk 1  
 a  a  b  a
  k 1
 ak 2b  ak 3b2  ...  abk 1  bk   bk 1
 
 a  a  b a a ba k 1 k 2 k 3 2
b  ...  ab   ab  bk 1 k k 1
 a  a  b  a  a b  a
k 1 k 2 k 3
b  ...  ab   b  a  b 
2 k 1 k
  a  b a  a  a b  a k 1 k 2 k 3
b  ...  ab   b 
2 k 1 k
 
  a  b  a  a b  a b
k k 1 k 2 2
 ...  ab  b  k 1 k
so P  k   P  k  1
Therefore, it has been shown that P2 is true and that if P  k  is true
for some k  
, k  2 then P  k  1 is also true. Therefore, the statement is true
for all positive integers greater than 2, by the principle of mathematical induction
15 The difference between the coefficients must be the same
n Cr n Cr 1 n Cr 1 n Cr
n! n! n! n!
   
r !  n  r  !  r  1 !  n  r  1 !  r  1 !  n  r  1 ! r !  n  r  !
Multiplying by
 r  1 ! n  r  1 ! ,
n!
 r  1  n  r  1   r  1  r    n  r  1  n  r    r  1  n  r  1
 2  r  1  n  r  1  r  r  1   n  r  1  n  r   0
  n  r  1 3r  2  n   r 2  r  0
which after expanding and simplyfing gives
n2  4r 2  2  n  4r  1  0
2  x  7x 2 A B C
16   
1  2x  1  x  1  2x 1  x 1  x
2
 2  x  7 x 2  A 1  x  1  x   B 1  2 x  1  x   C 1  2x  1  x 
Set x  1 :  4  2C  C  2
Set x  1 :  6  6B  B  1
Compare constants : 2  A  B  C  A  2  B  C  1
2  x  7x 2 1 1 2
   
1  2x  1  x  2
1  2x 1  x 1  x
 1  2 x   1  x   2 1  x 
1 1 1
  
 1  2x  4x 2  8x 3  ...  1  x  x 2  x 3  ...  2 1  x  x 2  x 3  ...   
2 3
 2  5x  5x  11x  ...
Exam-style questions
17 Require ( 3  coefficient of term in x 5 )  1  coefficient of term in x 4  

8 8
3    43  2x   1    44  2x 
5 4
(3 marks)
5  4
 3   114688  1  286720

Worked solutions
 57344 (1 mark)
 n
 
18   1n 2 3x   495x 2
2
(2 marks)
2
9n  n  1
 495
2
n  n  1  110
n2  n  110  0 (1 mark)
 n  11  n  10  0 (2 marks)
So n  11 or n  10 (1 mark)
19 First part is geometric sum, a  1 , r  1.6 , n  16 (1 mark)

Second part is arithmetic sum, a  0 , d  12 , n  16 (1 mark)
Third part is 16  1  16 (1 mark)
1.616  1
Geometric sum: S16   3072.791 (1 mark)
1.6  1
16
Arithmetic sum: S16 
2
 
2  0  15   12  1440 (1 mark)
n 15
So  1.6
n 0
n
 12n  1 
 3072.791  1440  16
 1648.8 (1 mark)
 n  1  n  1 
20   
 k   k  1

 n  1 !   n  1 ! (3 marks)
k !  n  k  1 !  k  1 !  n  k  !

 n  k   n  1 ! k  n  1 ! (1 mark)
k ! n  k  !
n  n  1 ! k  n  1 ! k  n  1 !
 (1 mark)
k ! n  k  !
n  n  1 !
 (1 mark)
k ! n  k  !
 n! 
 
 k ! n  k  ! 
 
 n
 
k 

Worked solutions
21 Consider multiples of 7:
504 is the first multiple and 1400 is the final multiple
1400  504  7  n  1 (1 mark)
 n  129 (1 mark)
129
So the sum of the multiples of 7 is S129 
2
 
2  504  7  129  1  122 808 (2 marks)
Sum of the integers from 500 to 1400 (inclusive) is

901
S901 
2
 
2  500  1  901  1  855 950 (2 marks)
Therefore require 855 950  122 808  733 142 (1 mark)
22 Suppose n3  3 is odd. Assume, for a contradiction, that n is also odd. (1 mark)
Then we can write n  2p  1 for p  

and n3  3  2q  1 for q  
. (1 mark)
So n3  3  2q  1
2p  1
3
 3  2q  1 (1 mark)
8p3  6p2  6p  1  3  2q  1 (1 mark)
8p3  6p2  6p  3  2q
3
So q  4p3  3p2  3p  (1 mark)
2
Since p is an integer, 4p3  3p2  3p is also an integer.
3 3
Since is a non-integer, then 4p3  3p2  3p  is also a non-integer. (1 mark)
2 2
This is a contradiction, since q was assumed to be an integer. (1 mark)
Therefore, the initial assumption is false, and n must be even.
23 Case n  1 :
5    1  5  1  6  1 6
2 1 1
(1 mark)
Therefore true for n  1
Case n  k :
Assume the statement is true for some k  , k 0 (1 mark)
Then 52k 1  1  6s for some positive integer s
Now 5    1
2 k 1 1
(1 mark)
 52k 21  1
 52  52k 1  1 (1 mark)
 52  6s  1  1 (1 mark)

Worked solutions
 25 6s  1  1
 25  6s  24 (1 mark)
 6 25s  4
Which is a multiple of 6 (1 mark)
So the statement is true for n  1 , and when assumed true for n  k ,
is true for n  k  1 .
Therefore the statement is true for all n  . (1 mark)
1
24 a 3
1  x   1  x 3 (1 mark)
      x           x 
2 3
1 2 1 2 5
x 3 3 3 3 3
1    (2 marks)
3 2! 3!
x x 2 5x 3
1   (1 mark)
3 9 81
1
b When x  , (1 mark)
64
3
 1  63 63
3
1  x   3 1 
64
  3
64

4
(1 mark)
 
1
Therefore, when x  , then
64
3  x x 2 5x 3 
63  4 1     (1 mark)
 3 9 81 
 1   5  64  
2 3
1 1
 4 1  64  64
 (1 mark)
 3 9 81 
 
4 4 20
 4  
192 36 864 21 233 664
 3.979057 (1 mark)
25 a 9!  362 880 (1 mark)

b 2  8!  80 640 (2 marks)
c 9!  2  8!  282 240 (2 marks)
d We require:
(no. of ways in total)  (no. of ways with one woman separating men)
 (no. ways with men together) (1 mark)
 9! 2  7  7! 2  8! (1 mark)
 211680 (1 mark)

Worked solutions
2 Representing relationships: functions
Skills check
1 a
2 a
The graphs intersect at (-1.73,0) and (1.73,0), each to 3sf.
The graphs intersect at (-1,1), (-1.82,0.589) to 3sf, and (0.823,1.91) to 3 sf.

Worked solutions
3 a y  x 2  2x  3
 (x 2  2x  1)  3  1
 (x  1)2  2
b y  x2  6x  1
 (x 2  6 x  9)  1  9
 (x  3)2  10
c y  3x 2  6 x  1
 3(x 2  2x  1)  1  3
 3(x  1)2  2
Exercise 2A
1 a Yes
Df  1,2,3, 4
Rf  0,2,3, 4
b Yes
Df  2, 1,0,1
Rf  1
c No, this is not a function because it is not well-defined: 2 is mapped
to multiple values
d No, this is not a function because it is not well-defined:  is mapped to
both  and  
e Yes
Df  1,2,3, 4,5
Rf  2, 4,10
f No, this is not a function because it is not well-defined:  5 is mapped to
both 0 and 1
g No, this is not a function, since it is does not act on the entire domain:
5 has no image
h No, this is not a function, because it is not well-defined: 2 is mapped
to both 8 and 15
2 a No, because the graph does not pass the vertical line test
b Yes
Df 
Rf  2

Worked solutions
c No, because the graph does not pass the vertical line test
d Yes
Df  x  | 1  x  6
Rf  y  | 1  y  7
e Yes
Df  4, 3, 2, 1,1,2,3, 4

Rf  3, 2, 1,0,1,2, 4
f Yes
Df  x  | 4  x  3
Rf  y  | 2  y  1
g Yes
Df  Rf 
Exercise 2B
y  x2  6x  8   x  3  8  9   x  3  1
2 2
1 a i
So the axis of symmetry is x  3
ii  3, 1
iii Concavity: up, Df  , Rf  y  | y  1
 3
2
9  49  3
2
b i  
y  10  3x  x 2   x 2  3x  10     x     10  
 2 4 
 x  
4  2
 
3
So the axis of symmetry is x 
2
 3 49 
ii  , 
2 4 
 49 
iii Concave down, Df  , Rf  y  |y  
 4 
 5  17 
y  3  x 2  4x    3   x  2     3  x  2  17
2 2
c i
 3  3 
So the axis of symmetry is x  2
ii 2, 17
iii Concave up, Df  , Rf  y  | y  17
 7  9
y  2  x 2  2x    2   x  1    9  2  x  1
2 2
d i
 2  2

Worked solutions
So the axis of symmetry is x  1
ii  1,9
iii Concave down, Df  , Rf  y  | y  9
2 a Vertex is (2,−16)  y  a  x  2  16
2
12  a 0  2  16  a  1
2
 y   x  2  16
2
b x  intercepts are x  3, x  1 so the quadratic must be of the form

y  C  x  3  x  1  C x 2  2x  3 
At x  0, 3  3C so C  1
 y  3  2x  x 2
c x  intercepts are x  1, x  5 so the quadratic must be of the form

y  C  x  1  x  5  C x 2  6 x  5 
At x  4,  12  C  3  C  4
 
 y  4 x 2  6 x  5  4x 2  24x  20
d Vertex is (2,−6)  y  a  x  2  6
2
6  a  4  2  6  a  3
2
y  3  x  2  6
2
e x  intercepts are x  5, x  2 so the quadratic must be of the form

y  C  x  5  x  2   C x 2  3x  10 
1
At x  1, 3  C  6   C  
2
1 2 3 1
y  
2

x  3x  10  5  x  x 2
2 2

Vertex is (−10,60)  y  a  x  10  60

2
f
3
45  a  5  10  60  a  
2
5
3
 x  10  60
2
y 
5
Exercise 2C
1 4  2x  0 therefore x  2 and Df  x  | x  2
3 4y  3
y   4y  2xy  3  x 
4  2x 2y
 y  0 and Rf  y  | y  0

Worked solutions
Asymptotes: x  2 and y  0
1  1
2 3  6x  0  x  so Df   x  |x  
2  2
1 1  3y
y   6 xy  3y  1  x 
6x  3 6y
 y  0 and Rf  y  | y  0
1
Asymptotes: x  and y  0
2
1  1
3 2  4x  0  x  so Df   x  |x  
2  2
x 2y
y   2y  4xy  x  x 
2  4x 1  4y
1  1
y   and Rf  y  | y   
4  4
1 1
Asymptotes: x  and y  
2 4
4 1  x  0  x  1 so Df  x  | x  1
1 x y 1
y   y  yx  1  x  x 
1 x y 1
 y  1 and Rf  y  | y  1
Asymptotes: x  1 and y  1
1  1
5 1  2x  0  x   so Df   x  |x   
2  2
1  2x 1y
y   y  2xy  1  2 x  x 
1  2x 2 1  y 
 y  1 and Rf  y  | y  1
1
Asymptotes: x   and y  1
2
2
6 2  3x  0  x 
3
2x  3 3  2x 2y  3
y    2y  3xy  3  2x  x 
2  3x 2  3x 3y  2
2  2
y  and Rf  y  | y  
3  3
2 2
Asymptotes: x  and y 
3 3
Exercise 2D
1 a y  x 2
x  2  0 so Df  x  | x  2
y  0 so Rf  y  | y  0

Worked solutions
b y  3x  2
2  2
3x  2  0  x  and Df   x  |x  
3  3
y  0  Rf  y  | y  0
c y  1  2  4x
1  1
2  4x  0  x  and Df   x  |x  
2  2
y  1 so Rf  y  | y  1
d y  3  2x  1
1  1
2x  1  0  x   and Df   x  |x   
2  2
y  3 so Rf  y  | y  3
e y  2 x  1
x  1  0  x  1 and Df  x  | x  1
y  0 so Rf  y  | y  0
f y 13 2 x
2  x  0  x  2 and Df  x  | x  2
y  1  Rf  y  | y  1
Exercise 2E
4 4
1 y  
2
x  3x x  x  3
x  x  3  0  x  0 and x  3
 Df  x  | x  0, x  3
Rf  y  | y  0
Asymptotes: x  0, x  3, y  0
1 1
2 y  
x 2  9  x  3  x  3
 x  3  x  3  0  x  3
 Df  x  | x  3
 1
Rf  y  | y  0 or y   
 9
1 1
3 y  
x 2  2x  3  x  3   x  1

Worked solutions
 x  3  x  1  0  x  1, x  3
 Df  x  | x  1, x  3
 1
Rf  y  | y  0 or y  
 4
Asymptotes: x  3, x  1, y  0
2
4 y 
 x  2
2
 x  2
2
 0  x  2
 Df  x  | x  2
Rf  y  | y  0
Asymptotes: x  2, y  0
1 1
5 y  
2x 2  9x  18  2 x  3  x  6 
 3 
 Df   x  | x  , x  6 
 2 
 8 
Rf  y  | y  0 or y  
 225 
3
Asymptotes: x  6, x  , y  0
2
6 Df  x  | x  2
Rf  y  | y  0
Asymptotes: x  2, y  0
1 1
7 y  
 x  1
2
2  x  1  2  x  1  2 
 Df  x   | x  1  2 or x  2  1 
Rf  y  | y  0
Asymptotes: x  1  2, x  2  1, y  0
2 2
8 y  
2
4x  25  2 x  5  2 x  5
 5 5
 Df   x  | x   or x  
 2 2
Rf  y  | y  0
5 5
Asymptotes: x   , x  , y 0
2 2

Worked solutions
Exercise 2F
1 1 A B
1   
x 2  5x  6  x  3  x  2 x  3 x  2
 1  A  x  2   B  x  3
Set x  2 : 1  B  B  1
Set x  3 : 1   A  A  1
1 1 1
  
x 2  5x  6 x  2 x  3
4x 4x A B
2   
x  x  2  x  2  x  1 x  2 x  1
2
 4  x  A  x  1  B  x  2 
Set x  1 : 3  3B  B  1
Set x  2 : 6  3 A  A  2
4x 1 2
 2
 
x  x 2 x 1 x  2
4x  9 4x  9 A B
3   
x 2  3x x  x  3 x x  3
 4 x  9  A  x  3  Bx
Set x  0 :  9  3 A  A  3
Set x  3 : 3  3B  B  1
4x  9 3 1
  
x 2  3x x x 3
x x A B
4   
x 2  1  x  1  x  1 x  1 x  1
 x  A  x  1  B  x  1
1
Set x  1 : 1  2B  B 
2
1
Set x  1 :  1  2 A  A 
2
x 1 1 1 
 2
   
x  1 2  x  1 x  1
5 5 5 A B
5  2   
2
x  x  6 x  x 6  x  3  x  2  x  3 x  2
 5  A  x  2   B  x  3
Set x  2 :  5  5B  B  1
Set x  3 :  5  5 A  A  1
5 1 1
 2
 
x  x  6 x  3 x  2
10x  1 10x  1 A B
6   
8x 2  2x  1  4x  1 2x  1 4x  1 2x  1

Worked solutions
 10 x  1  A 2 x  1  B  4 x  1
1
Set x   :  6  3B  B  2
2
1 3 3
Set x  :  A A 1
4 2 2
10 x  1 1 2
  
8x 2  2x  1 4x  1 2x  1
11  3x 11  3x A B
7   
6 x 2  5x  6  3 x  2   2 x  3  3 x  2 2 x  3
 11  3x  A 2 x  3  B 3x  2 
2 13
Set x  : 13  A A3
3 3
3 13 13
Set x   :  B  B  1
2 2 2
11  3x 3 1
  
6 x 2  5x  6 3x  2 2 x  3
Exercise 2G
1 Df  , Rf  y  | y  3
2 Df  , Rf  y  | y  1
3 Df  , Rf  y  | y  4
4 Df  , Rf  y  | y  1

Worked solutions
5 Df  , Rf  y  | y  1
6 Df  , Rf  y  | y  2
7 Df  , Rf  y  | y  2
8 Df  , Rf  y  | y  2
9 Df  , Rf  y  | y  0
10 Df  , Rf  y  | y  2

Worked solutions
Exercise 2H
1 a 10  3x  2  7  3x  2  3
 3x  2  3 or 3x  2  3
1
3x  2  3  x 
3
5
3x  2  3  x  
3
Substituting into the equation shows these are both valid
b 8 x 7 3  5  x 7 1
 x  7  1 or x  7  1
x  7  1  x  6
x  7  1  x  8
Substituting into the equation show these are both valid
c x  2  2x  1
 x  2  2x  1 or x  2   2x  1
1
 x  3 or x 
3
1
Substituting these into the equation  x  only
3
d 4x  3  3  x
 4x  3  3  x or 4x  3  x  3
4x  3  3  x  x  0
4x  3  x  3  x  2
Substituting these shows these are both valid
e 4x  9  2x  1
 4x  9  2x  1 or 4x  9  1  2 x
4x  9  2x  1  x  5
4
4x  9  1  2x  x  
3
f 5x  3  2x  1  0  5x  3  2x  1

Worked solutions
 5x  3  2x  1 or 5x  3  1  2 x
4
5x  3  2 x  1  x  
3
2
5x  3  1  2 x  x  
7
2x  5 3x  4
g   2 2 x  5  3 3x  4
3 2
 2 2x  5  3 3x  4  or 2 2 x  5   3 3x  4 

22
2 2 x  5  3 3x  4   x  
5
2
2 2x  5  3 3x  4   x  
13
Exercise 2I
3
1 a For x   ,
2
3
2x  3  6  2x  3  6  x 
2
3 9
For x  , 2 x  3  6   2 x  3   6  x  
2 2
9 3
  x 
2 2
3
b For x  ,
2
2x  3  5  2x  3  5  x  4
3
For x  ,
2
2 x  3  5  3  2 x  5  x  1
 x  1 or x  4
2
c For x  ,
3
3  2 x  5  3  2 x  5  x  1
3
For x  ,
2
3  2x  5  2x  3  5  x  4
 1  x  4
d 1  3x  5
1 4
For x  , 1  3x  5  x  
3 3
1
For x  , 3x  1  5  x  2
3
4
 x   or x  2
3
e 2x  3  x  3

Worked solutions
2x  3  x  3 or  2 x  3  x  3
2x  3  x  3  x  0
 2 x  3  x  3  x  2
Checking points in these regions shows they are both valid
 x  2 or x  0
f x  6  3x  2
 x  6  3x  2 or x  6   3x  2 
x  6  3x  2  x  2
x  6   3x  2   x  2
 2  x  2
g 2 x 2  x 5  4
For x  5,
2  x  2    x  5  4  x  3
For  5  x  2,
13
2  x  2   (x  5)  4  x  
3
For x  2,
2  x  2    x  5  4  x  5
Considering points within each possible region or graphical means,
13
  x 5
3
2
 3 25
h x 2  3x  4   x    3
 2 4
Drawing the graph, we can see there will be two regions

2
 3 25 3 37
x    3 x  
 2  4 2 2
2
25  3 3 13
 x    3  x   
4  2 2 2
Considering these intersections graphically, the desired regions are
3  37 3  13 13  3 37  3
 x or x
2 2 2 2
2 a Since the graph (LHS) is positive everywhere due to the modulus,
the inequality holds in the entire domain x  | x  2
1
b  1  x 1  1
x 1
Intersections at  0,1 and 2,1

From the graph, deduce that the desired region is
0  x  1 and 1  x  2

Worked solutions
Exercise 2J
1 a f  9  1
f  0  1
f    1
f 99  1
c Df 
Rf  1,1
2 a f  4  16
f  0  0
f 1  3
c Df 
Rf 
3 a f  1  4
f  0  1
f  8  3

Worked solutions
c Df 
Rf  y  | y  1 or y  1
4 a f  1  0
f  0  1
f  4  3
f  8  3
c Df 
Rf  y  | y  0
3x  10, x  2

5 f  x    2,  2  x  2
3x  10, x  2

6 a f x  
 2x  4, x  2

 2x  4 , x  2

b f x  
 3x  7, x  3

11  3x, x  3
Exercise 2K
1 Neither
2 Onto and one-to-one

Worked solutions
3 One-to-one, not onto
4 One-to-one, not onto
5 Onto, not one-to-one
6 Onto, not one-to-one
7 Individual Response
Exercise 2L
f  x   2    x   2  x2  f  x  so even
2
1 a
Many-to-one
b  
g   x   3   x     x    3x  x3  g  x  so odd
3
Many-to-one
1 1  1 
c h  x          h  x  so odd
2   x  2x  2x 
One-to-one
p   x   2   x  3 so neither odd nor even

2
d
Many-to-one
e f  x  isn't even defined for x  0 so neither
Many-to-one
f
3 5
 
f   x     x   2   x     x    x  2x 3  x5  f  x  so odd
Many-to-one
2 Suppose that f  x  is both even and odd
Then f   x   f  x   f  x 
 2f  x   0 for all x
 f  x   0 for all x
Exercise 2M
1 a i  
g f 1  g 3  3
ii  
f g 2   f  2  3 2
iii f  g  x    f  x  3 x
 
iv g f  x   g 3x   3x 

Worked solutions
b i  
g f 1  g 2  8
ii  
f g 2  f 8  19
   
iii f g  x   f x2  4  5  3 x2  4  3x2  7  
iv g  f  x    g 5  3x   4  5  3x   29  30x  9x 2
2
c i  
g f 1  g 2  3
ii 
f g 2  f   3  3 1
iii f  g  x    f  
2x  1  2x  1  1
 
iv g f  x   g  x  1  2x  1
2 a i Df 
 1
Rf  y  |y   
 4
Dg 
Rg 
ii Df 
Rf  y  | y  0
Dg  x  | x  2
Rg  y  | y  0
g  x   2  3x   2  3x   2  3x  2  3x   1  3  x  1 3x  2

2
b i f

g f  2  3 x2  x  2  3x  3x2 
Df g 
 1
Rf g  y  |y   
 4
Dg f 
 11 
Rg f  y  |y  
 4
ii f g x  x2  4  1
g f x   x  1  x  3  x  1
2
4 

Worked solutions
Df g  x  | x  2
Rf g  y  | y  1
Dg f  x  | x  3 or x  1
Rg f  y  | y  0
3 a i  
f h  x   1  2 2x  4
ii 
h  g  x    2 x 2  1  4  2x 2  2 
 
iii h h  x   2 2x  4  4

iv f g  h  x    f     
2
2x  4  1  f 2x  3  1  2 2x  3  4x  5
 
b i Df h  x  | x  2 , Rf h  y  | y  1
ii Dh g  , Rh g  y  | y  2
iii Dh h  x  | x  2 , Rh h  y  | y  2
iv Df g h  , Rf g h 
x4
4 f  x   3x  a, g  x  
3
x4
 
f g x  3 
3
a  x 4a
3x  a  4 a4

g f x  
3
x
3
a4
  a  4  a  4  3a  12
3
 2a  8  a  4
5 Individual Response
 b t  h  20  4h  2  80  4h  2  500
2
6 a

 20 16h2  16h  4  320h  160  150 
2
 320h  420
b 10000 = 320h2 + 420
h = 5.47 hours
2
 40  3t  t 2 
7 r t   r v t      0.1  0.2 ; 2 hours
 500 
Exercise 2N
1 a {(2.4),(2,0),(2,−2,),(2,2)}. Inverse relation is not a function since 2 has more than one
image.

Worked solutions
b 3,1 , 2, 6 ,  4, 3 , 0,0 ,  5, 5 ,  3, 2
c  1, 1 , 3, 3 ,  5, 2 ,  4, 4 , 1,1 , 3, 5 ,  2,0
x 1
2 a x  5y  1  y  f 1  x  
5
y 2
b x   y  f 1  x   3x  2
3
c x  y 2  3  y  f 1  x 3 
must restrict to either positive or negative square root for this to be a function
2 2  3x
d x
y 3
 y  3  xy  3x  2  y  f 1  x   x
 x  0
x  y 3  1  y  f 1  x    x  1 3
1
y 1
f x 
y 1
y  1
xy  x  y  1  y  x  1  x  1
x 1
 y  f 1  x    x  1
x 1
x   y  2   x  y  2  y  2  x
2
3 a
Take positive square root to make this a function, and restrict domain
to x  0
 y  f 1  x   2  x
Df 1  x  | x  0
Rf 1  y  | y  2
2y  1
b x  , y  1
y 1
xy  x  2y  1  y 2  x   x  1
2x
 y  f 1  x   , x 1
x 1
x 1 x 1
c x  4y 2  1  y 2  y 
4 2
Take e.g. positive square root to make this a function and restrict domain
such that x  1
x 1
y  f 1  x  
2
4 This can be done by direct substitution, but note that in general,

Worked solutions
g f f 1
g 1  g f f 1  g 1  g id g 1  g id 
g 1  g g 1  id
where id is the identity function id  x   x
 g f  f g   x   x
1 1

 f 1 g 1   x   g f   x  1
Since this is true in general, it is certainly true for the specified functions
5 Important: it must be shown that both f g  x   x and g f  x   x    

 x
a  
f g  x   4 1    4  4  x  4  x
4

1

and g f  x   1   4
 4x  4  1  x  1  x
2
 3  5 2  2 1  x 
b 
f g x   1 
2
x 
2
x
33
1 x
2 2  x  3

and g f  x     x 5
3  
x  5   x  3
 3   x  3  3  x
1
x 3
3
 3 2x  3 
 2  3
 
3
2  3
2x 2x
c 
f g x   
2
 
2

2
x
 2 x  3
3
3
2 3
and g  f  x    2 
 2 x  3  3  x
2 2
Exercise 2O
For all of a, to transform y=f(x) to y=|f(x)|, the graph is unchanged for y≥0, and reflected in the
x=axis for y<0.
For all of ii, to transform y=f(x) to y=f(|x|), the graph is unchanged for x≥0. Where x<0, the part
of the graph for x≥0 is reflected in the y-axis.

Worked solutions

Worked solutions
Exercise 2P
1 a

Worked solutions
2 a
Exercise 2Q
1 a

Worked solutions
2 a r  x   2f  x 
s  x   f  x  3
b r  x   f  x 
x
s x  f    4
2
3 a Rf  y  | 0  y  6
c Df  x  | 2  x  8
d h x  g x  6
e h  x   f  x   6
4 a g  x   f  x 
b g x  f  x 
c g  x   f  x  4  1
5
d g  x   f  x  
4

Worked solutions
1
e g x 
f x
f g  x   f  x   2
Exercise 2R
1
1 In order of the transformations given, the function y  is transformed to
x
2
y 
x
2
then y 
3x
2
then y  3
3  x  2
Df  x  | x  2 , Rf  y  | y  3
1
2 a Horizontal dilation factor of , followed by a vertical dilation of factor 2, then a horizontal
3
translation of 4 units in the positive x-direction, and a vertical translation of 1 unit in the
positive y-direction.
b  
y  2f 2  x  4  1
x 3 x 58 8
3 a y   1
x 5 x 5 x 5
e.g. translation by   , vertical stretch by factor -8, translation by  

 5   0
0 1
   
4x  5 2 2x  1  3 3
b y   2
2x  1 2x  1 2x  1
1
e.g. translation by   , stretch horizontally by scale factor , stretch
 1  2
0
 
vertically by scale factor 3, translation by  
0
2
 
2x  4 2  x  1  2 2
c y   2
x 1 x 1 x 1
e.g. translation by   , stretch vertically by scale factor 2,

 1 
0
 
translation by  
0
2
 

Worked solutions
Exercise 2S

Worked solutions
Chapter review
1 a The graph does not represent a function since it does not pass the vertical line test.
b This graph represents a function.
Df  4  x  5 Rf  1,2
c This graph represents a function.
Df  Rf  y  | 1  y  1
d This mapping does not represent a function since 5 is mapped on to more than one element.
e This graph does not represent a function since it does not pass the vertical line test.
f This relation represents a function.
Df  1,0,3,  
Rf   
2 a  
f g h 2   f  g 3  f 1  2
b  
h1 g 1 f 1 2   h  g 1  h 3  2
1 1 1
y 2
3 a x   y  f 1  x   5x  2
5
b x  1  y  x2  1  y  y  g 1  x   1  x2
3y 2x
c x
2y
 2x  xy  3y  y 
3 x
 x  3
4 Translate the graph of y=f(x) 3 units in the negative x-direction, reflect in the y-axis, vertical
stretch by a factor of 2, vertical translation of 4 units in the positive direction.
5 x  2  2x  1  x  3
1
2  x  2x  1  x 
3
Graphical representation  the desired region is the section between these intersections
1
i.e. -3  x 
3
1 1 x
6 x 2
 x  xy 2  1  y 2 
1 y x
1 x
Take y 
x
1 1 x
  x
 1 x 
2
1 x x 1 x
1
1  x
 x
 
1
1
1  x2  1  x2  1
and  x 2  x  x in the domain 0,1
1 1
1  x2

Worked solutions
x2  1
7 a y  f x 
x
 x 
2
1 x2  1
f  x     f  x  so even
x |x|
x
b y  f x 
x2  1
f  x  
  x    x  f x
  so odd
 x   1
2
x2  1
x x x
c f (x)  ; f ( x)   ; f (x)   , hence neither.
x x x
2 2 A B
8   
x  5x  6  x  3  x  2 x  2 x  3
2
 2  A  x  3  B  x  2 
Set x  2 : 2  A  A  2
Set x  3 : 2  B  B  2
2 2 2
 2
 
x  5x  6 x  2 x  3
Exam-style questions
9 a No real roots    0 (1 mark)
  36  4 2k   k   36  8k 2 (1 mark)
2
36  8k  0
36 9
k2  
8 2
3
k 
2
3 3
k  or k  (2 marks)
2 2
b 6 3
b Equation of line of symmetry is x     (2 marks)
2a 4k 2k
3
Therefore 1
2k
3
k  (1 mark)
2
10 a The graph of f is shifted two units in the positive x-direction and one unit in the negative
y-direction.
b 
y  2(x  2)2  4(x  2)  7  1  (3 marks)

Worked solutions
 
 2(x2  4x  4)  4x  8  7  1
 2x2  4x  6 (1 mark)
3y  4
11 a x  yx  2x  3y  4 (2 marks)
y 2
yx  3y  4  2x
y(x  3)  (4  2x)
2x  4
y 
3 x
2x  4
f 1(x)  (1 mark)
3 x
b x≠3 (1 mark)
k
12 a y  1
x 1
k
x  1
y 1
x  y  1  k  y  1 (1 mark)
xy  x  k  y  1 (1 mark)
xy  y  k  x  1
y  x  1  k  x  1
k  x 1
y 
x 1
k
y  1 (1 mark)
x 1
k
f 1  x   1
x 1
So f is self-inverse
b Range is f  x   1 , f  x   (2 marks)
c
(shape of graph: 1 mark)
(both asymptotes: 1mark)

Worked solutions
x2  6x  13   x  3  4
2
13 a (2 marks)
Therefore k  3 (1 mark)
y   x  3  4
2
b
x   y  3  4
2
 y  3
2
 x4 (2 mark)
y 3  x4
y  3 x 4
f 1  x   3  x  4 (1 mark)
c The domain of f 1  x  is x  4 ,  x   (1 mark)
The range of f 1  x  is f  x   3 ,  f  x    (1 mark)
17  10x 12  5  10x
14 a f x   (2 marks)
2x  1 2x  1
12  1  2x 
 (1 mark)
2x  1
12  5 2x  1

2x  1
12 5 2x  1
 
2x  1 2x  1
12
 5 (1 mark)
2x  1
1
b i x  (1 mark)
2
ii y  5 (1 mark)

Worked solutions
(1 mark for each branch correctly drawn, 1 mark for both asymptotes; 3 marks total)
15 a 6 (1 mark)
18 1  0.82  12
b P   57 (2 marks)
3  0.034  12
18 1  0.82t 
c Solving 100  (1 mark)
3  0.034t
300  3.4t  18 1  0.82t 
300  3.4t  18  14.76t
282  11.36t
282
t   24.8 months (1 mark)
11.36
OR
(1 mark)
t = 24.8 months (1 mark)
18  0.82
d A horizontal asymptote exists at P   434.12 (2 marks)
0.034
Therefore for t  0 , P  434 (1 mark)
OR
(1 mark)
A horizontal asymptote exists at P = 434 (1 mark)
Therefore for t ≥ 0, P < 434 , P  434 (1 mark)
16 a Attempting to use either asymptotes or intercepts, (1 mark)
1
a  2; b  1; c  (3 marks)
2

Worked solutions
(1 mark for both asymptotes; 1 mark for both intercepts; 1 mark for left-hand branch
correct; 1 mark for right-hand branch correct)
17  x  3  x2  6x  9
2
(1 mark)
2  x  3  2x2  12x  18
2
(2 marks)
2  x  3  12x  2x2  18
2
Therefore g  x   2x2  12x (1 mark)

Ch1-2 Solutions PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Ch1-2 Solutions PDF

Uploaded by

Copyright:

Available Formats

Worked solutions

From patterns to generalizations:

© Oxford University Press 2019 1

1 a Next three terms are 9, 10.5, 12

b Next three terms are 5, 2, -1

c Next three terms are 243, 729, 2187

1, -1, -3, -5, -7

© Oxford University Press 2019 2

3 a 5, 10, 15, 20, …. The multiples of 5

© Oxford University Press 2019 3

e The sequence can be written as 0  2, 1  3, 2  4, 3  5, ..., (n  1)  (n  1)

OR The sequence can be written as 12  1, 22  1, 32  1, 42  1, ...

Explanation: think of this as

 1  1   1   1   1   1  ...

© Oxford University Press 2019 4

6 a The series can be written as 8  8  3  8  2  3  8  3  3  8  4  3

It has five terms and the general term can be written as ur  11  3r

b The series can be written as 1  3  2  5  3  7   4  9  5  11

d The series can be written as 1²  3²  5²  7²  9²

e The series consists of the multiples of 3k

© Oxford University Press 2019 5

 u15  5  6 15  1  5  6 14  89

u11  10  7 11  1  10  7 10  60

u17  a  2 17  1  a  2 16  a  32

© Oxford University Press 2019 6

u15  u1  d 15  1  180  u1  14d  180

7 Let the three terms be a, a  d, a  2d

Let the three terms be a  d, a, a  d

Substituting for a and d in a  d, a, a  d the three numbers would either be or 20, 8,  4

8 In year 2017, Jung Ho earned 38000  17 500  46500

9 a This is an arithmetic series with u1  3, d  3  3  6

© Oxford University Press 2019 7

b This is an arithmetic series with u1  31, d  40  31  9

c This is an arithmetic series with u1  a  1, d  a  2  (a  1)  3

10 a Since 3r  8 is linear relation this is an arithmetic series with 50 terms.

b Since 7  8r is linear relation this is an arithmetic series with 100 terms.

c Since 2ar  1 is linear relation in r , a is a constant this is an arithmetic series with 20

11 a This is an arithmetic sequence with u1  4, d  5

b This is an arithmetic sequence with u1  3, d  8

© Oxford University Press 2019 8

c This is an arithmetic sequence with u1  1, d  5

© Oxford University Press 2019 9

Using solve or Nsolve (depending on GDC type)

© Oxford University Press 2019 10

© Oxford University Press 2019 11

 S15  0.1   0.143  to 3s.f.

© Oxford University Press 2019 12

14 Let the three pieces have lengths u1, u2 and u3

© Oxford University Press 2019 13

1 a 220  7 10  290

2 Let Jane's starting salary be S

so Jane's starting salary was €42150 to the nearest euro

© Oxford University Press 2019 14

© Oxford University Press 2019 15

6 a Interest 12% pa  1% per month

Let the payment per month be x . Interest is compounded monthly

After one month the amount due is

After 3 months the amount due is

After 24 months the amount due would be

1500 1.01  1.01 x  1.01

Monthly payments of $70.61

b Total amount paid

b 3  0.95 10  12.5  12.5m