Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 32 views

    MidSem11 Alt Sol

    Uploaded by

    sacredgames
    This document contains the solutions to an examination in discrete mathematical models. It provides 10 multi-part math problems and their step-by-step solutions. The exam covers topics like logic, sets, functions, number theory, and recurrence relations. It tests skills in areas such as proving statements, finding counterexamples, matrix operations, and induction.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    MidSem11 Alt Sol

    Uploaded by

    sacredgames
    32 views5 pages
    This document contains the solutions to an examination in discrete mathematical models. It provides 10 multi-part math problems and their step-by-step solutions. The exam covers topics like logic, sets, functions, number theory, and recurrence relations. It tests skills in areas such as proving statements, finding counterexamples, matrix operations, and induction.

    Original Description:

    maths

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains the solutions to an examination in discrete mathematical models. It provides 10 multi-part math problems and their step-by-step solutions. The exam covers topics like logic, sets, functions, number theory, and recurrence relations. It tests skills in areas such as proving statements, finding counterexamples, matrix operations, and induction.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    32 views5 pages

    MidSem11 Alt Sol

    Uploaded by

    sacredgames
    This document contains the solutions to an examination in discrete mathematical models. It provides 10 multi-part math problems and their step-by-step solutions. The exam covers topics like logic, sets, functions, number theory, and recurrence relations. It tests skills in areas such as proving statements, finding counterexamples, matrix operations, and induction.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 5

    THE AUSTRALIAN NATIONAL UNIVERSITY Mid-Semester Examination Second Semester 2011 Make-up version 1: solutions DISCRETE MATHEMATICAL MODELS

    (MATH1005)
    Writing period: 2 Hours duration Study period: 15 Minutes duration No permitted material. Calculators are not allowed.

    Notes to candidates : Begin each question on a new page and label it clearly. All questions are to be completed in the script book provided, and not on the examination paper. The maximum grade obtainable for each question is 2.5. The maximum grade obtainable for the exam is 30.

    Page 1 of 5 - Discrete Mathematical Models - (MATH1005)

    1. Negate the following statement: n N\{1, 2} x, y, z N xn + y n = z n . (n N\{1, 2} x, y, z N xn +y n = z n ) (n N\{1, 2} x, y, z N xn +y n = z n ). 2. Let p, q, r be statements. Prove the following logical equivalence, then draw the corresponding electronic circuit. (p q ) (p q r) p (q r). p 0 0 0 0 1 1 1 1 (b) r q p q 0 0 1 1 0 0 1 1 r p q q p q p q r q r (p q ) (p q r) p (q r) 0 0 1 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 1 0 0 0 0 1 1 0 0 0 0 1 0 1 1 1 1 1 1 0 1 0 0 0 1 1 1 1 1 0 0 0 1 1 1

    3. Let A be a nite set. Prove that P (A {0}) = {} {T {0} ; T A , T = }. Let S P (A {0}) be non-empty. Dene T = {a A ; (a, 0) S }. Then, for x = (a, 0) A {0} x T {0} a T x S. So S {T {0} ; T A , T = }. This proves that P (A {0}) {} {T {0} ; T A , T = }. Now let T A. Then T {0} = {(a, 0) A {0} ; a T } A {0}. 4. Let A, B, C be subsets of a universe of discourse U . Find a counterexample to A Bc C = A B C c. Page 2 of 5 - Discrete Mathematical Models - (MATH1005)

    Take A = {1}, B = , C = {1, 2}, U = {1, 2, 3}. Then A B c C = {1} and A B C c = .

    5. Let U be a non-empty nite set of nite sets. Dene R U U by ARB P (A) P (B ). Prove that R is a partial order relation. Let A U . P (A) = P (A), so ARA. Therefore R is reexive. Let A, B U and assume that ARB and BRA, i.e. P (A) P (B ) and P (B ) P (A). Then P (A) = P (B ). Since A P (A) = P (B ), we have A B . Similarly B A. Therefore B = A. This proves that R is antisymmetric. Let A, B, C U , and assume that ARB and BRC . Then P (A) P (B ) P (C ). So P (A) P (C ), and thus ARC . This proves that R is transitive. The relation R is thus a partial order relation. 6. Let F Z Z3 be dened by xF y x y (mod 3). (a) Prove that F is a function. (b) Determine whether or not F is onto. (c) Determine whether or not F is one-to-one. (a) Let x Z. There exists q Z and y Z3 such that x = 3q + y , by the division algorithm. Therefore x y (mod 3), i.e. xF y . Now, let x Z and y, z Z3 be such that xF y and xF z . Then x y (mod 3) = z (mod 3), so x = z . The relation F is thus a function. (b) We have F (1) = 1, F (2) = 2, and F (3) = 3, so y Z3 x Z F (x) = y,

    i.e F is onto. (c) We have 4 = 1 + 3 1 (mod 3), so F (4) = 1 = F (1). Therefore F is not one-to-one. 7. (a) Compute A116 1316 . (b) Write AE 316 in base 2. (c) Write 7 as four binary digits, using the usual encoding of Z.

    Page 3 of 5 - Discrete Mathematical Models - (MATH1005)

    (a) A116 1316 = 1E 316 + A1016 = BF 316 . (b) AE 316 = 1010111000112 . (c) 7 = 1112 = (01102 + 00012 ). Therefore 7 is encoded as 11001. 8. (a) Compute 643 327 (mod 5). (b) Find a number x Z such that x 26 and xd x (mod 11) for all d N. (a) 643 327 (mod 5) = 3 6 (mod 5) = 1 (mod 5). (b) We want xd1 1 (mod 11). 34 1 (mod 11) so 34d1 1d1 (mod 11) = 1 (mod 11).

    9. Let (xn )nN Q be such that xn+1 = x2 n x0 = 2.


    n

    n N {0},

    Prove that xn = 22 n N. n 21 Let P (n) : xn = 22 . We have x1 = x2 0 = 4 = 2 , so P (1) holds. Let k N and assume P (1) P (2) ... P (k ). 2k 2 Then xk+1 = x2 k = (2 ) , since P (k ) holds. k k+1 Therefore xk = 222 = 22 , i.e. P (k + 1) holds. n By induction, this gives xn = 22 n N {0}.

    10. Let (xn )nN R be such that xn+2 4xn+1 + xn = 0 n N {0}, x0 = 2, x1 = 2 3. Prove that xn = (2 + 3)n (2 3)n n N. Let P (n) : xn = (2 + 3)n (2 3)n . We have x1 = 2 3 = (2 + 3)1 (2 3)1 . Let k N and assume P (1) P (2) ). k... P (k Then xk+1 = 4xk xk1 = 4(2 + 3) (2 3)k (2 + 3)k1 + (2 3)k1 , since P (k ) and P (k 1) hold. Therefore xk+1 = (2+ 3)k1 (4(2+ 3)1)(2 3)k1 (4(2 3)1) = (2+ 3)k1 (7+4 3)(2 3)k1 (74 3). Page 4 of 5 - Discrete Mathematical Models - (MATH1005)

    2 2 Now remark that (2 + 3) = 7 + 4 3 and (2 3) = 7 4 3. This implies that k+1 k+1 (2 3) , i.e. P (k + 1) xk+1 = (2 + 3) holds. n By induction, this gives xn = (2 + 3) (2 3)n n N. 11. Let (x, y ) Q2 . Compute 1 2 2 1 1 2 2 1 12. 2 2 2 3
    3

    x y =

    . 13 14 14 13 x y = 13x + 14y 14x + 13y .

    x y

    5 4 4 5

    1 2 2 1

    x y

    (a) Prove that A = (b) Compute A1 .

    is invertible.

    2 2 0 a b 0 (c) Find an inverse to 2 3 0 of the form c d 0 . 0 0 1 0 0 1 (a) det(A) = 6 4 = 2 = 0. Therefore A is invertible. (b) 1 3 2 A1 = 2 2 2 (c) 3 2 1 2 2 2 0 0 3 2 1 2 2 =2 0 0 1 0 0 0 2 2 0 0 2 3 0 = 0 1 0 , 0 0 1 2 0 0 1 0 0 . 2

    1 2 2 0 so 2 3 0 0 0 1

    Page 5 of 5 - Discrete Mathematical Models - (MATH1005)

    You might also like