Mixed review

2 Representing relationships:
functions
 n   2n 
1 Simplify the difference of the binomial coefficients      , n  3 , and hence solve the
3  2 
 n   2n 
inequality       32n .
3  2 

2 A sum of $5000 is invested at a compound interest rate of 6.3% per year.

a Determine the value of the investment after 5 years.

b Determine how many years it will take for the investment to exceed $10,000.

3 A geometric sequence has first term 2 and a common ratio of 1.05. Find the smallest term that
is greater than 500.

4 The sum to infinity of a geometric series is 32. The sum of the first four terms is 30, and all
terms are positive. Find the difference between the sum to infinity and the sum of the first
eight terms.

5 If f (x)  (x  2)2  3 and g(x)  ax  b ,

3
a find a, a>0, and b if f (g(x))  4x 2  6x  .
4

b If h(x)  5x  2 and k(x)  cx2  x  2 , find c such that h(k(x))  0 has equal roots.

1
6 It is given that f (x)  2 .
x2

a Find all x for which f is real and finite.

b Find the range of f.

2x  1
7 f (x)  is a one-to-one function whose domain is A={x|x>0}.
x 2

a State the range, B, of f.

b Find f 1(x), x  B .

x
8 If f (x)  2x  1 and g(x)  , x  1 , find the values of x for which f (g(x))  g(f (x)) .
x 1

© Oxford University Press 2019 1

 Mixed review

9 Below is the graph of f(x) whose maximum is (-2,5) and its horizontal asymptote is y=1. State
the maximum point and equation of the asymptote after each transformation on the
original curve.

a f(x+3)-2 b -5f(2x)

Exam-style questions

10 A quadratic sequence has an nth term of n2 – 4n + 21.

a Find the 6th term of the sequence. (1)

b Prove that every term in the sequence is positive. (4)

2
 2x   2x 
11 a Find the domain of x for which the geometric series 1      ... has a finite
 3   3 
sum. (3)

b Find the sum of the series if x = 1.2. (2)

1 8
12 Given that f (x)  (1  x) , find the coefficient of x3. (4)
2

 1  1  1  1 
13 Consider the product P(n)  1  2  1  2  1  2  ... 1  2  , n  , n>1.
 2  3  4   n 

a b c
a Given that P(2)  ; P(3)  ; P(4)  , find a, b and c. (3)
4 6 8

b Suggest an equivalent expression for P(n) as a rational number in terms of n. (2)

c By using mathematical induction, prove that the product

 1  1  1  1
P(n)  1  2  1  2  1  2  ... 1  2  and your expression from part (b) are
 2  3  4   n 
equivalent. (7)

14 a Prove, by the method of mathematical induction, that the discrete

1
function f (n)  12  22  32  ...  n2 is equal to n(n  1)(2n  1) for n  
. (7)
6

© Oxford University Press 2019 2

 Mixed review

b Hence, find an expression for 32  62  92  ...  (3n)2 . (2)

c Given that S1  12  42  72  ...  (3n  2)2 and S2  22  52  82  ...  (3n  1)2 , prove
that

i S2  S1  6n3  n
(3)

ii S2  S1  3n2
(4)

d Hence, or otherwise, find S1 and S2 in terms of n. (4)

© Oxford University Press 2019 3

 Mixed review

Answers

 n  n(n  1)(n  2)  2n   n   2n  1
1   ,    n(2n  1) , so       n(n2  15n  8) and
3 6 2 3  2  6
1
n(n2  15n  8)  32n  n2  15n  8  192  (n  23)(8  n)  0  8  n  0, n  23 .
6

2 a $6790

b 12 years

3 521

1
4
8

5 a a=2, b=-1/2

5
b c 
48

1 1
6 a  x
2 2

b y≥0

 1 
7 a B    ,2
 2 

1  2x
b f 1(x) 
2x

8 -1<x<0 or x≥1/3

9 a (-5,3); y=-1

b (-1,-25); y=-5

10 a 62 – 4(6) + 21 = 33 A1

b Completing the square, n2 – 4n + 21= (n – 2)2 + 17 M1A2

Since (n – 2)2 ≥ 0 for all integer n, (n – 2)2 + 17 > 0 for all integer n. R1

11 a The series has a finite sum when |r|<1.

2x
 1  1.5  x  1.5, x  0 R1A1A1
3

a 1
b s   5 (M1)A1
1r 2  1.2
1( )
3

3
 1
12 The coefficient of x3 is 8C3    1
5
M1A1A1
 2 

© Oxford University Press 2019 4

 Mixed review

= –7 A1

a 1 3
13 a P(2)   1  2   a  3; A1
4 2 4

b  1  1 4
P(3)   1  2  1  2    b  4 A1
6  2  3  6

c  1  1  1 5
P(4)   1  2   1  2   1  2    c  5 A1
8  2  3  4  8

n 1
b P(n)  , n≥2 A2
2n

 1  1  1  1  n 1
c Prove that P(n)  1  2  1  2  1  2  ... 1  2  = , n≥2
 2  3  4   n  2n

Show that P(2) is true:

1 3 3
LHS = 1   ; RHS= , hence P(2) is true. M1
22 4 4

Assume P(k) is true, i.e. that

 1  1  1  1  k 1 
P(k )  1  2  1  2  1  2  ... 1  2  = ,k  ,k≥2 M1
 2  3  4   k  2k

Required to prove that P(k + 1) is true, i.e. that

 k  1  1  k 2
  1  2 
 M1
 2k  (k  1)  2(k  1)

LHS:

 k  1  1 
  1  2 
 2k  (k  1) 
k 1 1
  A1
2k 2k(k  1)

(k  1)2  1
 A1
2k(k  1)

k 2
 A1
2(k  1)

=RHS

Since P(2) was shown to be true, and it was proved that if P(k) is true, then P(k+1) is also
true, it follows by the principle of mathematical induction that P(n) is true,


n , n≥2. R1

n(n  1)(2n  1)
14 a P(n) : 12  22  32  ...  n2 
6

© Oxford University Press 2019 5

 Mixed review

Show P(1) is true:

LHS: 12  1

1 6
RHS: 1 2  3   1
6 6
M1

Hence P(1) is true.


Assume P(n) is true for n  k, k  , i.e. that

k(k  1)(2k  1)
P(k ) : 12  22  32  ...  k 2  M1
6

Required to prove that P(n) is true for n = k + 1, i.e. that

(k  1)(k  2)(2k  3)
12  22  32  ...  k 2  (k  1)2  M1
6

LHS: 12  22  32  ...  k 2   k  1  P  k    k  1
2 2

A1

k  k  1 2k  1
  k  1
2

6 by the assumed result for P(k)

k  k  1 2k  1  6  k  1
2


6

 k  1 k 2k  1  6  k  1


6
M1

 k  1 2k 2  7k  6 

6
A1
1
 (k  1)(k  2)(2k  3) =RHS
6

Since P(1) was shown to be true, and it was also proved that if P(k) is true, then P(k+1) is
also true, it follows by the principle of mathematical induction that P(n) is also true for

n . R1

32  62  92  ...  3n  32(1  22  32  ...  n2 )

2
b M1

1 
 9  n(n  1)(2n  1)  from part a R1
6 

3

2
 n(n  1)(2n  1) AG

c i S2  S1  12  22  42  52  ...  (3n  2)2  (3n  1)2

 12  22  32  ...  (3n)2  (32  62  92  ...  (3 n)2) A1

© Oxford University Press 2019 6

 Mixed review

1 3
=
6
 3n 3n  1 6n  1  n  n  1 2n  1 (by parts a and b)
2

n 3n
 (3n  1)(6n  1)  (n  1)(2 n  1) M1
2 2

n
 (3n  1)(6n  1)  3 (n  1)(2n  1)
2

n

2

(18n2  9n  1)  3(2n2  3n  1) 

n
 (12n2  2) A1
2

 6n3  n AG


ii S2  S1  (22  12 )  (52  42)  (82  72)  ...  (3n  1)2  (3n  2)2  A1

 3  9  15  21  ...  (6n  3)

 3(1  3  5  7  ...  (2n  1)) A1

Arithmetic series

n n
S2n 1 
2
u1  u2n1   2 (1  2n  1)  n2 M1A1

 S2  S1  3n2 AG


S2  S1  6n  n
3
 3 2
d  2
  2S2  6n  3n  n (M1)A1
S
 2  S1  3n 


n
S2 
2

6n2  3n  1  A1

n
 S1  6n3  n  (6n2  3n  1)
2

3n2 n
 3n3   A1
2 2

© Oxford University Press 2019 7