Discrete Mathematics: Assignment 01

Instructor: T. Pant
Deadline: Wednesday, Feb. 05, 2014 (RGIIT) & Thursday, Feb. 06, 2014 (IIITA) 11:00 AM

1. Write few applications of multisets. Define the symmetric difference of two multisets
with proper notations. Consider following operation defined on two multisets M
1
and M
2
:
{ }
2
2
1
1 2 1
2 1
| M x M x x M M
n n n n
= +
+

Here x
n
refers that the occurrence of an element x in the multiset M is n. What does this
operation do? Why such an operator is not defined in classical sets?

2. How Russells paradox can be correlated with Halting problem? If the paradox cant be
resolved, what is its significance in computability? Briefly explain what Zermelo-
Fraenkel axiom does to dissolve this antinomy.

3. Let A be a set with |A|=n. Find out the number of all possible reflexive and symmetric
relations defined on A individually. What is the problem to find the number of all
possible transitive relations?

4. An equivalence relation induces a partition of a set on which the relation is defined and
vice versa. What is the significance of this statement? Determine the equivalent classes of
Z
+
generated by (mod n) defining the term equivalent class first.