Professional Documents
Culture Documents
MATHEMATICS 9820
21 September 2017
3 hours
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.
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.
(iii) Show that g n ( x) dx is a constant independent of n. [2]
(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]
(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]
(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
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
ir ,s
(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 a1b1 a2 b2 ... an bn anb1 an 1b2 ... a1bn . [2]
(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 p1 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]
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
k1
n 2 6n 6 n n 2
sin
k1
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.
(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.
(ii) Hence show that if n p11 p2 2 ... pk k , where p1, p2 , ..., pk are the distinct prime
factors of n, . [4]
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.
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
ac a ac c
is also an irreducible fraction and . [2]
bd b bd 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 ac c
bc ad 1, then either and are consecutive terms in Fn1 or , , are
b d b bd d
a ac c
consecutive terms in Fn1 , where . [1]
b bd 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
[END OF PAPER]