Scribd Logo
Upload

Welcome to Scribd!

  • 38 views

    Discrete Math

    Uploaded by

    wafi al
    The document contains 5 questions regarding logic and proofs: 1. It analyzes the logical relationships between statements involving variables x, y, and xy=0. 2. It proves the logical equivalence of two conditional statements using a truth table. 3. It provides direct and indirect proofs of statements involving odd and even numbers. 4. It evaluates quantified statements for truth value and provides examples or counterexamples. 5. It presents several conditional statements and their converse, contrapositive, and inverse forms to determine logical validity.

    Copyright:

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

    Discrete Math

    Uploaded by

    wafi al
    38 views2 pages
    The document contains 5 questions regarding logic and proofs: 1. It analyzes the logical relationships between statements involving variables x, y, and xy=0. 2. It proves the logical equivalence of two conditional statements using a truth table. 3. It provides direct and indirect proofs of statements involving odd and even numbers. 4. It evaluates quantified statements for truth value and provides examples or counterexamples. 5. It presents several conditional statements and their converse, contrapositive, and inverse forms to determine logical validity.

    Original Title

    DISCRETE MATH

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains 5 questions regarding logic and proofs: 1. It analyzes the logical relationships between statements involving variables x, y, and xy=0. 2. It proves the logical equivalence of two conditional statements using a truth table. 3. It provides direct and indirect proofs of statements involving odd and even numbers. 4. It evaluates quantified statements for truth value and provides examples or counterexamples. 5. It presents several conditional statements and their converse, contrapositive, and inverse forms to determine logical validity.

    Copyright:

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

    Discrete Math

    Uploaded by

    wafi al
    The document contains 5 questions regarding logic and proofs: 1. It analyzes the logical relationships between statements involving variables x, y, and xy=0. 2. It proves the logical equivalence of two conditional statements using a truth table. 3. It provides direct and indirect proofs of statements involving odd and even numbers. 4. It evaluates quantified statements for truth value and provides examples or counterexamples. 5. It presents several conditional statements and their converse, contrapositive, and inverse forms to determine logical validity.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 2

    1

    Discrete Math

    Q1. Let A: “xy = 0”, B: “x = 0”, and C: “y = 0”. Then, the original statement can be written as

    A ⇒ (B & C). This statement is false, since xy = 0 is true even if only x or y equals 0.

    Statement Description Formula Truth value


    Original If xy = 0 then x = 0 and y = 0 A ⇒ (B & C) F
    Converse If x = 0 and y = 0 then xy = 0 (B & C) ⇒ A T
    Inverse If not xy = 0 then not (x = 0 and y = 0) ¬A ⇒ ¬(B & C) T
    Contrapositive If not (x = 0 and y = 0) then not xy = 0 ¬(B & C) ⇒ ¬A F

    Q2. a) In the truth table below, the columns for (p ∧ ¬r) → ¬q and p → (q → r) are

    equivalent, therefore (p ∧ ¬r) → ¬q ≡ p → (q → r).

    p q r ¬r p∧ ¬q (p ∧ ¬r) → q → r p → (q → r)
    ¬r ¬q
    F F F T F T T T T
    F F T F F T T T T
    F T F T F F T F T
    F T T F F F T T T
    T F F T T T T T T
    T F T F F T T T T
    T T F T T F F F F
    T T T F F F T T T

    b) (p ∧ ¬r) → ¬q ≡ ¬(p ∧ ¬r) ∨ ¬q ≡ ¬p ∨ r ∨ ¬q ≡ p → (r ∨ ¬q) ≡ p → (q → r).

    Q3. a) Direct proof. If x is odd and y is even, then x = 2m + 1 and y = 2n for some integers m

    and n. Now x + y = 2m + 1 + 2n = 2(m + n) + 1. Therefore, x + y is odd.

    b) Disproof by example. Let x = –2 and y = –1. Then x < y, but x2 = 4 > 1 = y2. So, the

    statement “If x < y then x2 < y2” is not true.

    c) Proof by contrapositive. Suppose n is even, then 3n is also even and 3n + 11 is odd. Since

    the statement “If n is even then 3n + 11 is odd” is true, then its contrapositive “If 3n + 11 is

    even then n is odd” must also be true.


    2

    Q4.

    Statement Truth value Proof


    ∃x∃y p(x, y) T Example: x = 1, y = 2.
    ∃y∀x p(x, y) T Example: y = 1.
    ∀x∀y p(x, y) F Counterexample: x = 2, y = 3.
    ∀x∃y p(x, y) T Equivalent to ∃y∀x p(x, y).
    ∀y∃x p(x, y) T Example: x = 1.

    ∀p (t(p) ∨ c(p)). For any proposition p, it is either a tautology or a contradiction.

    (∀p t(p)) ∨ (∀p c(p)). Either all propositions are tautologies or all propositions are

    contradictions.

    ∃p (t(p) ∨ c(p)). There is a proposition p, such that it is either a tautology or a contradiction.

    Q5. (p ∧ q) → p, p ∧ (p → r) → r.

    w → ¬q ≡ q → ¬w, (w ∨ s) → (¬w → s).

    (q → ¬w) ∧ (¬w → s) → (q → s), q ∧ (q → s) → s.

    ((p ∧ q) ∧ (p → r) ∧ (q → s)) → (r → s).

    If n > 1, then n2 > 1. Suppose that n2 > 1. Then n > 1. Converse. False.

    If n > 2, then n2 > 4. Suppose that n2 ≤ 4. Then n ≤ 2. Contrapositive. True.

    If n > 3, then n2 > 9. Suppose that n ≤ 3. Then n2 ≤ 9. Inverse. False.

    You might also like