Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    A

    Uploaded by

    narutoshinobilegends
    1. The document contains mathematical equations involving sets, logic, and summations. 2. Steps are shown to simplify and prove the equivalence of complex set equations using set theory rules like distribution, De Morgan's laws, identity, complement, etc. 3. The last equation is simplified to the empty set using steps like absorption, associative, and dominance properties of sets.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    A

    Uploaded by

    narutoshinobilegends
    13 views3 pages
    1. The document contains mathematical equations involving sets, logic, and summations. 2. Steps are shown to simplify and prove the equivalence of complex set equations using set theory rules like distribution, De Morgan's laws, identity, complement, etc. 3. The last equation is simplified to the empty set using steps like absorption, associative, and dominance properties of sets.

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1. The document contains mathematical equations involving sets, logic, and summations. 2. Steps are shown to simplify and prove the equivalence of complex set equations using set theory rules like distribution, De Morgan's laws, identity, complement, etc. 3. The last equation is simplified to the empty set using steps like absorption, associative, and dominance properties of sets.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    13 views3 pages

    A

    Uploaded by

    narutoshinobilegends
    1. The document contains mathematical equations involving sets, logic, and summations. 2. Steps are shown to simplify and prove the equivalence of complex set equations using set theory rules like distribution, De Morgan's laws, identity, complement, etc. 3. The last equation is simplified to the empty set using steps like absorption, associative, and dominance properties of sets.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 3

    Abdullah Shaheen Assignment Three 101100558

    n ≤130 n ≤ 130 n ≤5
    1. ∑ 4 n= ∑ 4 n−∑ 4 n=4 ¿
    n =6 n=1 n=1
    = 4( (130x131)/2 – (5 x 6)/2 )
    = 34000

    n ≤611 n ≤ 101 n ≤29 n≤ 14


    2. ∑ n− ∑ 6 n− ∑ 21 i+ ∑ 42 i
    n=16 n=3 n=1 n=1

    n ≤611 n ≤ 15

    ∑ n− ∑ −6 ¿ ¿
    n=16 n =1

    (611(612))/ 2 – (15(16) )/2 − 6( (101(102)/2) – (2(3)/2) ) – 21( 29(30)/2 ) + 42( 15(14)/2 )

    = 151233

    3. 𝑝 − (q ∩ r)

    p q r q∩r (q ∩ r) 𝑝 − (q ∩ r)

    1 1 1 1 0 1
    1 1 0 0 1 0
    1 0 1 0 1 0
    1 0 0 0 1 0
    0 1 1 1 0 0
    0 1 0 0 1 0
    0 0 1 0 1 0
    0 0 0 0 1 0

    b. (q ∪ r)∪ (𝑞 − 𝑟)

    p q r r q∪r (q ∪ r) (𝑞 − 𝑟) (q ∪ r)∪ (𝑞 − 𝑟)

    1 1 1 0 1 0 0 0
    1 1 0 1 1 0 1 1
    1 0 1 0 1 0 0 0
    1 0 0 1 1 0 0 0
    0 1 1 0 0 1 0 1
    0 1 0 1 1 0 1 1
    Abdullah Shaheen Assignment Three 101100558

    0 0 1 0 0 1 0 1
    0 0 0 1 1 0 0 0

    c. ((𝑞 ∪ 𝑟) − 𝑝) ∪ (𝑝 ∩ 𝑟)

    p q r p q q ∪r (q ∪ r)−p ¿ ∩ 𝑟) ((q ∪ r) − p) ∪ (¿ ∩ r)

    1 1 1 0 0 1 0 0 0
    1 1 0 0 0 0 1 0 1
    1 0 1 0 1 1 0 0 0
    1 0 0 0 1 1 0 0 0
    0 1 1 1 0 0 0 1 1
    0 1 0 1 0 0 0 0 0
    0 0 1 1 1 1 0 1 1
    0 0 0 1 1 1 0 0 0

    d. ((𝑝 ∪ 𝑟) − ((𝑝 ∩ 𝑟) − (𝑞 ∩ 𝑟)))

    p q r r p∪r ¿ ∩ r) (q ∩ r) (p ∩ r ) − (q ∩ r) (p ∪ r) − ((p ∩ r ) − (q ∩ r))

    1 1 1 0 1 0 1 0 1
    1 1 0 1 1 1 0 1 0
    1 0 1 0 1 0 0 0 1
    1 0 0 1 1 1 0 1 0
    0 1 1 0 1 0 1 0 1
    0 1 0 1 0 0 0 0 0
    0 0 1 0 1 0 0 0 1
    0 0 0 1 0 0 0 0 0

    4. ((𝑌 ∪ 𝑍) ∩ ( X ∪ 𝑍)) − (𝑌 ∩ 𝑍)
    X Y Z X Y∪Z ¿∪ 𝑍) 𝑌∩𝑍 ((𝑌 ∪ 𝑍) ∩ ( X ∪ 𝑍)) ((𝑌 ∪ 𝑍) ∩ ( X ∪ 𝑍)) − (𝑌 ∩ 𝑍)

    1 1 1 0 1 1 1 1 0
    1 1 0 0 1 0 0 0 0
    1 0 1 0 1 1 0 1 1
    1 0 0 0 0 0 0 0 0
    0 1 1 1 1 1 1 1 0
    0 1 0 1 1 1 0 1 1
    0 0 1 1 1 1 0 1 1
    0 0 0 1 0 1 0 0 0
    Abdullah Shaheen Assignment Three 101100558

    (𝑍 ∪ (𝑌 ∩ X )) ∩ (((Y ∩ Z)∪ X ¿ ¿∪ ( (Y ∩ Z) ∩ X))

    Let A = (((Y ∩ Z)∪ X ¿ ¿∪ ( (Y ∩ Z) ∩ X))


    Let B = (𝑍 ∪ (𝑌 ∩ X )) ∩ (((Y ∩ Z)∪ X ¿ ¿∪ ( (Y ∩ Z) ∩ X))

    X Y Z X Y (𝑍 ∪ 𝑌 (Y ∩ Z) (Y ∩ Z)∪ X((Y ∩ Z)∪ X ¿ ¿ A B


    ∩ (𝑌 ∩ ∩ (Y ∩ Z)∩ X
    X X )) 𝑍
    1 1 1 0 0 1 1 0 0 1 0 0 0
    1 1 0 0 0 0 0 1 1 1 0 1 0
    1 0 1 0 0 1 0 1 1 1 0 1 1
    1 0 0 0 0 0 0 1 1 1 0 1 0
    0 1 1 1 1 1 1 0 0 1 0 0 0
    0 1 0 1 1 1 0 1 0 0 1 1 1
    0 0 1 1 0 1 0 1 0 0 1 1 1
    0 0 0 1 0 0 0 1 0 0 1 1 0
    Since the final answer is the exactly the same we can say that both equations are equal

    5. (𝑍 ∪ (𝑌 ∩ X )) ∩ ¿ ¿∪ ((Y ∩ Z)∩ X))

    (Z ∪ (Y ∩ X )) ∩ ( ( Y ∩Z ∩ X ) ∪ ( (Y ∩ Z) ∩ X)) by De Morgan’s
    (Z ∪ (Y ∩ X )) ∩ ( (Y ∩ Z)∩ (X ∪ X )) by Distribution
    (Z ∪ (Y ∩ X )) ∩ ( (Y ∩ Z) ∩ U) by Complement
    (Z ∪ (Y ∩ X )) ∩ ( (Y ∩ Z) by Identity
    ((Z ∪ Y ) ∩ (Z ∪ X )) ∩ ( (Y ∩ Z)) by Distributive
    ((Y ∪ Z) ∩ ( Z ∪ X )) ∩ ( (Y ∩ Z))by commutative
    ((Y ∪ Z) ∩ ( Z ∪ X )) − (Y ∩ Z) by Difference Equivalence

    If we simplify one equation, we get the other one, hence both equations are equal

    6. (r ∩ (r ∪ p)) ∩ (r ∪( p ∪q ))
    (r ∩ (r ∪ p)) ∩ (r ∩ (p ∪ q)) by De Morgan’s
    r ∩ (r ∩ (p ∪ q)) by Absorption
    (r ∩ r ) ∩ (p ∪ q) by Associative
    ∅ ∩ (p ∪ q) by Complement
    ∅ by Dominance

    You might also like