# DM - Functions & Relations -Q10

+1 vote
An equivalence relation on a set A partitions the set A into non-empty disjoint subsets such that each element of A belongs to exactly one of these subsets. The set of these  non-empty disjoint subsets of A, that collectively contain all elements of set A, is called a Partition of set A.

A partition P1 of a set A is called a refinement of the partition P2 of set A if every set in P1 is a subset of exactly one of the sets in P2.

Consider the following statements :

S1: Let B be the set of all bit strings of length 16. Then the partition of B formed by equivalence classes of bit strings that agree on the last eight bits is a refinement of the partition of B formed from the equivalence classes of bit strings that agree on the last four bits.

S2: The partition of set of all positive integers formed from congruence classes modulo 6  is a refinement of the partition formed from congruence classes modulo 3.

Which of the following statements is true?

(A). Only S1

(B). Only S2

(C). Both S1 and S2

(D). None of the above asked Jun 24
reshown Jun 27 answered 5 days ago by (112,760 points)