1.

(a) Use the Euclidean algorithm to find the greatest common divisor of the numbers
56 and 315.
(4)

(b) (i) Find the general solution to the diophantine equation 56x + 315y = 21.

(ii) Hence or otherwise find the smallest positive solution to the congruence
315x ≡ 21 (modulo 56).
(9)
(Total 13 marks)

2. The complete graph H has the following cost adjacency matrix.

A B C D E
A – 19 17 10 15
B 19 – 11 16 13
C 17 11 – 14 13
D 10 16 14 – 18
E 15 13 13 18 –

Consider the travelling salesman problem for H.

(a) By first finding a minimum spanning tree on the subgraph of H formed by deleting vertex
A and all edges connected to A, find a lower bound for this problem.
(5)

(b) Find the total weight of the cycle ADCBEA.

(1)

(c) What do you conclude from your results?

(1)
(Total 7 marks)

3. (a) Given that a, b ∈ and c ∈ +, show that if a ≡ 1 (mod c), then ab ≡ b (mod c).
(2)
 (b) Using mathematical induction, show that 9n ≡ l (mod 4), for n ∈ .
(6)

(c) The positive integer M is expressed in base 9. Show that M is divisible by 4 if the sum of
its digits is divisible by 4.
(4)
(Total 12 marks)

4. The diagram below shows the graph G with vertices A, B, C, D, E and F.

(a) (i) Determine if any Hamiltonian cycles exist in G. If so, write one down.
Otherwise, explain what feature of G makes it impossible for a Hamiltonian cycle
to exist.

(ii) Determine if any Eulerian circuits exist in G. If so, write one down.
Otherwise, explain what feature of G makes it impossible for an Eulerian circuit to
exist.
(4)
 (b) (i) Write down the adjacency matrix for G.

(ii) Find the pair of distinct vertices that are linked by the smallest number of walks of
length 5.

(iii) Write down four of these walks.

(iv) Identify the vertex that is linked to itself by the largest number of
walks of length 5.
(7)

(c) Prove that no more than 3 edges can be added to G while keeping it planar and simple.
(4)

(d) Given that G′ (the complement of G) is planar, find the number of faces in G′.
(3)
(Total 18 marks)

5. (a) Explaining your method fully, determine whether or not 1189 is a prime number.
(4)

(b) (i) State the fundamental theorem of arithmetic.

(ii) The positive integers M and N have greatest common divisor G and least common
multiple L. Show that GL = MN.
(6)
(Total 10 marks)

6. (a) Prove that if gcd(a, b) = 1 and gcd(a, c) = 1, then gcd (a, bc) = 1.
(5)

(b) (i) A simple graph has e edges and v vertices, where ν > 2. Prove that if all the
vertices have degree at least k, then 2e ≥ kv.
 (ii) Hence prove that every planar graph has at least one vertex of degree less than 6.
(6)
(Total 11 marks)

7. A canal system divides a city into six land masses connected by fifteen bridges, as shown in the
diagram below.

(a) Draw a planar graph to represent this map.

(2)

(b) Write down the adjacency matrix of the graph.

(2)

(c) List the degrees of each of the vertices.

(2)
 (d) State with reasons whether or not this graph has

(i) an Eulerian circuit;

(ii) an Eulerian trail.

(4)

(e) Find the number of walks of length 4 from E to F.

(2)
(Total 12 marks)

8. (a) Given the linear congruence ax ≡ b(mod p), where a, b ∈ , p is a prime and
p–2
gcd (a, p) = 1, show that x ≡ a b (mod p).
(4)

(b) (i) Solve 17x ≡ 14 (mod 21).

(ii) Use the solution found in part (i) to find the general solution to the Diophantine
equation 17x + 21y = 14.
(10)
(Total 14 marks)

9. (a) (i) One version of Fermat’s little theorem states that, under certain conditions,

ap–1 ≡ 1(mod p).

Show that this result is not valid when a = 4, p = 9 and state which condition is not
satisfied.

(ii) Given that 564 ≡ n(mod 7), where 0 ≤ n ≤ 6, find the value of n.
(8)
 (b) Find the general solution to the simultaneous congruences

x ≡ 3(mod 4)
3x ≡ 2(mod 5).
(6)
(Total 14 marks)

10. The positive integer N is expressed in base 9 as (anan–1 ... a0)9.

(a) Show that N is divisible by 3 if the least significant digit, a0, is divisible by 3.
(3)

(b) Show that N is divisible by 2 if the sum of its digits is even.

(3)

(c) Without using a conversion to base 10, determine whether or not (464860583)9 is
divisible by 12.
(6)
(Total 12 marks)

11. (a) Show that, for a connected planar graph,

v + f – e = 2.
(7)

(b) Assuming that v ≥ 3, explain why, for a simple connected planar graph, 3f ≤ 2e and hence
deduce that e ≤ 3v – 6.
(4)

(c) The graph G and its complement G′ are simple connected graphs, each having
12 vertices. Show that G and G′ cannot both be planar.
(7)
(Total 18 marks)
12. Given that a, b, c, d ∈ , show that

(a – b)(a – c)(a – d)(b – c)(b – d)(c – d) ≡ 0 (mod 3).

(Total 7 marks)

13. The figure below shows the graph G.

(a) (i) Write down the adjacency matrix for G.

(ii) Find the number of walks of length 4 beginning and ending at B.

(5)

(b) (i) Draw G′, the complement of G.

(ii) Write down the degrees of all the vertices of G and all the vertices of G′.

(iii) Hence, or otherwise, determine whether or not G and G′ are isomorphic.

(6)
(Total 11 marks)

14. Given that n2 + 2n + 3 ≡ N (mod 8), where n ∈ +

and 0 ≤ N ≤ 7, prove that N can take one of
only three possible values.
(Total 9 marks)
15. The following diagram shows a weighted graph G.

(a) (i) Explain briefly what features of the graph enable you to state that G has an
Eulerian trail but does not have an Eulerian circuit.

(ii) Write down an Eulerian trail in G.

(3)

(b) (i) Use Kruskal’s algorithm to find and draw the minimum spanning tree for G.
Your solution should indicate the order in which the edges are added.

(ii) State the weight of the minimum spanning tree.

(5)

(c) Use Dijkstra’s algorithm to find the path of minimum total weight joining A to D, and
state its weight. Your solution should indicate clearly the use of this algorithm.
(10)
(Total 18 marks)
16. (a) Find the general solution for the following system of congruences.

N ≡ 3 (mod 11)
N ≡ 4 (mod 9)
N ≡ 0 (mod 7)
(9)

(b) Find all values of N such that 2000 ≤ N ≤ 4000.

(2)
(Total 11 marks)

17. Consider the following weighted graph.

(a) (i) Use Kruskal’s algorithm to find the minimum spanning tree. Indicate the order in
which you select the edges and draw the final spanning tree.

(ii) Write down the total weight of this minimum spanning tree.
(8)

(b) Sketch a spanning tree of maximum total weight and write down its weight.
(4)
(Total 12 marks)

18. (a) Write down Fermat’s little theorem.

(2)
 (b) In base 5 the representation of a natural number X is (k00013(5 – k))5.
This means that X = k × 56 + 1 × 52 + 3 × 5 + (5 – k).

In base 7 the representation of X is (anan–1...a2a1a0)7.

Find a0.
(5)

(c) Given that k = 2, find X in base 7.

(4)
(Total 11 marks)

19. (a) A graph has n vertices with degrees 1, 2, 3, …, n. Prove that n ≡ 0 (mod 4) or
n ≡ 3 (mod 4).
(6)

(b) Let G be a simple graph with n vertices, n ≥ 2. Prove, by contradiction, that at least two
of the vertices of G must have the same degree.
(8)
(Total 14 marks)
20. Sameer is trying to design a road system to connect six towns, A, B, C, D, E and F.
The possible roads and the costs of building them are shown in the graph below.
Each vertex represents a town, each edge represents a road and the weight of each edge is the
cost of building that road. He needs to design the lowest cost road system that will connect the
six towns.

(a) Name an algorithm that will allow Sameer to find the lowest cost road system.
(1)

(b) Find the lowest cost road system and state the cost of building it. Show clearly the steps
of the algorithm.
(7)
(Total 8 marks)

21. (a) Use the Euclidean algorithm to find gcd (12306, 2976).
(5)

(b) Hence give the general solution to the diophantine equation 12306x + 2976y = 996.
(9)
(Total 14 marks)
22. The adjacency matrix of the graph G, with vertices P, Q, R, S, T is given by:

P Q R T S
P 0 2 1 01
 
Q 2 1 1 01
R 1 1 1 20
 
S 1 1 0 00
 
T 0 0 2 0 0

(a) Draw the graph G.

(3)

(b) (i) Define an Eulerian circuit.

(ii) Write down an Eulerian circuit in G starting at P.

(3)

(c) (i) Define a Hamiltonian cycle.

(ii) Explain why it is not possible to have a Hamiltonian cycle in G.

(5)

(d) (i) Find the number of walks of length 5 from P to Q.

(ii) Which pairs of distinct vertices have more than 15 walks of length 3 between
them?
(8)
(Total 19 marks)
23. Two mathematicians are planning their wedding celebration and are trying to arrange the
seating plan for the guests. The only restriction is that all tables must seat the same number of
guests and each table must have more than one guest. There are fewer than 350 guests, but they
have forgotten the exact number. However they remember that when they try to seat them with
two at each table there is one guest left over. The same happens with tables of 3, 4, 5 and 6
guests. When there were 7 guests per table there were none left over. Find the number of
guests.
(Total 10 marks)

24. (a) Using Fermat’s little theorem, show that, in base 10, the last digit of n is always equal to
the last digit of n5.
(7)

(b) Show that this result is also true in base 30.

(2)
(Total 9 marks)

25. Prove that 3k + 2 and 5k + 3, k ∈ are relatively prime.

(Total 6 marks)

∞
3
26. (a) Find the value of ∑ 9n
n =1
2
+ 3n − 2
.

(6)

∞
(b) (i) Sum the series ∑x
r =0
r
.
 (ii) Hence, using sigma notation, deduce a series for

1
(a) ;
1+ x2

(b) arctan x;

π
(c) .
6
(11)

100
(c) Show that ∑ n! ≡ 3(mod15).
n =1

(4)
(Total 21 marks)

27. (a) Given that the integers m and n are such that 3│(m2 + n2), prove that 3│m and 3│n.
(7)

(b) Hence show that 2 is irrational.

(5)
(Total 12 marks)

28. An arithmetic sequence has first term 2 and common difference 4. Another arithmetic sequence
has first term 7 and common difference 5. Find the set of all numbers that are members of both
sequences.
(Total 9 marks)
29. The diagram below shows the weighted graph G.

(a) (i) What feature of the graph enables you to deduce that G contains an Eulerian
circuit?

(ii) Find an Eulerian circuit.

(3)

(b) (i) Find the number of distinct walks of length 4 beginning and ending at F.

(ii) Determine which of these walks has the minimum weight.

(iii) Determine which of these walks has the maximum weight.

(7)

(c) Use Kruskal’s Algorithm to find the minimum spanning tree for G, showing the order in
which the edges are added.
(6)
(Total 16 marks)

30. (a) Show that a positive integer, written in base 10, is divisible by 9 if the sum of its digits is
divisible by 9.
(7)
 (b) The representation of the positive integer N in base p is denoted by (N)p.
If (5 (126 ) 7 ) 7 = (a n a n −1 ... a1 a 0 ) 7 , find a0.
(9)
(Total 16 marks)

31. Use the Euclidean Algorithm to find the greatest common divisor of 7854 and 3315.

Hence state the number of solutions to the diophantine equation 7854x + 3315y = 41 and justify
your answer.
(Total 7 marks)

+
32. (a) Define what is meant by the statement x ≡ y (mod n) where x, y, n∈ .
(1)

(b) Hence prove that if x ≡ y (mod n) then x2 ≡ y2 (mod n).

(4)

(c) Determine whether or not x2 ≡ y2 (mod n) implies that x ≡ y (mod n).

(4)
(Total 9 marks)

33. The positive integer N is expressed in base p as (anan–1 ... a1a0)p.

(a) Show that when p = 2, N is even if and only if its least significant digit, a0, is 0.
(5)

(b) Show that when p = 3, N is even if and only if the sum of its digits is even.
(6)
(Total 11 marks)
34. (a) Use the Euclidean Algorithm to find the gcd of 324 and 129.
(3)

(b) Hence show that 324x + 129y = 12 has a solution and find both a particular solution and
the general solution.
(6)

(c) Show that there are no integers x and y such that 82x + 140y = 3.
(2)
(Total 11 marks)

35. (a) The matrix below shows the distances between towns A, B, C, D and E.

(i) Draw the graph, in its planar form, that is represented by the matrix.

(ii) Write down with reasons whether or not it is possible to find an Eulerian trail in
this graph.

(iii) Solve the Chinese postman problem with reference to this graph if A is to be the
starting and finishing point. Write down the walk and determine the length of the
walk.
(9)

(b) Show that a graph cannot have exactly one vertex of odd degree.
(2)
(Total 11 marks)

36. (a) (i) Given that a ≡ d (mod n) and b ≡ c (mod n) prove that

(a + b) ≡ (c + d) (mod n).
 (ii) Hence solve the system

2 x + 5 y ≡ 1(mod 6)

 x + y ≡ 5(mod 6)
(11)

(b) Show that x97 – x + 1 ≡ 0 (mod 97) has no solution.

(3)
(Total 14 marks)

37. (a) (i) Let M be the adjacency matrix of a bipartite graph. Show that the leading diagonal
entries in M37 are all zero.

(ii) What does the (i, j)th element of M + M2 + M3 represent?

(4)

(b) Prove that a graph containing a triangle cannot be bipartite.

(3)

(c) Prove that the number of edges in a bipartite graph with n vertices is less than or equal to
n2
.
4
(5)
(Total 12 marks)

38. Let G be a simple, connected, planar graph.

(a) (i) Show that Euler’s relation f – e + v = 2 is valid for a spanning tree of G.

(ii) By considering the effect of adding an edge on the values of f, e and v show that
Euler’s relation remains true.
(7)
 (b) Show that K5 is not planar.
(5)
(Total 12 marks)

39.The graph G has the following cost adjacency matrix.

(a) Draw G in planar form.

(2)

(b) Use Dijkstra’s Algorithm to find the shortest path between the vertices A and D. Show
all the steps in the algorithm and state the length of the shortest path.
(8)
(Total 10 marks)

+
40. (a) Given that ax ≡ b (mod p) where a, b, p, x∈ , p is prime and a is not a multiple of p,
use Fermat’s little theorem to show that

x ≡ a p−2b (mod p).

(3)

(b) Hence solve the simultaneous linear congruences

3x ≡ 4(mod 5)
5x ≡ 6(mod 7)

giving your answer in the form x ≡ c (mod d).

(8)
(Total 11 marks)

41. (a) Convert the decimal number 51966 to base 16.

(4)
 (b) (i) Using the Euclidean algorithm, find the greatest common divisor, d, of 901 and
612.

(ii) Find integers p and q such that 901p + 612q = d.

(iii) Find the least possible positive integers s and t such that 901s – 612t = 85.
(10)

(c) In each of the following cases find the solutions, if any, of the given linear congruence.

(i) 9x ≡ 3 (mod18);

(ii) 9x ≡ 3 (mod15).
(5)
(Total 19 marks)

42. (a) Use Kruskal’s algorithm to find the minimum spanning tree for the following weighted
graph and state its length.

(5)
 (b) Use Dijkstra’s algorithm to find the shortest path from A to D in the following weighted
graph and state its length.

(7)
(Total 12 marks)

43. (a) Write 457128 as a product of primes.

(4)

n
(b) Numbers of the form Fn = 2 2 + 1, n ∈ are called Fermat numbers.

Find the smallest value of n for which the corresponding Fermat number has more than a
million digits.
(4)

(c) Prove that 22│511 + 1711.

(4)
(Total 12 marks)

44. (a) Write the number 10 201 in base 8.

(4)
 (b) Prove that if a number is divisible by 7 that the sum of its base 8 digits is also divisible
by 7.
(5)

(c) Using the result of part (b), show that the number 10 201 is not divisible by 7.
(2)
(Total 11 marks)

45. Let a and b be two positive integers.

(a) Show that gcd(a,b) × lcm(a,b) = ab

(6)

(b) Show that gcd(a, a + b) = gcd(a, b)

(7)
(Total 13 marks)

46. Find the remainder when 67101 is divided by 65.

(Total 6 marks)

47. Solve the system of linear congruences

x ≡ 1(mod 3); x ≡ 2(mod 5); x ≡ 3(mod 7).

(Total 6 marks)