TST a r nN F a —: Arelation R in set A = (1,2,3} is defined as R = {(1,1), (1,2), (22), (3-0)- which ordered pair in R shall be removed to make it an equivalence relation in A? For the set A = {1,2,3}, define a relation R in the set Aas follows R = (0), 22), (3,3), (1,3)}. Then, write the ordered pair(s) to be added to R to make it the smallest equivalence relation Let A = {a,b,c} and the relation R be defined on A as follows: R= {@a), @,c), (@b)} Then, write minimum number of ordered pairs to be added in Rtomake R reflexive and transitive. Let A = {1,23} and R = {(1,2), (2,3)} bea relation in A. Then, how many minimum number of ordered pairs may be added, so that becomes an equivalence relation Check whether the relation ‘less than’ in the set of natural numbers is reflexive, symmetric or transitive. if f :X —-¥ isa function, Define a relation R on X given by R = {(a,b) : f(a) = f (b)}. Show that R is an equivalence relation on X. Let W denote the words in the English dictionary. Define the relation R by: R = {my Ew x W | the words x and y have at least one letter in common}. Check whether the relation R is reflexive, symmetric or transitive. Let A = {a,b}. Then how many trivial relation(s) can be defined on A? Also, write those relations. @ scanned with OKEN Scanner"A= (1.23) then "23), then check whether the relation p= i symmetric or transitive. SOA (G3) on ae Let the relation R be defin ed in N by aRb it 2a 435 relation R is reflexive, sy = 30. Check whether the! >> immetric or transitive. y x is f Ris a relation defined on the {@y):x€M,yENB2x4 R. Also, find whether R is a Set of natural numbers Was follows \R = Y = 24} then find the domain and range of relation n equivalence retation or not 12. Let the relation R be defined o: nthe set 4 = {123,45} by R = {(a,b) : fa? — b?| < 8}. Check whether the relation 2 is an equivalence relation or not. 13. Let Rbe arrelation on the set N of natural b. Then chi numbers defined by aRb if a divides eck whether the relation 2 is re flexive, symmetric or transitive. 14, Let n be a fixed positive inte Ger. Define a relation R in Z as follows: V a,b € Z, aRb if and only if a — bis divisible by n. Show that Ris an equivalance relation. 15. Let S be the set of all real numbers Rb © |a~ bl) <1. Check whether t transitive, and let R be a relation on S, defined by he relation R is reflexive, symmetric or 16. Let A= {p,q}. Then find the number of reflexive relations defined on A. 17, Let A= {p,q,r}. Then find the number of symmetric relations defined on A 18: Leb = {p,q}. Then find the number of reflexive and symmetric relations defined on A 19, Let A= {p,q}. Then find the number of reflexive or symmetric relations defined onA 20. Find the number of transitive relations defined on a set having 2 elements —__—__ @ scanned with OKEN Scanner3. 3 ordered pairs — (b,b),(c,c), (a,c) Ge7: 5. Transitive only 4 ~eN/AS 7. R is reflexive, symmetric but not transitive. ‘ 8. 2 trivial relations-$ &AXxA 9. Transitive only 10. Transitive only 1, Domain = {1,2,3 ...,11}, Range = {2,4,6,8,10,12,14,16,18,20,22}; R is not an equivalence relation 12, Equivalence relation 13 Reflexive, transitive but not symmetric 14. N/A 15. R is feflexive and,symmetric but not transitive 14. 4 17.64%, ean % 18.2 19. 10 20.13 Te @ scanned with OKEN Scanner