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

Welcome to Scribd!

  • 17 views

    Da DMGT

    Uploaded by

    Shaurya 22BAI1173
    This document contains the details of Digital Assignment 1 for the course Discrete Mathematics and Graph Theory. It includes 10 problems covering topics like quantifiers, rules of inference, logical equivalence, tautologies, subgroups, homomorphisms, error correcting codes, permutations, and divisibility. The assignment is due on June 9, 2023.

    Copyright:

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

    Da DMGT

    Uploaded by

    Shaurya 22BAI1173
    17 views2 pages
    This document contains the details of Digital Assignment 1 for the course Discrete Mathematics and Graph Theory. It includes 10 problems covering topics like quantifiers, rules of inference, logical equivalence, tautologies, subgroups, homomorphisms, error correcting codes, permutations, and divisibility. The assignment is due on June 9, 2023.

    Original Title

    DA_DMGT

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains the details of Digital Assignment 1 for the course Discrete Mathematics and Graph Theory. It includes 10 problems covering topics like quantifiers, rules of inference, logical equivalence, tautologies, subgroups, homomorphisms, error correcting codes, permutations, and divisibility. The assignment is due on June 9, 2023.

    Copyright:

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

    Da DMGT

    Uploaded by

    Shaurya 22BAI1173
    This document contains the details of Digital Assignment 1 for the course Discrete Mathematics and Graph Theory. It includes 10 problems covering topics like quantifiers, rules of inference, logical equivalence, tautologies, subgroups, homomorphisms, error correcting codes, permutations, and divisibility. The assignment is due on June 9, 2023.

    Copyright:

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

    Course: Discrete Mathematics and Graph Theory

    Digital Assignment 1
    CAT 1
    Due Date: 06/09/2023
    1. Let M(x, y) be “x has sent y an e-mail message” and T (x, y) be “x has telephoned y,” where the
    domain consists of all students in your class. Use quantifiers to express each of these statements.
    (Assume that all e-mail messages that were sent are received, which is not the way things often
    work.)

    (a) There is a student in your class who has not received an e-mail message from anyone else in
    the class and who has not been called by any other student in the class.

    (b) Every student in the class has either received an email message or received a telephone call
    from another student in the class.
    (c)Every student in your class has sent an e-mail message to Ken.

    (d) No one in your class has telephoned Nina.

    2. (a) Use rules of inference to show that if ∀𝑥 (𝑃 (𝑥) ∨ 𝑄(𝑥)) and ∀𝑥 ((¬𝑃 (𝑥) ∧ 𝑄(𝑥)) →
    𝑅(𝑥)) are true, then ∀𝑥 (¬𝑅(𝑥) → 𝑃 (𝑥)) is also true, where the domains of all quantifiers are
    the same.

    (b) Prove using the CP rule the following:


    𝑝 → (𝑞 → 𝑠), ¬𝑟 ∨ 𝑝, 𝑞 ⇒ 𝑟 → 𝑠

    3. (a)Show that (𝑝 → 𝑞) ∨ (𝑝 → 𝑟) and 𝑝 → (𝑞 ∨ 𝑟) are logically equivalent using truth


    table.
    (b)Show that ¬𝑝 ↔ 𝑞 and 𝑝 ↔ ¬𝑞 are logically equivalent without using truth table.

    4. (a)Show that (𝑝 → 𝑞) ∧ (𝑞 → 𝑟) → (𝑝 → 𝑟) is a tautology.

    (b)Find the principal normal form and principal conjunctive normal form of
    (𝑝 ∧ 𝑞) ∨ (¬𝑝 ∧ 𝑟).

    5. Show that the set of premises is inconsistent.

    • John will get his degree, if and only if he passes all the examinations.
    • He will pass all the examinations if and only if he works hard.
    • He will be unemployed if and only if he does not get his degree.
    • John works hard if and only if he is employed.

    6. (a) Let 𝑈𝑛 = {𝑎 ∈ ℤ𝑛 |𝑔𝑐𝑑(𝑎, 𝑛 = 1)}. Prove that 𝑈𝑛 is a group under multiplication modulo 𝑛.

    (b)Show that {𝑝1 , 𝑝2 }, {𝑝1 , 𝑝4 }, {𝑝1 , 𝑝6 } and {𝑝1 , 𝑝3 , 𝑝6 } are sub-groups of the symmetric group
    (permutation group) (𝑆3 ,∗).

    7. (a) Let f: ( ℤ4 , +) → (ℤ5 |{0}, ✕) be a function defined by f(0)=1, f(1)=2, f(2)=4 and f(3)=3.
    Show that f is a homomorphism.

    (b) Find ker(g), where g: (ℤ12, +) → (ℤ2 , +) given by,

    g(x) = remainder of x when x is divided by 2.


    8. Given the generator matrix

    1 0 1 0 1 0
    𝐺=[ ]
    0 1 0 1 0 1
    Corresponding to the encoding function,𝑒: 𝐵2 → 𝐵6 .

    Find the corresponding parity check matrix and use it to decode the following received words
    and hence, to find the original message. Are all the words decoded uniquely?
    Received words:

    (i) 000100 (ii) 011101 (iii) 111010 (iv) 101011

    9. (a)In how many numbers with 7 distinct digits do only the digits 1-9 appear?
    (b) How many of the numbers in (a) contain a 3 and 6?

    (c) In how many of the numbers in (a) do 3 and 6 occur consecutively in any order?

    (d) How many of the numbers in (a) contain neither a 3 nor a 6?


    (e) How many of the numbers in (a) contain a 3 not a 6?

    10. Find the number of integers between 1 and 250 both inclusive that are not divisible by any of
    the integers 2, 3, 5 and 7.

    You might also like