UNIVERSITY EXAMINATIONS UNIVERSITEITSEKSAMENS. UNISA [fee MAT2612 May/Jun 2015, INTRODUCTION TO DISCRETE MATHEMATICS Duration : 2 Hours 100 Marks EXAMINERS: FIRST: PROF SA VAN AARDT SECOND: PROF Y HARDY (Closed book examination. ‘This examination paper remains the property of the University of South Africa ‘and may not be removed from the examination venue. ‘Thus paper consists of 4 pages ANSWER ALL THE QUESTIONS. ‘THE USE OF A POCKET CALCULATOR IS NOT PERMITTED. Since calculators are not allowed, you may leave your answers as expressions involving per- mutations and combinations, where necessary. 1. Use mathematical induction to show that nt —5n45 w odd for all n EN, n 21 fl 2. There are 30 pupils in a class. {@) You make a row of 7 children. In how many ways can ths be done? @) (b) You divide the class into two groups of 15 each In how many ways can this be done? (3) (©) You give each of the 30 pupils one of 5 types of cooldrink In how many ways can this be done? @) (@) Ignoring who gets which cookinnk, how many different cooldrink combinations are possible if ‘you choose 30 cooldrink from 5 types? @) (22) [TURN OVER]2 MAT 2612 MAY/JUN 2015 3. Consider the strings of length 10 of the letters {a,,c, d} (a) How many such strings contain exactly 2 b's and 3 c's? (5) (b) What 1s the probabshty that such a stimg contains 7 a’s, one 6, one ¢ and one d? ©) fo} 4 How many ways can you choose 10 people from 14 men and 16 women if you must choose at least 3 ‘women? (5) o Use the pigeonhole principle to show that in any arrangement of the numbers {1.2,3.4,5.6,7.8,9.10} around a aarele, there will be some 3 adjacent numbers with sum at least 17 ‘Hint: Start anywhere in on the circle and name the numbers around the exrcle. say a1 az. ,a19 m a clockwise position We are mterested in the sum of 3 adjacent numbers on the cle, ue the sums Siar +agt+ag, Sp=agt+agtas, —, Sp = ag -+ay+019, Sy = Agta +a1, Sig = a 0+4; +02 Note that the sum of the above is 7 Ys, = 165. a (@] 6 Let A= [1,2,3 4,5.6,7,8,9} and define the relation R on A by ‘afb if and only f a and 6 have the saine number of divisors For example, 29 since 2 and 3 have two divisors each ({1,2} and {1,3} respectively) (a) Determune the matrix Mp of R @ (b) Diaw the directed graph of (A, R) “ (c) Give the i-degree and out-degree of 9 @ (4) State, giving reasons, whether the relation Fs (i) reflexave @ (n) irefieave @) (u) symmetne @ (iv) antisymmetric @ (v) transitive @) ‘You may use the definition of R and/or the matrxx Mp to answer (4) (©) Use you answers in (d) to decide whether R 1s () a partial onde: @ {n) an equivalence relation @ fea} [TURN OVER]3 MAT 2612 MAY/JUN 2015 7 (a) Suppose f and g are functions whose domams are subsets of Z*, the set of positive mtegers Give the defimtion of “fis Og)" @ (b) Use the definition of “f 15 O(g)” to show that dn? + 7n +118 O(n?) @ {8} 8 Consider the poset (A, R) represented by the following Hasse diagrarm ’ 4 e A ‘ » 2 Give each of the following If any do not exist, explain clearly why (@) The greatest clement of (4, R) (b) The least element of (4, F) (©) All upper bounds of {4,2} (@) The least upper bound (LUB) of {h,1} (€) All lower bounds of {a,c} (f) The greatest lower bound (GLB) of {a.c} (@) Any two elements which are compleinents of each other faa] 9 Consider the partially ordered set (A, R) represented by the Hasse diagram below » < . . ¥ (@) Is (A,B) 9 lattice? Justify your answer @) (b) Is (4.8) @ complemented lattice” Explain fully @) (©) 15 (4,R) a Boolean algebra? Explain fully @) (9 [TURN OVER]