CO24553: Discrete Structures
Session Dec. 2019 to April 2020
Theory Assignment – 1
Date of Submission: 17/02/2020
Q.1. In an examination, 70% of the candidates passed in mathematics, 73% passed in
physics, and 64% passed in both subjects. If 63 candidates failed in both subjects,
use a venn diagram to find the total number of candidates who appeared at the
examination.
Q.2. Let In = {1, 2, --- , n}, the set of first n natural numbers.
a) Describe the set I10 – I5.
b) Describe the set In – Im if:
(i) n > m (ii) n = m (iii) n < m
Q.3. Suppose P and Q are two sets. Let R be a set that contains elements belonging to P
or Q but not both. Let T be a set that contains elements belonging to Q or the
complement of P but not both. Show that R is the complement of T.
Q.4. Use a truth table to determine whether the following argument form is valid?
pVq
p -> r
q -> r
Therefore r
Q.5. Consider the following statements:
a) If my checkbook is on my office table, then I paid my phone bill.
b) I was looking at the phone bill for payment at breakfast or I was looking at the
phone bill for payment in my office.
c) If I was looking at the phone bill at breakfast, then the checkbook is on the
breakfast table.
d) I did not pay my phone bill.
e) If I was looking at the phone bill in my office, then the checkbook is on my
office table.
Where was my checkbook?
Q.6. Prove that for any positive integer n, 7 divides 3 2n+1 + 2n+2.
Q.7. Given a relation R = {(1, 2), (2,3)} on the set of all natural numbers, add minimum
number of ordered pairs of natural numbers so that the resulting relation is
symmetric and transitive.
Q.8. Let R be a relation defined on the set Z as R = {(x, y) ɛ Z X Z: x + 2y = 31}. Find the
domain and range of R. Show that this relation is neither reflexive, nor symmetric,
nor transitive.
Q.9. Draw Hasse Diagram for the poset ({a | a is positive divisor of 20}, ≤), where ≤
denotes the divisibility relation.
Q.10. Let f be the function from the set X = {2, 3, 4, 5, 6, 7} into the set Y = {0, 1, 2, 3, 4}
defined by f(x) = 2x(mod 5). Write f as set of ordered pairs. Is f one-to-one or onto?