— Choose and write the correct option in the following questions. 1 ° S is defined as R={(1, D, (1, 2), (2, 2), (3, 3)}. Which of the follow: eased ts make fan equivalence relation in A? ‘ollowing [CBSE Sample Paper (2021-22) (Tenn. @ (1) ® 2) © (2,2) @ (3,3) ar ic 7 i ={(a,b): |a-b| isa mult; Let the relation R in the set A = {x € Z:0 < x < 12}, given R={(a, multiple of 4), Then [1], the equivalence class containing 1, is [CBSE Sample Paper (2021-22) (Term-1)] Arelation R in set A = {1, ordered pair in R shall be removed to make @ 15,9) © (0,1,2,5} Oo @aA Forreal numbers xand y, define xRy if and only if x - y+ V2 is an irrational number. Then the relation Ris INCERT Exemplar] (@) reflexive (®) symmetric (©) transitive (d) none of these 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 R is (NCERT. Exemplar) (@) symmetric but not transitive (®) transitive but not symmetric (©) neither symmetric nor transitive (@ both symmetric and transitive . The maximum number of equivalence relation on the set A = {1, 2,3} are [NCERT Exemplar] @1 (2 3 @5 . Let L denotes the set of all straight lines in a plane. Let a relation R be defined by [Rm if and only if lis perpendicular to m W 1, m € L. Then Ris INCERT Exemplar (@) reflexive (®) symmetric (©) transitive (@ none of these . Arelation R is defined on N. Which of the following is the reflexive relation? [CBSE 2021-22 (Term-1)] @ R= (%,y):x>y,% ye N} () R=((x,y):x+y=10,x, ye N} (x, y) : zy is the square number, x, y < N} (x, y) :x + 4y = 10; x, ye N}10. nL 2 2B. uw 15. 16. 17. 18. 19. 21. The number of equivalence relations in the set (1, 2, 3) containing the elements (1, 2) and (2, 1) is [CBSE 2021-22 (Term-1)] @o @1 (2 @3 . A relation R is defined on Z as: 4 Rb if and only if a* -7ab + 6b? = 0. Then, Ris [CBSE 2021-22 (Term-1)] (@) reflexive and symmetric (®) symmetric but not reflexive (©) transitive but not reflexive (@) reflexive but not symmetric Ifa relation R on the set (1, 2, 3} be defined by R = {(1, 2)}, then Ris INCERT Exemplar] (@) Reflexive (©) 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 Ris (@) Reflexive (b) Symmetric only (©) Non-transitive (@) Equivalence 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)] @ @4)eR G8 eR © © 8)eR @(@&7eR Let A and B be finite sets containing m and n elements respectively. The number of relations that can be defined from A to B is @2™ (2 © mn @o Let A = {3, 5}. Then number of reflexive relations on A is [CBSE 2023 (65/5/1)] @2 O4 0 @8 The relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 0, (1, Dh is [CBSE 2020 (65/2/1)] (@) symmetric and transitive, but not reflexive (b) reflexive and symmetric, but not transitive (©) symmetric, but neither reflexive nor transitive (4) an equivalence relation Let A = {1, 3, 5). Then the number of equivalence relations in A containing (1, 3) is ICBSE 2020 (65/2/1)] @1 2 ©3 @4 The function f: R > R defined as f(x) = x" is ICBSE Sample Paper 2021-22 (Term-1)] (@) one-one but not onto (®) not one-one but onto (©) 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 M2 (©) 24 @ 6 Let A = (1, 2, 3), B= (4, 5, 6, 7} and let f= ((1, 4), 2, 5), (3, 6)} be a function from A to B. Based on the given information, fis best defined as ICBSE Sample Paper 2021-22 (Term-1)] (@) surjective function (b) injective function _(c) bijective function (@) 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)] @5 3 (2 (@) 0 The function f: R — R defined by flx) = 4 +3 cos x is [CBSE 2021-22 (Term-1)] (@) bijective (b) one-one but not onto (©) onto but not one-one (d) neither one-one nor onto22. Letf:R — Rbe defined by flx)=4, forall x, x < R. Then, fis (c) bijective (a) one-one (b) onto 23. The function f: N — Nis defined by f(n)= The function f is (a) bijective (c) onto but not one-one Answers 1. (b) 2. (a) 3. (a) 8. (c) 9. (d) 10. (b) 15. (a) 16. (b) 17. (d) 22. (d) 23. (c) Q ifniseven (b) one-one but not onto (d) neither one-one nor onto 4. (b) 5. (a) 6. (b) 11. @) 12. (0) 13. (a) 18. (c) 19. (b) 20. (a) [CBSE 2021-22 (Term-1)] (d) not defined a [CBSE 2021-22 (Term-1)] 7.0) 14. (b) 21. (d)— The following questions consist of two statements—Assertion(A) and Reason(R). Answer these questions selecting the appropriate option given below: (@ Both A and R are true and R is the correct explanation for A. (®) Both A and R are true but R is not the correct explanation for A. (Q Ais true but R is false. @ Ais false but R is true. 1. Assertion (A) : Let Rbe the relation on the set of integers Z given by R = {(a, b) :2 divides (a—b)} is an equivalence relation. Reason (R) : A relation R in a set A is said to be an equivalence relation if R is reflexive, symmetric and transitive. 2. Assertion (A) : Let f:R —> R given by f(x) =x, then fis a one-one function. Reason (R) : A function g: A> Bis said to be onto function if for each b ¢ B, 3a € A such that g(a) =. 3. Assertion (A) : Let function f: {1, 2, 3} > {1, 2, 3) be an onto function. Then it must be one-one function.Reason (R) : 4. Assertion (A): Reason (R) : . Assertion (A): Reason (R) . Assertion (A): s 2 Reason (R) : . Assertion (A): x Reason (R) : Answers L@ 2 (b) ‘A one-one function g: A -» B, where A and B are finite set and having san number of elements, then it must be onto and vice-versa. e Let f: R > R such that f(x) = 2°. The function fis an onto function, ‘A function g : A> B is said to be onto function if g(A) = B ie, range of g= 8 ‘The number of all onto functions from the set (1, 2, 3, 4, 5} to itself is 51 : Total number of all onto functions from the set {1, 2, 3, ...., 1} to itself is n!, Let f: R > R givenby 1 if x>0 fey= EL 0 if x=0 isabijection. 1 if x<0 A function g : A — B is said to be bijection if it is one-one and onto. Let A = (1, 2, 3) then define a relation on A as R = {(1, 2), (2, 1)}, R is not transite relation. A relation R defined on a non-empty set A is said to be transitive relation if") @deR>@deR 3. (a) 4.) 5. (a) 6. (a) 707. Arelation R is defined on a set of real numbers R as R={(x, yx. y is an irrational number}. Check whether R is reflexive, symmetric and transitive or not. Sol. A relation R is defined on a set of real numbers R as R = {(x, y) : xy is an irrational number]. [CBSE 2023 (65/1/1)] Reflexive: Letx=/3eR ». ¥3x V3 =3 # an irrational number = (V3, ¥3)ER It is not reflexive. Symmetric: Let x, yeR If@y)¢R > xyisan irrational number => y.x is also an irrational number=>(y,x) eR +. Itis symmetric. Transitive: Let x,y,z € Rsuch that x=1, y= y2,2=3 if(,y)€R = xyis an irrational number iz., 1x /2 = /2 is an itrationg, and, (y,2)€R => y.2 = ¥2 x3=3y2 isan irrational. Now, (x,z) =>xxz=1x3=3 +. (t,2) €R + Itis not transitive. Hence, R is symmetric but neither reflexive nor transitive, 8. Consider f: R, ->[-9, 0) given by flx) = 5x” + 6x 9. Prove that fis invertible. (CBSE Allahabad 215, Sol. To prove fis invertible, it is sufficient to Prove fis one-one onto. Here, Six) = 5x? + 6x-9 One-one: Let x, x) € R,, then Fen) = fee) > Sx? +6x,-9=5x2+6x,-9 > 5x24 6x, 522-62, =0 > 5x? -x2)+6(x,-x,) =0 FSO, a) +x) +6(q x) =0 = (x, x) Gx, +5x, +6) =0 = 4-x=0 5x, +5x, +6 40] = AX ie, fis one-one function. \ Onto: -- f(x) = Sx 6x—9a5{s2 424% 3-3} 2 132 “sfPraend(BF-f-8 [Pranende(Qh (fg 5 af(« + =5 (x +3) ay, 9 (z+ 3) = ao (r+ 3° 54 = af(e+3) -2 2-9 payzo = RY) =[-9,0)= co-domain, As fis both one-one and onto. = fis bijective. Hence, fis one-one onto function, ie., invertible, 9. Consider f: R, (4, «0) Biven by fW) = x7 + 4. Show that invertible. (CBSE (AI) 2013; (F) 2011] Sol. One-one: Let x,, 2 € R, (Domain) Sle) = fx)10. nu. Sol. > xPtdenzed > xpax? > X=% Hence, fis one-one function. Onto: Let y ¢ [4, 0) such that y=f) VxeR, > yar44 => xeyy-4 I. [. x) are +ve real number] [set of non-negative reals] . xis + ve real number] Obviously, V y ¢ [4, co), x is real number ¢ R, (domain) ie, all elements of codomain have pre image in domain. = fis onto. Hence, fis invertible being one-one onto. Show that the function f: (-<0, 0) -> (-1, 0) defined by f(x) onto. (— co, 0) is one-one and Tela’ © 6 [CBSE 2020 (65/3/1)] |. Let x,, x, © c0,0) such that f(r) = fl). 1 1 1 For each y (1,0), there exists x € (- 00,0), atlas y pay) such that f(x) = Aes) Bee yay Way = 1 Hence fis onto. ICBSE Marking Scheme 2020 (65/3/1)] Prove that the greatest integer function f :R —~ R given by f(x) = [x], is neither one-one nor onto, where [x] denotes the greatest integer less than or equal tox. (CBSE 2017(C)| f:R—=R given by f(x) = [x]Injectivity: Let x, = 2.5 and x, = 2 be two elements of R. Ff (x1) =F (2.5) = [2.5] =2 £2) =f(2) = 2] =2 F(X) =f (%) for x, 4x > F (x) = [2] is not one-one i., not injective. Surjectivity: Let y = 2.5 ¢ R be any element. * f(@@)=25 => b]=25 Which is not possible as [x] is always an integer. => f (x) = [x] is not onto i.e., not surjective.