THE UNIVERSITY OF NEW SOUTH WALES

SCHOOL OF MATHEMATICS AND STATISTICS

Semester 1 2016

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

MAYBE USED

All answers must be written in ink. Except where they are expressly required pencils
may only be used for drawing, sketching or graphical work.
Semester 1 2016 IVIATH1081 Page 2

Use a separate book clearly marked Question 1

1. i) Let A= {2, 4, 6, 8} and B = {1, 2, 3, 4, 5}. State

a) P(A-B);
b) IA Bl;
X
c) IP(A U B)l -

ii) Let A, B, and C be sets. Prove that if A-B ~ C and AnB ~ C,

then A ~ C . Be sure to set out your argument clearly and logically.

iii) Let f, g : JR--+ JR be functions given by

)y <0
f(x) = (x -1) 2 and
) y ~ 0.

a) State range(g) .
b) Show that g o f = LJR , where LJR is the identity function on JR .
c) Determine f o g .
d) Hence, or otherwise, explain why f and g are not inverses of each
other.

iv) Let S = {z E C : Re(z) ~ 0 and Im(z) ~ O} be a set of complex

numbers and define a relation :::S on S by

z :::S w ~ lzl::; lwl and Arg(z)::; Arg(w).

a) Prove that :::S is a partial order on S .

b) Define a relation R on S by

zRw ~ !zl::; !wl.

Show that R is not a partial order on S .

v) Suppose k > 1. Using the formula

3 1 1
-----
(k-1)(k+2) k-1 k+2'
or otherwise, evaluate
n 3
~ (k - l)(k + 2) .

Please see over ...

Semester 1 2016 MATH1081 Page 3

Use a separate book clearly marked Question 2

2. i) Evaluate
2016 1081 (mod 17).
ii) a) Find gcd(133, 98) .
b) Find one pair of integers x, y satisfying the equation

98x + 133y = 14
c) Solve, or explain why there is no solution to:
a) 98x - 15 (mod 133)
f3) 98x - 14 (mod 133) .

iii) Consider the following graphs G 1 and G2 .

T
A B
u w

X z

a) Prove that G1 contains an Euler path.

b) Find a Hamilton circuit in G2 .

iv) Recall that Qn is the n -cube graph where n 2". 1.

a) State the number of vertices in Qn.
b) Find, giving brief reasons, the number of edges of Qn.
c) Determine the number of cycles of length 4 that Qn contains.

Please see over ...

SemesteT 1 2016 MATH1081 Page 4

v) Consider the following weighted graph:

A 1 B 6 C

2
5 2 2

D 1 E 3 F

a) Use Dijkstra's algorithm to find a spanning tree that gives the short-
est paths from A to every other vertex of the graph. Make a table
showing the details of at least the first three steps in your application
of the algorithm.
b) Is the spanning tree found in part a) a minimal spanning tree?
Explain your answer.

Please see over ...

Semester 1 2016 MATH1081 Page 5

Use a separate book clearly marked Question 3

3. i) Construct a truth table for

(p/\q) ~ (q~p).
Is this a tautology, contradiction or contingency? Give reasons.
ii) Suppose you have a complete truth table for n propositions P1, p2 , ..• , Pn·
In how many of the 2n lines of this table is p 1 ~ Pn true?
iii) Consider the following argument:
I will have a good holiday only if I have both time and money. (1)
If I work, then I will have no time. (2)
If I do not work, then I will have no money. (3)
Therefore, I will not have a good holiday. (4)
a) Express this argument in symbolic logical form using the labels:
g = "l will have a good holiday"
t = "l have time"
m = "I have money"
w = "l work".
b) Show that the argument is logically valid, giving reasons for each
step.
iv) A function f defined on the open interval D = (a, b) is called
uniformly continuous on D if and only if
Vc>O 36>0 \/xoED \Ix ED: Jx-xol<o ~ IJ(x)-J(xo)l<E.
Write down the negation of this definition, simplified so that it does not
contain the "not" symbol.
v) A sequence is defined recursively by
an = an-l + an-2 + an-3 for n 2". 3, ao = 1, a1 = 2, a2 = 4.
Prove by (extended) induction, that
an~ 4n for all n EN.
vi) You are given a theorem, together with the basic ideas needed to prove it.
Write up a detailed proof of the theorem. Your answer must be written in
complete sentences, with correct spelling and grammar. It must include
a suitable introduction and conclusion; reasons for all statements made;
correct logical flow; and any necessary algebraic details.

Theorem: If p and q are distict primes, then ffe is irrational.

Basic ideas: If ffe = i
with gcd (a, b) = 1 , then pqb2 = a 2 , hence
Pia and pJb, contradiction.
Note that you may assume the result "if pJn2 , then pJn ".

Please see over

Semester 1 2016 MATH1081 Page 6

Use a separate book clearly marked Question 4

In this question you may leave your answers in terms of powers,

factorials and P and C notation.

4. i) When (a+ 2b + 3c) 2016 is expanded and like terms collected, what
is the coefficient of a 671 b672 c673 ?
ii) Find the general solution of the recurrence relation

iii) A hand of 10 cards is dealt from a standard pack of 52 cards.

a) Find the probability that the hand contains exactly 3 cards of the
same value and the remaining 7 cards are from the remaining suit
(for example: v5, <)5, •5, and 7 clubs not including 4'5 ).
b) How many hands are there that contain exactly 3 cards in at least
one suit?
iv) Suppose that 26 integers are chosen from the set S = {1, 2, ... , 50}.
By writing these numbers as 2km with m odd, prove that one of the
chosen numbers is a multiple of another of the chosen numbers.
v) Consider the equation

where x 1 , x 2 , x 3 , x 4 are non-negative integers. How many solutions

are there with all xi satisfying 0 ~ xi ~ 20 ?
vi) Consider the 10 letter word PARRAMATTA and all the words formed
by rearranging its letters. How many of these words contain the subword
MAP but do not contain the subword RAT ?