Scribd
Upload
22 views4 pages

Mathematics Paper 3 Discrete Mathematics HL

Uploaded by

pananthanpillai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views4 pages

Mathematics Paper 3 Discrete Mathematics HL

Uploaded by

pananthanpillai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

M13/5/MATHL/HP3/ENG/TZ0/DM

22137207

mathematics
Higher level
Paper 3 – DISCRETE MATHEMATICS

Tuesday 21 May 2013 (afternoon)

1 hour

instructions to candidates

 Do not open this examination paper until instructed to do so.


 Answer all the questions.
 Unless otherwise stated in the question, all numerical answers should be given exactly or
correct to three significant figures.
 A graphic display calculator is required for this paper.
 A clean copy of the Mathematics HL and Further Mathematics SL information booklet is
required for this paper.
 The maximum mark for this examination paper is [60 marks].

2213-7207 4 pages
© International Baccalaureate Organization 2013
–2– M13/5/MATHL/HP3/ENG/TZ0/DM

Please start each question on a new page. Full marks are not necessarily awarded for a correct answer
with no working. Answers must be supported by working and/or explanations. In particular, solutions
found from a graphic display calculator should be supported by suitable working. For example, if graphs
are used to find a solution, you should sketch these as part of your answer. Where an answer is incorrect,
some marks may be given for a correct method, provided this is shown by written working. You are therefore
advised to show all working.

1. [Maximum mark: 15]

(a) Using the Euclidean algorithm, show that gcd (99 , 332) = 1. [4 marks]

(b) (i) Find the general solution to the diophantine equation 332 x − 99 y = 1.

(ii) Hence, or otherwise, find the smallest positive integer satisfying the
congruence 17 z ≡ 1(mod 57). [11 marks]

2. [Maximum mark: 12]

The diagram shows a weighted graph with vertices A, B, C, D, E, F, G. The weight of


each edge is marked on the diagram.

B 7 C

3 6
4 2
A 5 1 D

2 4

G 6 F 5 E

(a) (i) Explain briefly why the graph contains an Eulerian trail but not an
Eulerian circuit.

(ii) Write down an Eulerian trail. [4 marks]

(b) (i) Use Dijkstra’s algorithm to find the path of minimum total weight joining
A to D.

(ii) State the minimum total weight. [8 marks]

2213-7207
–3– M13/5/MATHL/HP3/ENG/TZ0/DM

3. [Maximum mark: 10]

When numbers are written in base n , 332 = 1331.

(a) By writing down an appropriate polynomial equation, determine the value of  n . [4 marks]

(b) Rewrite the above equation with numbers in base 7. [6 marks]

4. [Maximum mark: 15]

The graph G  has the following adjacency matrix.

A B C D E
A 0 1 0 1 1
 
B 1 0 0 0 0
C 0 0 0 1 0
 
D 1 0 1 0 1
E 1
 0 0 1 0 

(a) Determine the number of walks of length five beginning and ending at E. [3 marks]

(b) Show that G and its complement G′ have the same number of edges. [3 marks]

(c) (i) Writing the vertices in the order B, D, A, C, E, determine the adjacency
matrix of G′ .

(ii) Deduce that G and G′ are isomorphic. [5 marks]

(d) The graph H  has 6 vertices. Show that  H and H ′ , the complement of  H ,
cannot be isomorphic. [4 marks]

2213-7207 Turn over


–4– M13/5/MATHL/HP3/ENG/TZ0/DM

5. [Maximum mark: 8]

The positive integer  p is an odd prime number.

p
(a) Show that ∑k
k =1
p
≡ 0(mod p ). [4 marks]

p
(b) Given that ∑k
k =1
p −1
≡ n (mod p ) where 0 ≤ n ≤ p − 1 , find the value of  n . [4 marks]

2213-7207

You might also like