Choose and write the correct option in the following questions. . . ins 1. Arelation Rin set A =(1, 2,3) is defined as R = ((, 0, (1,2), 2), (3,3). Which of the followin ordered pair in R shall be removed to make it an equivalence relation in A? [CBSE Sample Paper (2021-22) (Term-1)) (@) (1) (®) (1,2) © 22) @ 63) : 2. Let the relation Rin the set A= (x € 2:0 < x < 12) given R =((a,b): [ab] isamultiple of 3), ‘Then [1], the equivalence class containing ,is [CBSE Sample Paper (2021-22) (Term-1) @ (15,9) © (0,1,2,5) Oo MA 3. Forreal numbers x and y, define xRy ifand only if x- y+ y2 isan irrational number. Then the relation Ris [NCERT Exemplar] (a) reflexive () symmetric (c) transitive (@) none of these 4. Consider the non-empty set consisting of children in a family and a relation R defined as aRb if a is brother of b, then Ris INCERT Exemplar] (@) symmetric but not transitive (b) transitive but not symmetric (©) neither symmetric nor transitive (@ both symmetric and transitive 5. The maximum number of equivalence relation on the set A= (1, 2,3)are_ [NCERT Exemplar] @1 2 (03 5 6. Let L denotes the set of all straight lines in a plane. Let a relation R be defined by IRm if and only if lis perpendicular to m VI, m ¢ L, Then Ris [NCERT Exemplarl (@) reflexive (®) symmetric (0) transitive (d) none of these 7. Arelation R is defined on N. Which of the following is the reflexive relation? [CBSE 2021-22 (Term-1)] (@) R=((x,y):x>y,x, ye N} () R=((x,y):x+y=10,x, ye N) () R= (x,y) :xyis the square number, x, y ¢ N) (@) R=((x,y):x+4y=10;x, ye N} 12 Xam idea Mathematics-XIl —8 10. 1. 13. 14. 15. 16. 7. 18. 19. 20. 21. the set (1, 2, 3} containing the elements (1, 2) and (2, 1) [CBSE 2021-22 (Term-1)) The number of equivalence relation: is (@) 0 @1> (2 (3 Arelation R is defined on Z as: [CBSE 2021-22 (Term-1)| a@ Rb if and only if a*- 7ab + 6b? = 0. Then, Ris (@) reflexive and symmetric (b) symmetric but not reflexive (c) transitive but not reflexive (d) reflexive but not symmetric Ifa relation R on the set {1, 2, 3} be defined by R = (1, 2)}, then R is INCERT Exemplar] (@) Reflexive (b) Transitive () Symmetric (d) None of these Let R be a relation on A = {a,b,c} such that R = ((a, a), (b, B), (c, 0}, then R is (&) Symmetric only @ Equivalence (@) Reflexive (©) Non-transitive Let R be the relation in the set N given by R = {(a, b): a = b~2, b> 6}, then ICBSE Sample Paper 2021-22 (Term-1)] @ @AER (b) (3,8)ER () 6 8)ER @ &7ER Let A and B be finite sets containing mand 1 elements respectively. The number of relations that can be defined from A to Bis @ 2" 2" (mn @o Let A = (3, 5). Then number of reflexive relations on A is [CBSE 2023 (65/5/01 @2 m4 @o @s8 [CBSE 2020 (65/2/1)] (1, 2), 2, D, A, Dis (®) reflexive and symmetric, but not transitive The relation R in the set (1, 2, 3} given by R (a) symmetric and transitive, but not reflexive (©) symmetric, but neither reflexive nor transitive (d) an equivalence relation Let A= [1, 3, 5). Then the number of equivalence relations in A containing (1,3) is [CBSE 2020 (65/2/1)] @4 (a) 1 2 ©3 ‘The function f: R > R defined as flx) = vis [CBSE Sample Paper 2021-22 (Term-1)] (@) one-one but not onto (b) not one-one but onto (0) neither one-one nor onto (@) one-one and onto Set A has 3 elements and the set B has 4 elements. Then the number of injective mapping that can be defined from A to Bis INCERT Exemplar] (a) 144 @ 12 (24 (@ 64 Let A ={1,2,3), B= 14,5, 6, 7) and let f= ((1, 4), 2, 5), , 6)) be a function from A to B. Based on [CBSE Sample Paper 2021-22 (Term-1)] the given information, fis best defined as (@) surjective function (b) injective function _(¢) bijective function (d) function The number of functions defined from (1, 2, 3,4, 5} — (a, b} which are one-one is ICBSE Sample Paper 2021-22 (Term-1)] 0 (CBSE 2021-22 (Term-1)] @5 3 2 The function f: R — R defined by flx) = 4 + 3 cos xis (a) bijective (®) one-one but not onto (6) onto but not one-one (@) neither one-one nor onto22. Let f:R — Rbe defined by f(x)= (b) onto (a) one-one 23. The function f: N — Nis defined by f(1)= The function fis c (6) bijective n+ 4 ifniseven 3 (a) bijective © oneo! (c) onto but not one-one (@ neither Answers 1.) 2. (a) 3. @) 4.) 5. (d) 8. 0 9. (a) 10. (b) 1. (d) 12. ©) 15. (@) 16. (b) 17. (d) 18. (c) 19. (6) 22. (d) 23. (2) Solutions of Selected Multiple Choice Questions 7. Given relation R onset A (1,23) R= From the given rel R= (2 Hence, ordered pair -. Option (b) is correct: 2 [=e l Option (a) is co 4, Given, ab > lati wrrect. ‘This does not mean that bis also @ Hence, R is not symmetric. Again, So, a is brother ofc. Hence, R is transitive. , Option (b) is correct. 5, Number of equivalence 2 “o By= Bay = 2% =7C,By+7C,B, +°OB, =14+2+2=5 :. Option (d) is correct. 6. Forl,meL y-1| isa mul 1,1), (1,2) 22) & 3) ion R if we remove 2), G,3)] is an equiva (1,2) should be rem ais brother of b Rb => aisbrother of B tiple of 4} = ( .d (1, 2) then ence relation in A. oved. 1, 5,9) brother of @ relation in A = Bs +28, +B, if(m) eR > lim => ML => (mN)eR Ris symmetric. : Option (b) is correct 1 4 for all x, x ¢ R. Then, fis ifnisodd because b can be a si and bRe > bis brother of ¢. [CBSE. 2021-22 (Term-1), (d) not defined [CBSE 2021-22 (Term-D) ne but not onto one-one nor onto 6. ® 70 13. (a) 14. &) 20. (d) 21. (@) ister of a. By =1= By By = 2](x, uv): xyis the square number, *, yeN | 7. Arelation R is defined on N by Lot veN => (8) yx. =x? Which is a square number eN = (uaeR Ris reflexive on N. «. Option (c) is correct We have total possible pairs = {(1, 1), (1, 2), (1,3), 2, 0), 2,2), 2,3), 8D, G2), 8, 91 8. The smallest equivalence relation R, containing (1, 2) and (2, 1) is ((1, 1), 2,2), (3,3), (1,2), @ Dh Now, we are left with any 4 pairs namely (2, 3), (3, 2), (1,3) and (3, 1). Ifwe add any one, say (2, 3) to R, then for symmetry we must add (3,2) also and for transitivity we are forced to add (1, 3) and (3, 1). Thus the only equivalence relation bigger than R, is the universal relation. This shows that the total number of equivalence relations containing (1,2) and 2,1) is two. Option (c) is correct. 9. We have a relation R defined on Z as aRb if and only if a? — 7ab + 60 Reflexive: Let acZ P= Taxa + 60? = 70? 7a" =0 = aRa Itis reflexive. Symmetric: Let a, beZ and (@, b)eR aRb =>a?-7ha + 6b°=0 but bRa because b? - 7ba + 6a? #0 (may or may not be zero) ©. Itis not symmetric. Hence, R is reflexive but not symmetric. #. Option (d) is correct. 10. R=((,2)),A=(1,2,3) Clearly R is neither reflexive nor symmetric. ‘As (1,2) € Rbut 4 (2,0) € Riorb € A such that (1, b) © R. Hence R is a transitive relation on A. “. Option (b) is correct: I. R=(2,2),(0,8), CO Reflexive: Let (x, x) € R vx A So, R is reflexive. Symmetric: For (x, ER, x=y > Y.2ER Vx, YEA So, R is symmetric. Transitive: For (x, y) © R there is no (yz) € R such that (x, z) # R so Ris transitive. Hence, R is an equivalence relation. +: Option (d) is correct. 22, a=b-2andb>6 => 68eR +. Option (¢) is correct, Relations and Functions 15F » number of symmetric relations in A = 2" Ifa set containing 1 elements th Here n(A) = 2 & Number of syn ©. Option (}) is correct. 15. Given relation R in the set (1, 2,3} given by R = (1, 2),(2, 1), (1, 1)] is symmetric and transtty, but not reflexive because (2, 2) € R and (3,3) € R. °, Mu netric relations = 27°? = 2? = 4 Option (a) is correct. 16. Given set A= (1, 3,5] We have, smallest equivalence relation R, = {(1, 1), 3,3), (5,5), (1,3), (3,1) If we add (3, 5), then we have to add (5, 3) also, as it is symmetric. © Second equivalence relation will be Ry = (C1, 3), 3,1), (1,1), 3,3), (5, 5), (3, 5), (5, 3), (1, 5),(5, 1) Hence, number of equivalence relations containing (1,3) is 2. <. Option (b) is correct. 17. Letflxy)= fis) V%y,%)€ R (domain) => xp=x? = m=x, Let fix yvyeR (co-domain) = xsyteR Every image ye R (co-domain) has a unique pre ima = fisonto. Hence, fis one-one and onto. © Option (A) is correct. 18. The total number of injective may m elements is "P,,. So here it is *P; 19. As every pre-image x ¢ A has a unique image y ¢ B. => fis one-one. (domain) ige in R (domain). Pings from the set containing 1 elements into the set containing 24, = fis injective function. Option (b) is correct. 20. Let X= (1,2,3,4,5) and Y = {a,b} -. Number of functions defined from f: X + Y which are one-one is zero (0), because number of elements in set X is Sand number of elements in set Yis2 => n(X) > n(¥) = No one-one function possible. +. Option (d) is correct. 21. Given function f: R + R defined by f(x One-one: Let x, => 05 x) = cos 0=1 J+ COS x, = cos x, = fe) = fez) Itis not one-one. Onto: As we know that for all xeR, we have 71S C081 $1 5-3. <3cosx <3 51<443c0se<7 S71 fx) <7 = Range of f= (1, 7] +3cosx ie. xy 4x, and cos x) = cos 2x =1 = 4430051 =443.cos.xClearly, Range of f+ co-domain of f fis not onto. Hence, fis neither one-one nor onto. -. Option (@) is correct. 22. Given function fi R-+ R be defined by f(x)=+, for all xeR Clearly, when x = 0eR fx)= 0 = (co) (not defined) :. Option (A) is correct. n+1 2 ¢ if nisodd 23. Given function f:N + Nis defined by fl)=) if niseven 4, One-one: 1+1 Letn=1(edd) => f=43*=1 and,n=2(even) = f2)=2 2 Clearly, itis not one-one function. Onto: For every value of n whether it is even or odd fineN Co-domain = Range Itis onto. Hence, function fis onto but not one-one. Option (0) is correct. ACT