Which of these relations on {0, 1, 2, 3} are equivalence relations?

Determine the properties of an equivalence relation that the others lack.

a) {(0, 0),(1, 1),(2, 2),(3, 3)}

This is an equivalence relation because it is reflexive, symmetric, and transitive.

b) {(0, 0),(0, 2),(2, 0),(2, 2),(2, 3),(3, 2)(3, 3)}

This is not an equivalence relation because it is neither reflexive nor transitive. Missing (1, 1) for
reflexive and missing (0, 3) for the path (0, 2),(2, 3) for transitive.

c) {(0, 0),(1, 1),(1, 2),(2, 1),(2, 2),(3, 3)}

This is an equivalence relation because it is reflexive, symmetric, and transitive.

d) {(0, 0),(1, 1),(1, 3),(2, 2),(2, 3),(3, 1),(3, 2),(3, 3)}

This is not an equivalence relation because it is not transitive. Missing (1, 2) for the path (1, 3),(3,
2).
 2. Prove the following by using the principal of mathematical induction
for all n €N
1  + 2  + 3 +  … + n3 = [n(n+1)/2]2
3 3 3 

Solution:

Let the given statement be P(n), i.e.,

P(n): 13 + 23 + 33 +  … + n3 = [n(n+1)/2]2

For n = 1, we have

P(1): 13 = 1 = (1(1+1)/2)2 = (1.2/2)2 = 12 = 1, which is true.

Let P(k) be true for some positive integer k, i.e.,

13 + 23 + 33 +  … + k3 = [k(k+1)/2]2 —————–(1)

Let us prove that P(k+1) is true.

Consider

13 + 23 + 33 +  … + k3 +(k+1)3 = (13 + 23 + 33 +  … + k3)+(k+1)3

Thus, P(k+1) is true whenever P(k) is true.

Hence, by the principal of mathematical induction, statement P(n) is true for all
natural numbers i.e., N.

Q. Find the number of elements in A₁ ∪ A₂ ∪ A₃ if there are 100 elements in A₁, 1000 in A₂,
and 10,000 in A₃ if a) A₁ ⊆ A₂ and A₂ ⊆ A₃. b) the sets are pairwise disjoint. c) there are two
elements common to each pair of sets and one element in all three sets.
1
2

RESULT