UECM1303 DISCRETE MATHEMATICS WITH APPLICATIONS ANSWER 4 1. (i) Not necessarily.

(ii) Yes (iii) Yes (iv) Yes 2. 3. 6. 7. (i) (i) For example, let m = 2 and n = 2 Then 1/m + 1/n = + = 1. For example, let a = 2 and b = 1. Then a < b (because 2 < 1) but a2 = 4 > 1 = b2 .

Negation: For all integers n, 6n2 + 27 is not prime. (i) (ii) (iii) (iv) (i) (ii) (i) (ii) (i) (ii) (iii) (iv) Yes. (i) (ii) (i) (ii) (iii) (i) (ii) (iii) (i) (ii) (iii) (iv) (v) (vi) For all integers x with x 4, 2x2 5x + 2 is not prime. Proof of the negation: Suppose x is any integer with x 4. False. True. True. Yes Yes Yes True. True. False. False. True. False. 1 True. False. True. False. 123456/100000 23/99. Yes Yes False. True. True. True.

8. 9. 10.

11. 12. 13.

14.

16.

UECM1303 DISCRETE MATHEMATICS WITH APPLICATIONS 17. (i) (ii) (iii) (iv) (v) (vi) (i) 23 3 72 32 72 13 3 52 72 2 5 7 19 211 is a prime. 39 Because 12a = 25b, the unique factorization theorem guarantees that the standard factored forms of 12a and 25b must be the same. Thus 25b contains the factors 22 3 (= 12). But since neither 2 nor 3 divide 25, the factor 22 3 must all occur in b, and hence 12 | b. Similarly, 12a contains the factors 52 = 25 and since 5 is not a factor of 12, the factors 52 must occur in a. So 25 | a. Yes, use similar argument as (i)

18.

(ii) 19. 20. 21.

15! = 211 36 53 72 11 13 No. Each number is divisible by 3, and so their sum is also divisible by 3. But 100 is not divisible by 3. Thus the sum cannot equal 100. (a) (b)
(i) (i) (iii)
e e a = p1e1 p 22 ... p k k n = 2 3 7 = 42

22. 23. 24. 25. 26. 28. 29.

q = 0, r = 36. 7 7

(ii) (ii) (iv)

q = 4, r = 5. 5 0

Thursday. The remainder obtained when 5a is divided by 7 is 6. The remainder obtained when 15a is divided by 15 is 0. From Q26, n = 3q, or n = 3q + 1 or n = 3q + 2 for some integer q. n2 = (3 cases) (i) No. Counterexample: (ii) Let r = m mod d = n mod d. By definition of mod, 37, 38 15, 14 (ii) (iv) 4, 5 7, 6

30.

(i) (iii)

UECM1303 DISCRETE MATHEMATICS WITH APPLICATIONS 31. 259 div 11 = 23 259 d 11 = 6

32. k = k because k + 1 / 2 = k + 1 because . 33. Let n be an even integer. Then . Then n / 2 = . (i) (ii) False. Counterexample: True. Let m = x . By definition of floor, False. Counterexample: False. Counterexample:

34.

(iii) (iv)

(v) True. Let x be a real number. Let x + 1 = n, say. By definition of ceiling, (vi) 35. False. Counterexample:

Let n and n + 1 be two consecutive integers. By the quotient-remainder theorem with d = 3, n = 3q, or n = 3q + 1 or n = 3q + 2 for some integer q. If n = 3q for some integer q, then If n = 3q +1 for some integer q, then If n = 3q + 2 for some integer q, then

36.

Let the 3 consecutive integers be a, a + 1 and a + 2. Then by quotient-remainder theorem with d = 3, a = 3k or a = 3k + 1 or a = 3k + 2 for some integer k. If a = 3k, . If a = 3k + 1, If a = 3k + 2, Hence Case 1: a = 3q. Case 2: a = 3q + 1. Case 3: a = 3q + 2. 3

37.

UECM1303 DISCRETE MATHEMATICS WITH APPLICATIONS 38. Similar to 36

39. (i) (ii) (iii) If n is even, then n = If n is odd, then n = n is odd implies that n = Case 1: n = 3q. Case 2: n = 3q + 1. Case 3: n = 3q + 2. Suppose the statement is false. Then its negation is true. The negation is : There is an integer n such that 3n + 2 is divisible by 3. Suppose the statement is false. Then its negation is true. The negation is : There is an integer m such that 7m + 4 is divisible by 7. Suppose not. The negation is : There is a greatest even integer. Let N be the greatest even integer. Then N is an even integer and N n for every even integer n. Let M = N + 2. Then M is an even integer since it is a sum of even integers and M > N. A contradiction. Suppose not. That is, suppose there are real numbers x and y such that x is irrational, y is rational and x y is rational. By definition of rational, y = a/b and x y = c/d for some integers a, b, c, d with b 0 and d 0. Then Suppose not. That is, there exists an integer n such that 4 divides n2 2. By definition of divisibility, n2 2 = 4k for some integer k. Then n2 = Suppose r and s are positive real numbers and r 10 and s 10. By algebra, rs 100. Suppose a and b are two particular real numbers such that a 25 and b 25. Then a + b 25 + 25 = 50. By Contradiction: Suppose there exists an integer n such that n2 is odd and n is not odd. Then n is By contraposition: Suppose n is an integer which is not odd. Then n 4

40.

(i)

(ii) (iii)

(iv)

(v)

41.

(i) (ii)

42.

(i)

UECM1303 DISCRETE MATHEMATICS WITH APPLICATIONS (ii) By contradiction: Suppose there exist integers a, b and c such that a does not divide bc but a divide b. By definition of divisibility, b =
By contraposition: Let a, b and c be integers such that a divides b. By definition of divisibility, b = . 43. (i) True. Proof by contradiction: Suppose not, that is, 6 7 2 is rational. By definition of rational, 67 2 = True. Proof by contradiction: Suppose not, that is, 3 2 7 is rational. By definition of rational, 3 2 7 = False. Counterexample: False. Counterexample: False. Counterexample: 2 + 3 is rational. By definition of rational, 2+ 3

(ii)

(iii)

(iv) (v)

44. 45. 46. 48. 49. 51. 52. 53.

Suppose not. Suppose =

Suppose not, that is, suppose there is a least positive rational number, say, r. Suppose that log2 5 is a rational number. Then log2 5 = ZKHUH IN (a) (b) THE 9 3 VKDOO ZH PHHW

CAFTERIA

gcd(4158, 1568) = 14 = 61(1568) + (23)(4158) (a) (b) 6 is an inverse for 210 modulo 13. 7 is a positive inverse for 210 modulo 13. 5

UECM1303 DISCRETE MATHEMATICS WITH APPLICATIONS

54. 04 15 I 55. 56. 57. (ii) (iii) (a) (b) 91 63 the encrypted message is 233 129 048 128. The decrypted message is COOL. T 14 15 20 S T Y 07 15 L T

x 53 (mod 60)