You are on page 1of 4

First Name: _____________________

Family Name: ___________________

Student Number: _________________

Class/Tutorial: ___________________

WOLLONGONG COLLEGE AUSTRALIA

A College of the University of Wollongong

Diploma in Information Technology

Mid-Session Examination 2
Spring Session 2008

WUCT121
Discrete Mathematics

This exam represents 10% of the total subject marks

Reading Time: 5 minutes


Time allowed: 50 minutes

DIRECTIONS TO CANDIDATES
Refer to Page 2

ITC Education Ltd trading as


Wollongong College Australia
CRICOS 02723D
ABN 14105312329

WCA-WUCT121-EXSMS2 Page 1 of 4
DIRECTIONS TO CANDIDATES

1. Total number of questions: 3

2. All questions are to be attempted.

3. Marks are allocated for working out.

4. All answers must be written in the exam booklet.

5. You may answer the questions in any sequence.

6. Only non-programmable calculators are allowed.

WCA-WUCT121-EXSMS2 Page 2 of 4
START OF EXAM
Question 1 (14 marks) Marks
(a) Prove that for all integers a, b and c, if a | b and b | c , then a | c . 3
(b) (i) Use the Euclidean algorithm to calculate the greatest common divisor of 3
2047 and 391.
(ii) Find integers m and n such that gcd(2047, 391) = 2047 m + 391n . 3

(c) Use symbols to write the logical form of the argument below. If the argument is
valid, give the name of the rule of logic that is used.

If today is Thursday, then David will go to class.

Today is Thursday.
3
Therefore David will go to class.
(d) Consider the statement If n 2 + 1 is odd, then n is even.

Explain why the following proof of this statement is completely invalid?


If n is even, then n = 2 p for some p , and so n 2 + 1 = 4 p 2 + 1 , which is odd.
2
Therefore, if n 2 + 1 is odd, then n is even.

Question 2 (13 marks)


(a) A student wishes to use Mathematical Induction to prove the following:
1 1 1 1 n
+ + + LL + = , "n .
1 3 3 5 5 7 (2n 1)(2n + 1) 2n + 1
2
Write down the assumption (CLAIM(k)) the student would need to use.
Note: You do not need to give the full proof.
(b) A sequence a1 , a 2 , a3 ,K is defined as follows:
a1 = 2
a2 = 4
a k = 5a k 1 6a k 2 , for all integers k 3
5
Use the Strong Principle of Mathematical Induction to prove that a n = 2 n for all
integers n 1 .
(c) Prove or disprove the following:

(i) There is no smallest real number. 2

(ii) If x = 1, 3 or 1 , then x 3 3 x 2 x = 3 . 2

(iii) "x , 97 x is a natural number. 2

WCA-WUCT121-EXSMS2 Page 3 of 4
Question 3 (13 marks) Marks

(a) (i) Prove that the sum of an even integer and an odd integer is always odd. 3

(ii) Use the Pigeonhole Principle to prove that if 6 integers are chosen from the
integers 1 through to 10, the sum of at least two of them is odd. 3

(b) (i) Define a composite integer. 2


(ii) Prove or disprove that for all integers n > 2 , n 2 4 is composite. 2

(c) Use proof by contradiction to show that the product of any non-zero rational
number and any irrational number is irrational. 3

END OF EXAM

WCA-WUCT121-EXSMS2 Page 4 of 4