Solu�ons

Ques�on 1

1.1 A sequence is a function whose domain is either all the integers between
two given integers or all the integers greater than or equal to a given integer.
[2]
1.2

𝑎𝑎𝑛𝑛 =
2𝑛𝑛
= 1, 2, 4, 8
[1]
2

1.3.

𝑎𝑎𝑛𝑛 =
𝑛𝑛−1
(−1)𝑛𝑛−1 � � for every integer 𝑛𝑛 ≥ 1
[3]
𝑛𝑛

1.4

𝑘𝑘 𝑘𝑘+1 𝑘𝑘 𝑘𝑘+1 𝑘𝑘
�∏𝑛𝑛𝑘𝑘=1 𝑘𝑘+1� ∙ �∏𝑛𝑛𝑘𝑘=1 𝑘𝑘+2�= ∏𝑛𝑛𝑘𝑘=1 �𝑘𝑘+1� �𝑘𝑘+2�= ∏𝑛𝑛𝑘𝑘=1 �𝑘𝑘+2�. [4]
Question 2

2.1
[8]
2.2

a) Base case: If n=1,

9𝑛𝑛 − 1 = 91 − 1 = 9 − 1 = 8

b) Inductive hypothesis:
Assume that 9𝑘𝑘 − 1 is divisible by 8.
𝑘𝑘++1
[6]
c) Inductive step: Show that 9 − 1 is divisible by 8.

We know that 9𝑘𝑘 − 1 is divisible by 8, then 8m = 9𝑘𝑘 − 1 for some integer

m.

9𝑘𝑘+1 − 1 = 9(9𝑘𝑘 − 1) + 8
= 9(8𝑚𝑚) + 8
= 8(9𝑚𝑚 + 1), 𝑤𝑤ℎ𝑖𝑖𝑖𝑖ℎ 𝑖𝑖𝑖𝑖 𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑𝑑 𝑏𝑏𝑏𝑏 8.
2.3

[6]
Solutions:

Question 3

3.1

𝑉(𝐺) = {𝑣1 , 𝑣2 , 𝑣3 , 𝑣4 }

𝐸(𝐺) = {𝑒1 , 𝑒2 , 𝑒3 , 𝑒4 , 𝑒5 }

Edge Endpoint
𝑒1 {𝑣1 , 𝑣2 }
𝑒2 {𝑣2 , 𝑣3 } [4 ]
𝑒3 {𝑣2 , 𝑣3 }
𝑒4 {𝑣2 , 𝑣3 }
𝑒5 {𝑣4 }

3.2 (a) 𝑒2 , 𝑒3 , 𝑒6 , 𝑒4 , 𝑎𝑛𝑑 𝑒5 are incident on 𝑣2 

(b) total degree of the graph = 14 [6]

(c) 𝑒1 , 𝑒3 , 𝑒6 , 𝑎𝑛𝑑 𝑒7 are adjacent to 𝑒2 

Question 4

4.1

 [5]

4.2 The graph 𝐺 is connected if, and only if , given any two vertices 𝑣 and 𝑤 in 𝐺 there is a walk from
𝑣 to 𝑤. 

4.3 {𝑣1 , 𝑣2 }, {𝑣3 , 𝑣4 }, 𝑎𝑛𝑑 {𝑣8 , 𝑣7 } [5]