RAFFLES INSTITUTION

2017 YEAR 6 PRELIMINARY EXAMINATION

Higher 3

MATHEMATICS 9820
21 September 2017
3 hours

Additional materials: Answer Paper

Graph paper
List of Formulae (MF26)

READ THESE INSTRUCTIONS FIRST

Write your name and CT group on all the work you hand in.
Write in dark blue or black pen on both sides of the paper.
You may use an HB pencil for any diagrams or graphs.
Do not use staples, paper clips, glue or correction fluid.

Answer all the questions.

Give non-exact numerical answers correct to 3 significant figures, or 1 decimal place in the case of
angles in degrees, unless a different level of accuracy is specified in the question.
You are expected to use an approved graphing calculator.
Unsupported answers from a graphing calculator are allowed unless a question specifically states
otherwise.
Where unsupported answers from a graphing calculator are not allowed in a question, you are
required to present the mathematical steps using mathematical notations and not calculator
commands.
You are reminded of the need for clear presentation in your answers.

At the end of the examination, fasten all your work securely together.
The number of marks is given in brackets [ ] at the end of each question or part question.

This document consists of 7 printed pages.

RAFFLES INSTITUTION
Mathematics Department
 RI 2017 [Turn over
 2

1 (a) The function f is defined for all by

k for x  l ,
f ( x)  
0 for x  l ,
where k and l are positive constants.
 1 
(i) Sketch the graph of y  f  x  l  . [1]
 2 
The function g n , where n  1, is defined by
1  1   1 
g n (x)  f  x  l   f  x  l   .
2  n   n 

(ii) Sketch the graph of y  g 2 (x) . [2]


(iii) Show that  g n ( x) dx is a constant independent of n. [2]

(b) Let h( x)  ax 2  bx  c , where a, b and c are real numbers and a  0 .

(i) It is given that h( x )  0 has no real roots, and the graph of y  h( x ) is

reflected about the horizontal line passing through the stationary point to obtain
the graph of y  k( x ) .
Determine k( x ) in terms of a, b and c. [3]
(ii) Let    i be the roots of h( x )  0 , where ,  are real numbers.
Find the roots of k( x )  0 in terms of  and . [2]
(iii) It is further given that h( m  x )  h( m  x ) and h(0)  2h( m ) , where m is a
non-zero real number. Find the roots of h( x )  0 in terms of m. [2]

RI 2017 9820/01/P/17

 3

2 An n-sided polygon is said to be good under the following conditions:

 it is equilateral, i.e. all its sides are of equal length,
 its interior angles are either 120° or 240°.

(i) Let l be the number of interior angles of 240° in a good n-sided polygon. By
considering the sum of the angles in the polygon, show that n  2l  6 . [1]

(ii) Show that there exists a 6-sided good polygon. [1]

(iii) Show that if there exists an n-sided good polygon, then there exists an (n  4) -sided
good polygon. [2]

(iv) Hence determine all possible values of n such that there exists an n-sided good
polygon. [3]

3 Let s0 and t0 be real numbers such that 0  t0  s0 . Positive real-numbered sequences

s0 , s1 , s2 ,... and t0 , t1 , t2 ,... are defined by
s t 2s t
sn  n 1 n 1 and tn  n 1 n 1 , for n  1.
2 sn 1  tn 1
(i) Show that sn  tn for n  0. [2]

(ii) By considering sn  sn 1 and sn tn , deduce that {sn } is monotone decreasing and {tn }
is monotone increasing. [2]

The monotone convergence theorem states that if a sequence is monotone increasing and
bounded above, it will converge. Similarly, if a sequence is monotone decreasing and
bounded below, it will converge.

(iii) By use of the monotone convergence theorem, show that both lim sn and lim t n
n  n

exist. [2]
s0  t0
(iv) By showing sn  tn  for n  0, prove that lim sn  lim tn . [3]
2n n n

(v) Find lim sn t n and deduce the value of lim sn in terms of s0 and t0 . [3]
n n 

[Turn over

RI 2017 9820/01/P/17

 4

4 Let a1 ,a2 ,...,an and b1 ,b2 ,...,bn be real numbers such that b1  b2  ...  bn . Let r < s and

n
S   ai bi ,
i 1

 n 
S    ai bi   as br  ar bs .

 i 1 
 ir ,s 

(i) Show that S  S  if and only if as  ar . [2]

(ii) Hence show that if a1  a2  ...  an and b1  b2  ...  bn are real numbers arranged in
ascending order, for any permutation (a1, a2 ,..., an ) of (a1 ,a2 ,...,an ) , we have
a1b1  a2b2  ...  anbn  a1b1  a2 b2  ...  an bn  anb1  an 1b2  ...  a1bn . [2]

(iii) Deduce that if x1 , x2 ,..., xn are distinct positive integers,

x1 x2 x 1 1 1
2
 2  ...  n2    ...  . [3]
1 2 n 1 2 n

 :  be a bijection. Define the sequence Tn by Tn    (2k ) . State, with a

n
(iv) Let
k 1 k
reason, if the sequence T1 , T2 , T3 ,... converges. [2]

5 Let p be a prime number.

(i) Show that if n is a number in the set P, where P  {1, 2, ..., p 1}, then there exists a
unique integer  (n) in P such that n (n)  1 (mod p) . [4]
(ii) Deduce that ( p 1)!  1 (mod p) . [2]
(iii) Hence show that if p is a prime such that p  1 (mod 4) , there exists an integer x
such that x 2  1 (mod p) . [2]

Fermat’s Little Theorem states that if p is a prime and a is an integer coprime to p, then
a p1  1 (mod p) .

(iv) Use Fermat’s Little Theorem to show that if p is an odd prime and there exists an
integer x such that x 2  1 (mod p) , then p  1 (mod 4) . [3]

RI 2017 9820/01/P/17

 5

A graphing calculator must not be used for question 6.

6 (i) Given that f is a continuous function, explain, with the aid of a sketch, why the value
of
1   1  2  n 
lim f    f    ...  f   
  n  n  n 
n n

 f  x
1
is dx. [2]
0

n
1
(ii) Hence evaluate lim  , leaving your answer in exact form. [4]
n
k 1  (3n  k 2 )
2

(iii) (a) By considering the function g( x)  x  sin x , show that sin x  x for x  0 .
x3
Hence or otherwise, show that x   sin x for x  0 . [4]
6
k
n
k3  k n k k n k k
(b) Deduce that 
k1
 n 2 6n 6  n  n 2
 sin 
k1
sin sin   2 sin .
n k 1 n n
[1]

n
k k
(c) Hence determine the exact value of lim
n
 sin n
k 1
2
sin .
n
[3]

7 In a race, there are r racers. Let f ( r , p ) be the number of ways the r racers can complete
the race in exactly p placings, where it is possible for multiple racers to be in the same
placing. For example, f (2,1)  1 as both racers are tied in first placing, and f (2, 2)  2 as
either racer can be first and the other is second.

(i) Explain combinatorically the recurrence

f (r , p)  p  f (r  1, p  1)  f (r  1, p). [2]

(ii) Let F(r ) be the total number of ways for r racers to complete the race with any
number of ties.
r
(a) Show that F( r )   p !S( r , p ) where S(r, n) denote the number of ways of
p 1

distributing r distinct objects into n identical boxes so that no box is empty. [2]

(b) Find the total number of ways for 5 racers to complete the race with any
number of ties. [3]

(iii) Let r  2. Find an expression, in terms of the function F , for r racers to complete
the race with any number of ties, if a particular racer will never finish first in the race.
Explain clearly how this expression is derived. [3]

[Turn over
RI 2017 9820/01/P/17
 6

8 Euler’s totient-function  (n) is defined as the number of integers in {1, 2, …, n} that are
coprime to n. Let Ai be the set of positive integers that are multiples of i which are less
than or equal to n.

(i) Show that Aj  Ak  Ajk if j and k are coprime. [3]

(ii) Hence show that if n  p11 p2 2 ... pk k , where p1, p2 , ..., pk are the distinct prime

factors of n, . [4]

(iii) A function f :  is said to be multiplicative if f (1)  1 and f ( ab)  f ( a )f (b)

holds for all coprime positive integers a and b. The function f is said to be
completely multiplicative if f (1)  1 and f ( ab)  f ( a )f (b) holds for all positive
integers a and b.

State whether the following assertions are true or false. Prove those which you
consider to be true and give counter-examples for those which you consider to be
false.

(a)  is multiplicative. [1]

(b)  is completely multiplicative. [1]

(c) If f is multiplicative, f ( a )f (b )  f (gcd( a , b ))f (lcm( a , b )) holds for all positive

integers a and b. [2]

[Question 9 is printed on the next page]

RI 2017 9820/01/P/17

 7

9 The Farey sequences F1 , F2 ,... , is a list of sequences consisting of all irreducible fractions
between 0 and 1. In particular, Fn contains all such fractions with denominators less than
or equal to n, arranged in ascending order. The first four sequences are therefore

 0 1
F1   ,  ,
 1 1
 0 1 1
F2   , ,  ,
 1 2 1
 0 1 1 2 1
F3   , , , ,  ,
 1 3 2 3 1
 0 1 1 1 2 3 1
F4   , , , , , ,  .
 1 4 3 2 3 4 1

a c a c
(i) If and are consecutive terms in Fn where  and bc  ad  1, show that
b d b d
ac a ac c
is also an irreducible fraction and   . [2]
bd b bd d

m a m c
(ii) Show that for any irreducible fraction such that   and bc  ad  1, there
n b n d
exists positive integers q and r such that m  qa  rc and n  qb  rd . [3]

a c a c
(iii) Hence show that if and are consecutive terms in Fn where  and
b d b d
a c a ac c
bc  ad  1, then either and are consecutive terms in Fn1 or , , are
b d b bd d
a ac c
consecutive terms in Fn1 , where   . [1]
b bd d

a c
(iv) Hence prove by mathematical induction that if and are consecutive terms in Fn
b d
a c
such that  , then bc  ad  1, for [4]
b d

(v) Determine coprime positive integers m and n satisfying

(a) n  10 , [2]
(b) n  100 , [2]
m
so that   is minimum.
n

RI 2017 9820/01/P/17

 8

[END OF PAPER]

RI 2017 9820/01/P/17