UNSW

llllllllllllllllllllllllllllllllllllllllllllllllllllll lllllllll
>014465990

THE UNIVERSITY OF NEW SOUTH WALES

SCHOOL OF MATHEMATICS AND STATISTICS

NOVEMBER 2012

MATH1081
DISCRETE MATHEMATICS

(1) TIME ALLOWED - Two (2) hours

(2) TOTAL NUMBER OF QUESTIONS - 4
(3) ANSWER ALL QUESTIONS
(4) THE QUESTIONS ARE OF EQUAL VALUE

(5) ANSWER EACH QUESTION IN A SEPARATE BOOK

(6) THIS PAPER MAY BE RETAINED BY THE CANDIDATE
(7) ONLY CALCULATORS WITH AN AFFIXED "UNSW APPROVED" STICKER
MAY BE USED

All answers must be v-rritten in ink. Except where they are expressly required pencils
may only be used for drawing, sketching or graphical work.
NOVEMBER 2012 MATH1081 Page 2

Use a separate book clearly marked Question 1

1. i) Use the laws of set algebra to simplify (A - B) U (An B) .

ii) Find an example to show that the equality

An (Bu C) = (An B) u C

is not true for all sets A , B , C .

iii) a) Suppose that An is a set for n = 1, 2, ....
Explain briefly the meaning of n00

n=l
An .

b) Find n
00

n=l
[-1/n, 1/n]. Give a brief reason for your answer.

iv) Define a relation ,. . ., on IR by x ,..._, y if and only if there exists k E Z

such that x - y = 2k1r .
a) Show that "" is an equivalence relation.
b) Write IR as the union of pairwise disjoint equivalence classes [x] ,
for x E IR.
c) Find a bijection cp : (IR/ ,. . ., ) -t 11' from the collection (IR/ ,. . ., ) of all
equivalence classes [x] of "" onto the unit circle

11' = {z E C : jzj = 1 }

in C . Show carefully that cp is both injective and surjective.

v) Let A be the poset

{{1},{2},{4},{1,2},{1,4},{3,4},{1,2,4},{1,3,4},{2,3,4},~}.

a) Draw a Hasse diagram for A

b) Find the upper bounds of the set {{ 2}, {4}} in A .
c) Does {{2}, {4}} have a least upper bound in A?

Please see over .. .

NOVEMBER 2012 MATH1081 Page 3

Use a separate book clearly marked Question 2

2. i) a) Find an integer x such that 50x = -1 (mod 101).

b) Find 50- 1 (mod 101 ).
c) Find 2300 (mod 18) .
ii) You are given that 1039-1 = 31 mod 2013. (You are NOT required to
prove this.)
a) Find integers k and f such that 1039k + 2013£ = 1 .
b) Write down the general solution to 1039x + 2013y = 4.
iii) Consider the following graph K.

A B C

D E F
Giving reasons for your answers, show that
a) K is bipartite,
b) K is planar,
c) K has an Euler circuit,
d) K has no Hamiltonian circuit.
iv) a) State Kuratowski's theorem characterising non-planar graphs.
b) Show that the following graph is not planar.
A B

E D

Please see over ...

NOVEMBER 2012 MATH1081 Page 4

v) Use Kruskal's algorithm, to construct a minimal spanning tree for the

following weighted graph. Make a table showing the details of each step
in your application of the algorithm.

b
----------
4 a 5 C

d f
9

g h 4 i

Please see over ...

NOVEMBER 2012 MATH1081 Page 5

Use a separate book clearly marked Question 3

3. i) Construct a truth table to verify the following logical equivalence

(p/\q)-+ r = rv pV (q-+ r).
ii) You are looking for your keys) and you say to yourself...
(1) If I parked the car on the street last night, then my keys are not
in the garage.
(2) If I took the rubbish out last night, then my keys are in the
garage.
(3) If I opened the front door with my keys last night, then my keys
are hanging in the front door.
(4) My keys are locked inside the car or I took the rubbish out last
night.
(5) I parked the car on the street last night.
a) Let
s = "I parked the car on the street last night,,,
r = "I took the rubbish out last night",
o = "I opened the front door with my keys last night,,,
g = "My keys are in the garage)) ,
f = "My keys are hanging in the front door"
c = "My keys are locked inside the car".
Write the propositions (1)-(5) in symbolic form using logical connec-
tives.
b) Deduce where the keys are from (1 )-(5) using rules of inference. Show
your working and give a reason for each step.
iii) Prove that for all integers n ~ 2,

(1-~) (1 -~) ···(1 -~)

22 32 n
= n + l. 2 2n
iv) Let x and y be real numbers. Prove that if x is rational and y is
irrational, then x + y is irrational.
v) A sequence a0, a 1 , a2, ... of real numbers is said to diverge to infinity iff
VM E IR :3 N E N Vn > N an > M.
a) Write in symbolic form the negation of (*) , and simplify your answer
so that the negation symbol is not used.
b) Prove that the sequence defined by

does not diverge to infinity.

Please see over . . .

NOVEMBER 2012 MATH1081 Page 6

Use a separate book clearly marked Question 4

In parts (i) and (ii) of this question you should leave your answers
in terms of powers, factorials and P and C notation.

4. i) How many strings of eight lowercase letters of the English alphabet con-
tain
a) exactly 2 vowels?
b) at least 1 vowel?
c) the letters x and y ) with x occurring before y , if the letters are
all distinct?
ii) How many ways are there to distribute
a) 18 identical lollipops among 4 children, with each child getting at
least one lollipop?
b) 9 different teddy bears among 4 children, with one child getting 3
and the other 3 children getting 2 each?
iii) a) Find the solution of the recurrence

subject to the initial conditions a0 = 1 and a 1 = 7.

b) Find a particular solution of the recurrence

iv) Two types of paving slabs are available for laying a straight path of width
1 unit: the 1-unit by 1-unit slab and the 1-unit by 2-unit slab. No slabs
are to overlap and no gaps are to be left. Here is an example of a path
of length 9 units:

Let Pn be the number of ways to lay a path of width 1 unit and length
n units.
a) Find p 1 , P2 and p3 .
b) Obtain a recurrence relation for Pn. (You do NOT need to solve
this recurrence relation.)