RELATIONS AND FUNCTIONS BASIC CONCEPTS 1. Relation: If 4 and B are two non-empty sels, then any subset R of A x B is called relation from set A toset 8. ie, R:ASB & RCAXB IEG, y) € Rthen we write x R y (read as tis R related toy) and if (t,y) ¢ R,then we write x Ry (read as xis not R related to y). 2. Domain and Range of a Relation: If Ris any relation from set A to set B then, (a) Domain of R is the set ofall first coordinates of elements of R and it is denoted by Dom (R). (©) Range of Ris the set of all second coordinates of R and itis denoted by Range (R). Arelation Ron set A means, the relation from Ato A ie, ROA x A 3. Some Standard ‘lypes of Relations: Let A be a non-empty set, Then, a relation R on set A is said to be (a) Reflexive: If(x, 2) © R for each element x © A, fe, if xRr for each element x © A (6) Symmetric: If (x,y) € R= W,2) € R forall.x, y € A, i. if ¥Ry = yRx forall x, y € A. (c) Transitive: If (x,y) € Rand (y, 2) € R= (4,2) € Rlorall x,y,z € A, ie, if xRy and yRz = aR, 4. Equivalence Relation: Any relation R ona set 4 is said to be an equivalence relation if Ris reflexive, aymmetric and transitive Antisymmetric Relation: A relation R in a set A is antisymmetric if@,1) Ra) ER > a=b¥ a, €RoraRband bRa = a=b,¥a,bER For example, the relation “greater than or equal lo, "2” is antisymmetric relation as a2bb2a > a=bVa,b [Note: “Antisymmetric” is completely different from not symmetric.] 6. Equivalence Class: Let R be an equivalence relation on a non-emply set A. For all a © A, the equivalence class of ‘a is defined as the set of all such elements of A which are related to ‘a’ under R.It is denoted by [a]. ie, [a] = equivalence class of fa! = fx A:(x,2) € R} 7. Function: Let X and Ybe two non-empty sets. Then, a rule f which associates to each element x € X, a unique element, denoted by fit) of ¥, is called e function from X to Y and written asf: X— Y where, Ax) is called image of x and x is called the pre-image of f(x) and the set ¥ is called the co-domain of Fond fiX) = {2}: x € XI is called the range of f Relations and Functions | 58. Types of Function: (@) One-one function (injective function): A function f- X — Y is defined to be one-one if the image of distinct clement of X under rule f are distinct, ie, for every xy.) € X, fo) = flay) implies that x) =p. (di) Onto function (Surjective function): A function f: Xp Y is saiel to be onto function if each clement of Y's the image of some element of rie, for every y ¢ Y, there exists some x ¢ X, such that y= fi). Thus fis onto if range of f= co-domain of f, (ii) One-one onto function (Bijective function): A function f: X + Y is said to be one-one onto, if fis both one-one and onto. (i) Many-one function: A function f: X + ¥ is said to be a many-one function if two or more elements of set X have the same image in ¥. fe, f:X > Yisa many-one function if there exista, b € X such thata#b but fla) = Ab). 9. Composition of Functions: Let f: A B and g : B > C be two functions. Then, the compos fand g, denoted by gof, is defined as the function, fA2B BOC gop ADC — givenby gofla) = sf), VE A Clearly, dom(gof) = dom(f) Also, gofiss defined only when range(f) < dom(g) 10. Identity Function: Let R be the set of real numbers. A function I: R > R such that I(x) =x Vx € Riscalled identity function Obviously, identity function associates each real number lo itsel 11. Invertible Function: For f: A &, if there exists a function g : B+ A such that gof = 1, and fog where [4 and fy are identity functions, then / inverse of f and it is written as f~! = g. ly called an invertible function, and g is called the 12. Number of Functions: If X and ¥ are two finite sets having m and m elements respectively then the number of functions from X to ¥ isi" 13, Vertical Line Test: It is used to check whether a relation isa funet nor not. Under this test, graph of given relation is drawn assuming elements of domain along x-axis. Ifa vertical line drawn anywhere inthe graph, intersects the graph at only one point then the relation is a function, otherwise it isnot a function. 14, Horizontal Line Test: It is used to check whether a function is one-one or not, Under this test graph of given function is drawn assuming elements of domain along x-axis. Ifa horizontal line (parallel to axis) drawn anywhere in graph, intersects the graph at only one point then the function is one~ cone, otherwise itis many-one, 6 | Mathematics-Xil: Term-1MULTIPLE CHOICE QUESTIONS Choose and write the correct option in the following questions. 1 a 4. 5B 6 10. n. ‘The relation R in the set A = {1, 2,3, 4} given by R= ((1, 2), @, 2), (1, 0), 4,4), (1,3), 8,3), @, 20) (a) reflexive and symmetric but not transitive (0) reflexive and transitive but not symmetric (©) symmetric and transitive but not reflexive (@) an equivalence relation If A= (a, b,c; d), then arelation R= {(a, b),(b, a), (a, a)} on A is (@) symmetric only (®) transitive only (©) roflexive and transitive {@) symmetric and transitive only Forreal numbers x and y, define xRy if and only if x y+¥2 is animational number. Then the relation R is INCERT Exemplarl (@ reflexive (6) symmetric (© transitive (@ 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 Ris INCERT Exemplar] (@) symmetric but not transitive (8) transitive but not symmetric (0) neither symmetric nor transitive (a) both symmetric and transitive ‘The maximum number of equivalence relation on the set A = {1,2,3}are_ [NCERT Exemplar] @1 (2 Or @s Let L denotes the set of all straight lines in a plane, Let a relation R be defined by IRnr if and only if lis perpendicular to m ¥ J, nt € L. Then Ris INCERT Exemplar] (@) reflexive () symmetric (©) transitive (a) none of these Let A= (1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is @. (2 3 4 Let A = {1,2,3). Then number of equivalence relations containing (1,2) is/are @. (2 3 Ma Let A and B be finite sets containing mt and x clements respectively. The number of relations that can be defined from A to Bis @o wo (©) mn wo 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 B is INCERT Exemplar] (@ 144 @ 2 ou (a) 64 The function f: R + R defined by ftx) = 2" + 2!"! is (@) One-one and onto (8) Many-one and onto (0) One-one and into (a) Many-one and into If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and onto mapping from A to Bis (a) 720 () 120 (0 (@) none of these ‘Which of the following functions from Z into Z is bijection? INCERT Exemptarl (a) fix)=° (W) flxy=x+2 (©) flx)=2e41 (@ fxy=P 41 Let f: 12, <) + R be the function defined by fix) = x*—4v + 5, then the range of fis INCERT Exemplar] @R © 1») © 1%) @ 62) Relations and Functions | 78 1B. 16. 7. 18. 19. 25. 27. Let f: R-+ R be defined by flx) = +1 Then, pre-images of 17 and -3, respectively, are INCERT Exemplar] @) 6,14} {3,-3.6 ©) 14-4 (a) {4,4}, 2,2) Let the function f:R~R be defined by flx) = 2x+sin vfor ve R. Then fis (@) one-one but not onto (8) onto but not one-one (0) neither one-one nor onto (a) one-one and onto Let R be the relation in the set N given by R = {(a, b):a = b~2, b> 6} choose the correct answer. @ @HER () B%ER () © 8)ER (@ &ER Let f:R—+ R be defined as fix) = x4, Choose the correct answer (@) fis one-one onto. () fis many one onto (0) fis one-one but not onto (a) fis neither one-one nor onto. Let f:R— R be defined as fix) = 3x. Choose the correct answer. (@) fis one-one onto. (8) fis many one onto. (0) Fis one-one but not onto (d) fis neither one-one nor onto. Let f:R——=R defined by Jos) = 20 +2: +300x +5 sin x then fis (@) one-one onto (8) one-one into (©) many one onto (d) many one into Let f:R— R be defined by fix) = x7 + 1. Then, pre-image of 5 and -5, respectively are (@) 6-2) G-3.6 © 2,214 @ (1-1, 12,-2) ‘The domain of the function f:R—R defined by fix) = vx7=4 is (@) [-2,2} () (-2, 2) ©) @»,-2] U2, 6) (a) (-20, 00) ax, ifx>3 Let f:R-R bedefined by f(x)=}x7, if1 in the set of integers is (@) Symmetric () Reflexive (0) Transitive (@ None of these IER, and Ry are symmetric relations in a set A, then R,UR, is (@) Reflexive (8) Symmetric (©) Transitive (@ None of these The function f:R— R defined by flx) = 4° + 4!*! is (@) one-one and into (8) one-one and onto (©) many one and into {@) many one and onto Identity relation R on a set A is (@) Reflexive only (b) Symmetric only (©) Transitive only (#) Equivalence The relation “congruence modulo m on the set Z of all integers is a relation of type @) Reflexive only (6) Symmetric only (6) Transitive only (a) Equivalence Let f R—Io, 2) defined by fix) = tan (x7 + x+ 2a) then the set of values of “a” for which fis onto, is © (Le) (0) [-4e0) oF) [E) If the function fx) satisfying (f(x))? - 4f(a)f’ (x) + (f' G0)? = 0 then flx) equals (a) eB" y nets (e) nett ti) noi" Let f:(41,1)— B where fix) = tan i sar nets macs ob oCE3) (3) (a) One-one onto: (0) Onto but not one-one (c) One-one bul not onto (a) None of these ‘A crolation R in the set of non-zero complexs number is defined by z,R z, ¢>—1—2 is real, then Ris 74 (@) Reflexive (6) Symmetric (© Transitive (@) Equivalence Number of onto (subjective) functions from A to B if (A) = 6 and n(B) =3 are (@ 2-2 3-3 (© 340 (@ None of these Relations and Functions | 910 a7. 49. 51. 52, 33. 57. Let A ={7, 8,9, 10) and R((8, 8), (9, 9), (10, 10), (7, 8} bea relation on A, then Ris (@) Transitive (W) Reflexive (0) Symmetric (@ None of these Let f,gbe a function from the set (1,2, 12! to the set {1,2, 3, .,11}then which of the following is correct? 2x1 (a) Number of onto functions from A (0B (®) Total number of functions from A to B= 11! ye last 2 (©) The functions which are not onto (@ Allof these Lel p and q are positive integers, fis a function defined (or positive numbers and attains only positive values such that flx f(y)]=x"y" then. @) Poa Wash }a=b (@) None of these 2x q-x Letf: (1,1) 8, bea function defined by f(x) = tan™( a ) then fis both one-one and onto when Bis the interval of) o4) (S38) w BE Let f:R—=R defined by flo) = Ty then (2) fla) is one-one but not onto *" () fa) is nether one-one nor onto (6) fla) is many one but onto (@) x) is one-one and onto IFA =(7,8, 9), then the relation R = ((6, 9)} in A is (@) Symmetric only () Non-symmetric_(¢) Reflexive only (4) Equivalence Let A be the finite set containing 1 distinct elements , The number of relations that can be defined on A is @ 2 (oP oe" 2 Let R, and R, be equivalence relations on a set A, then R,U Ry may or may not be (a) Reflexive. (0) Symmetric (c) Transitive (@) None of these Let R be the relation defined on the set N of natural numbers by the rule v Ry iff.x+2y=8, then domain of Ris (@) (24,8) ©) 2A, (0) 2468) (# 12341 Let A = {a,b,c} and R =|(a,a), (b,b), (c,c), (b,c), (a,b)} be a relation on A, then R is (@) Symmetric () Transitive (©) Reflexive (a) Equivalence “Every relation is a function and every function is a relation” then which is correct for given statement ? (@) True (6) False (© Can't say anything (@) None of these Ifa relation R on the set (1, 2, 3} be defined by R = ((1, )), then R is (@ Reflexive (@) Transitive (©) Symmetric (@ None of these Let us define a relation R in Rasa R bifa2b. Then, Ris R= (a, b):020) (@) Anequivalence relation (0) Reflexive, transitive bul nol symmetric (0) Symmetric, transitive but not reflexive (d) Neither transitive nor reflexive but symmetric Mathematics-XiI: Term-158. IfA={1,2,3} and consider the relation R = {(1, 1), 2,2), G3), (1,2), (2,3), (1, 3)}. Then, R is (@) Reflexive but nol symmetric (W) Reflexive but not transitive (0) Symmetric and transitive {d) Neither Symmetric nor transitive 59, The relation R defined on the set A = (1, 2,3, 4, 5} by R= ((a, 1): |a*-l"| <7lis given by @ (2.0.20, 6,0, 4,0, 2,3)) ©) (2,2),@,2 (4,2), 40) © (169,436,464) (@ (01,1), 2, 2),8,3), (4 4), (5, 5), (1,2), (2.3)) Answers. 1 ®) 2d) 3.(@) 40 5 @ 6.) 7.@ 8. @) 9.(a) 10. (©) n©@ 12 ©) 13. (6) 14. () 15. (0) 16. (a) © 18. (l) 19. (a) 20. (a) 21. (©) 22. {o) 23. 0) 24. (a) 2. (©) 26. (0) 27. (a) 28.) 29. (a) 30. (6) 31. (©) 32. (0) 33. (i) 34. (0) 35.) 36. (0) 37. @) 38. (d) 39. (i) 40. (e) 41. ©) 42. (0) 8.0 44, (d) 45. (@) 46. (@) 47. (©) 48. (©) 49. (0) 50. () 51. (©) 52. fc) 53. (0) 54. (0) 55. (0) 56, (b) 37. 0) 58. (a) 59.) CASE-BASED QUESTIONS Choose and write the correct option in the following questions. 1. Read the following and answer any four questions from (i) to (e). ‘A general election of Lok Sabha is a gigantic exercise, About 911 million peaple were eligible to vote and voter turnout was about 67%, the highest ever ONE - NATION ONE - ELECTION FESTIVAL OF DEMOCRACY GENERAL ELECTION- 2019 MY VOICE Let / be the set of all citizens of India who were eligible to exercise their voting right in general election held in 2019. A relation ‘R’ is defined on Jas follows: R={(V,, Va): Vy, Vp € Land both use their voting right in general election ~ 2019} [CBSE Question Bank] Relations and Functions | 11Answer the questions given below. (i) Two neighbours X and Y « I. X exercised his voting right while Y did not cast her vote in general election - 2019, Which of the following is true? @ & eR WOM RMeER (&XHeR MYER (ii) Mz/X’ and his wife ‘W’ both exercised their voting right in general election -2019, Which of the following is true? (2) both (X,W) and (WX) € R (8) (XW) € Rout (WX) eR (©) both (X,W) and (W.X) € R (@) (WX) € Rut (XW) eR (iii) Three friends F,,F,and F, exercised their voting right in general election- 2019, then which of the following is true? © (Fy Fy) €R, (Fy Fy) € Rand (Fy, Fy eR (8) (FF) € R, (Fp, Fy) € Rand (FF) eR © Ey) eR, Fy F,) Rut FF) eR (@ EF) € R, Fy Fy) € Rand (FF) €R (iv) The above defined relation R is ©) Symmetric and transitive bul not reflexive © Universal relation (© Equivalence relation (@ Reflexive but not symmetric and transitive (o) Mr. Shyam exercised his voting right in General Election - 2019, then Mr. Shyam is related to which of the following? ©) All those eligible voters who cast their voles (®) Family members of MrShyam (© Allcitizens of India (# Eligible voters of India Sol. We have a relation ‘R’ is defined on I as follows: R={V,, Vol: Vy, Vp € Land both use their voting right in general election - 2019} ( Twoneighbors X and Y € |. Since X exercised his voting right while Y did not cast her vote in general election ~ 2019 Therefore, (X,Y) #R Option (d) is correct. (i) Since Mr. X’ and his wife ‘W’ both exercised their voting right in general election ~ 2019. 2+ Both (X, W) and (W, X) € R Option (a) is correct. (iti) Since three friends F,, F, and F; exercised their voting right in general election ~ 2019, therefore (ELF) eR, (Fy Fy) e Rand (Fy, Fe) eR Option (a) is correct. (ie) This relation is an equivalence relation Option (0) is correct (0) Mr. Shyam exercised his voting right in General election ~2019, then Mr. Shyam is related toall those eligible votes who cast thei votes. ++ Option (a) is correct 12 | Mathematics-XIl: Term-1Read the following and answer any four questions from (i) to (0). Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dive, Sherlin’s sister Raji observed and noted the possible outcomes of the throw every time belongs to set 11,2.345,6), Let A be the set of players while B be the set ofall poseible outcomes. ! Far A={S, Di, B= (123,456) Answer the questions given below. (i) Let R: B+ Bhe defined by R= (lx, (0) Reflexive and transitive but not symmetric (®) Reflexive and symmetric and not transitive (©) Not reflexive but symmetric and transitive (2D Equivalence (Gi) Raji wants to know the number of functions from A to B. How many number of functions axe possible? [CBSE Question Bank] @é 2 (ot @o" (iii) Let R be a relation on B defined by R = {(1,2), (2,2), (1,3), (3,A), (3,1), (4,3), (5,5). Then Ris (a) Symmetric (b) Reflexive (c) Transitive (a) None of these three (ix) Raji wants to know the number of relations possible from A to B. How many numbers of relations are possible? oe 2 (et 2? () Let R: BB be defined by R=((1,1),(1,2), (2,2), (3,3), 4,4), (5,5),(6,6)], then R is @) Symmetric (0) Reflexive and Transitive (0) Transitive and symmetric (d) Equivalence Sol. () Given R:B + Bbe detined by R=((s, 9) :yis divisible by x} Reflexive : Let x ¢ B, since x always divide x itselt. Gamer Itis reflexive. Symmetric: Let x,y € Band let (x, y) €R = vis divisible by. = S=k,, where ky is an integer. Relations and Functions | 13Itis not symmetric. ve : Let x, y, = € Band Lela, yeR = where &; is an integer. and, (y,2) €R = Zk, where kyis an integer: = ky ky =k integer) > F=k = eR is transitive. Hence, relation is reflexive and transitive but not symmetric. “Option (a) is correct. (i) Wehave, A=(S,D} = m(A)=2 and, B=(1,2,3,4,5,6 = n(B)=6 +. Number of functions from A to B is 6 Option (@) is correct (iti) Given, Rhea relation on B defined by R= ((1,2), (2,2), (1,3), 8,4), 8,0, 4,3), 6,5)) Ris not reflexive since (1,1), (3,3). (4,4) €R Ris nol symmetric as (1,2) ¢ Rbut 2,1) ¢ R and, Ris not transitive as (1,3) € Rand (3,1) Rbut (1,1) €R "Ris neither reflexive nor symmetric nor transitive. Option (A) is correct (iv) Total number of possible relations from A to B = 22 Option (A) is correct (@) Given R : BB be defined by R = {(1, 1), (1, 2), (2,2), 8,3), (4, 4 6,5), (6,6) 2+ Ris reflexive as each elements of Bis related to itself and R is also transitive as (1,2) € R and 2,2) eR = 2eR Ris refle and transitive, = Option (1) is vorreet 3. Read the following and answer any four questions from (i) to (r). ‘An organization conducted bike race under 2 different categories-boys and girls. In all, there ‘were 250 participants. Among all of them finally three from Category 1 and two from Category 2 ‘were selected for the final race. Ravi forms two sels B and G with these participants for his college project. Lel B= (hy, by by) Gale, gal where B represents the set of boys selected and G theset of girls who were selected for the final rac. [CBSE Question Bark] 14 | Mathematics-XIl: Term-1Ravi decides to explore these sels for various types of relations and functions Answer the questions given below. (# Ravi wishes to form all the relations possible from B to G. How many such relations are possible? @ 2% (w)2® (0 2 (ii) Let: B+ B be defined by R= (x, y):x andy are students of same sex}, Then this relation Ris () Equivalence (0) Reflexive only (©) Reflexive and symmetric but not transitive (@ Reflexive and transitive but not symmetric (iii) Ravi wants to know among those relations, how many functions can be formed from BtoG? @? wa" oe 2 (ie) Let R : B+ G be defined by R= by 3), (by 2), (bsg) then R is © Injective (0) Surjective (© Neither Surjective nor injective __(d) Surjective and Injective (0) Ravi wants to find the number of injective functions from B to G. How many numbers of injective functions are possible? @o (oy2t (3! (or Sol. Wehave sets B= (by, by bs), G= Wy 82) > 18) n(@) =2 (#) Number of all possible relations from B to G= 2°? Option (a) is correct. (i) Given relation R = [(x, y) x and y are student of same sex} (On the set 8. Since the sel is B = [by, by, by) = all boys It is ans equivalence relation Option (a) is correct. Relations and Functions | 15(iti) We have, B= (iby ty} => n(B)=3 G= tugs} = nC) . Total no. of possible functions from B to G = 2° Option (io) Weave, So R:B R be (@) is correct. + be defined by My 81)+ (by 82), Oa BDI tis not injec ive because (by,g;) € Rand (0,31) © R thy = same image g Ils surjective because its Co-comain = Range. Ris Su jective, ¢+ Option (b) is correct (0) Since R is nol injective therefore number of injective functions = 0 4+ Option (a) is correct, CSE SAELO) Bite evel In the following questions, a statement of Assertion (A) is followed by a statement of Reason (R). Choose the correct answer out of the following choices. (a) Both A and R are true and Ris the correct explanation of A. (b) Both A and R are true but R is not the correct explanation of A. (0) Ais true but R is false. (@ Ais false aud R is also false. 1. Assertion (A): ® = 2. Assertion (A): ms 3. Assertion (A): ®: 4. Assertion (A): ‘Answers 16 L@) ®: 2. (a) Let L be the collection of all lines in a plane and R; be the relation on L as Ry (Ly La): Ly L Lp) is a symmetric relation, A relation R is said to be symmetric if(@, b) € R= (b, a) € R Let R be the relation on the set of integers Z given by R= {(a,b) divides (a—b)) isan equivalence relation, A relation R in a set A is said to be an equivalence relation if R is reflexive, symmetric and transitive. Let fs IR gi A function g > A Bis said to be onto func g(a) =. Let function f: {1, 2, 3) + {1, 2,3} be an onto function. Then it must be one-one function ea by fix) =, then fis a one-one function for each b ¢ B, 3.4 € A such that A one-one function g : A> B, where A and B are finite set and having same number of elements, then il must be onto and vice-versa, 3.) 4. (@) Mathematics-XiI: Term-1HINTS/SOLUTIONS OF SELECTED MCQS 1. Since every element of A is related to itself in the given relation R, therefore R is reflexive and as {1, 2) € Rand (2, 2) ¢ R= (1, 2) € R also (1,3) ¢ Rand (3,2) ¢ R= (1,2) € R Again (1,3) €R and (3, 3) € R= (1,3) € R. Thus Ris also transitive. Hence relation R is reflexive and transitive but not symmetric because, (1,2) ¢ R but (2,1) € R, also (1,3) € R but (3, 1) ¢ Rand (3,2) Rbut 23) ER. Option (0) is correct. 2 Onithe set A = (a,b, ¢,d} given relation R= {(a, 8), (b, 4), a, a) is symmetric and transitive only. Since, (a,b) € R= (b, ) € R, therefore it ie symmetric Also, (a,b) € Rand (ba) ¢ R= (a,) € R, soit is also transitive. As (b, 6), (¢,¢) and (d,d) does not belong to R hence R is not reflexive. Hence relation R is symmetric and transitive only. Option (4) is correct 3. Foranyx eR x-xt JB = /2 is anitrational number = (2,1) € RVR 2. Risreflexive For2, /2¢R y2 -2+ y2 =2V2 -2isan irrational number. = (2,2eR But 2~ /2 + y2 =2whichisa rational number = 2 v2)eR = Ris not reflexive Ris not transitive For2, V3, ¥2eR vy 2-43 + ¥2 =2-(V/3 - ¥2)is an irrational number 2 VB)ER Also 73 - v2 + V2 = ¥3 whichis an irrational number = (V3, v2)ER But 2- ¥2 + ¥2 =2which isa rational number, = @ v2)eR = Ris not transitive Option (a) is correct 4. Given, ab = aisbrotherofb This does not mean that Bis also a brother of a because b can be a sister of a Hence, R is not symmetric Again, aRb > aisbrotherofb and bRe > bisbrother ofc. So, ais brother of c Hence, Ris transitive, Option (b) is correct. } Relations and Functions | 175. Weare given set A=(1,2,3} Number of equivalance relation on A = number of possible portion of [1, 2,3} ie, 3=14141 Only one combination 32142 Possible combination 3-3 1 possible combination fe, @ (LAW be, (0,1), 228, 3 (i) (1,2, tee 10,22 1,6,9) (i) 1,3, 2H ke, 10,3),8, 19,2, 204 () (23,0) ie, (2,3),,2,0, 0) © (L231 te, (0,0, 0,2), 3), 20,22) 2,3), B,D, 6,263) ie, Total number of equivalence relation =3 Option (@) is correct. 6. Fori,meL Gm eR > llm > mil > (mDeR 2» Rissymmetric Option (Wis correct. 7. Required relation is reflexive and symmetric but not transitive is given by R=, 1), 2,2),8,3),,2),2,0,0,9)8, 0) which is reflexive as (@,0) @RVaeA which is symmetric as (a,b) € R= (0, a) € R fora, be A But (2,1),(1,3)€R » @ IER Hence R is not transitive. There is only one such relation. Option (e) is correct. 98. We have n(A) = m, (8) =. Number of relations defined from A to B number of possible subsets of A x B= 204" = 2" Option (e) is correct 10. The lotal number of injective mappings irom the set containing r clements into the set containing elements is "P,, So here it is *P, = 4! = 24 Option (¢) is correct. LL. We have f:IR > R: such that rg piel (2°+2" ifxz0_ | 2°! itrz0 2°" og 2 fee 2 log? ifx20 2* log 2+(-2" log?) ifx<0~ [log 2(2"-2") ifr<0 = f= | + fi)> 0x20 and fx) sf x > +90 and f(t) >0 VER 18 | Mathematics-XIl: Term-1 «= fis an into function, <. a) is one-one and into function. Option (6) io correct. 12, We have n(A) = 5 and n(8) =6 <, Number of one-one mopping from A to B = 6! As n(A) < n(B) = There is no onto function from A to B. ie, number of onto function = 0. -. Number of one-one and onto functions from A to B= 0 Option (0) is correct 13. f:Z + Z givenbyfix)=x42 One-one For, ¢Zsuchthatxy#x > 1 +2%x)+2 = fo) +e) = fis one-one. Onto Let y = Z (cordomain) such that foley > xt2=y 3 x=y-2 For y = Z (co-domain), 3 x= y-2€ Z (domain) such that fis)=fly-2)=y-242=y = fisonto As fis one-one and onto. => fis abijective function. Option (b) is correct. 14. Given that, fw Let y {x= 24 >: T y-120,y Range = [1, 2) Option (0) is correct. 18. Let lx) =17 = x7 +1=17 > x= £4= Preimage of 17 are [4,—1} and let ix)=-3 > P+1=3 = x= a7. b> 6anda=-2 = (68)ER as8>6and6=8-2 Option (6) is correct. 18. fis not one-one because FCD=CH=16 FQ)=(2)*=16 ie, ~2and2 €R (Domain) have same fimage in R (codomain) 4.which is not true and hence -3 has no pre image = fis not one-one. Relations and Functions | 1920 Also ffx) = x4 never achieve negative value. => All negative real number of co-domain R have no pre-image in Domain R. = fis nol onte. Hence, fis neither one-one nor onto, Option (a) is correct. 19. fis one-one because fls,) = fle.) = 3x, = 3, 3 =H VIER (Domain) Also fis onto as Letfx)=y = See axed "3 eR (domain) Vy ER (codomain) 3x such that fx) = 4 => fix) is onto ‘Therefore, fis one-one onto, Option (a) is correct, 21. Let xe the pre image of 5 = fe) =5 a reiss Sea y xtey = rs42 4, preimage of 5is-2, +2. Similarly if rbe preimage of -5 =f) =-5 ax =W6 x=tV-0ER 4, No real number is pre-image of ~ 5. Hence $ is the primage of 5. Option (2 is correct, 22. To find out the domain of f, we have to find out that value of x for which f(x) is real. = v-420 (+2)(r-2)20 (+2) 20,(r-2) 2 Oor(r+2)<0,(r-2) <0 22-212 2orrs-2,152 x2 2orxs-2 Domain of fis (2, -2]U22, =) Option (0 is corzect 2B. 2) + AO) + f2) +f) =-2 404441: Option (0) is correct guaug 24, As R is reflexive relation on A, and for being reflexive (@,a)E RV ae A Mathematics-XiI: Term-127. ‘Therefore, the minimum number of ordered pair in R is 1. smn Option (@) is correct. Given function is f(x) = log ,,, (17-1) Ttis obvious that fa) is defined when 22—1>0,342>Oand 34x # 1 Now, x*-1>0—x7>1 Sxc-lorrst Beer 0axe Bex¢iare 2 ‘Therefore, domain of the function f(x) = (-3,-2) U (-2,=1) U (1, 0) Option (c) is correct. From definition of onto function, Range of function = Codomain of function = [0, 3) = 0 > OS Gt eta) co = ttytas0 VeER Hence D<0 = Yo4a<0 => 4221 = azt 2a Hi = aelz~) Option (8) is correct. Wehave, F:R—+ Rand g:R— R are such that 0, x€rational jx, 1 € irrational fo) (0, x € irrational ana 90 ( Crotma 2. (fg): RR such that, _ [+s xe rational 2000 [ Sant From definition of (f—g):R— R, it is cbvious thal, each rational number of domain of {F-g) (2), associate to its negative rational number in codomain /range and each irrational number of domain of (f= g) (2), associate to same irrational number in codomain/range = For each x € Domain of (fg) (2), there is only one value in codomain/ range of (fg)(a) Hence, (f—g) (2) is one-one onto. Option (a) is correct We have set A= {1,2,3, 4} & relation R= (1,2), Dona Relations and Functions | 213. 92. As for (a,b) R,3(b, JER such that OER. Hence R is transitive So (b) is correct option. Option (1) is correct. *1A|=4,1B|=5 so there does not exist one-one and onto *:|B|>|Al so it is not onto. So (a) is correct option. Option (a) is correct Number of onto functions are given by B-7¢, 2-17 +76,2-2)° =8-2x1+0=8-2=6 Option (c)is correct. Number of one-one function = Baa Option (c) is correct Number of one-one and onto function from A to Bvhere [A= risk Number of one-one onto function = [4 = 24 Option (is correct [Note: One-one onto function (bijective) from A to B is possible if A and B have same number of elements.] Let R be a relation on the set of all intergers Z,, defined by ab a> ba, bEZ {i) Reflexive: For 1¢ Z 1 Ras ¥1s0(1,1)¢ R= R isnot reflexive on Z {id Symmetric: (3,2) Ras3>2 But Q,3)¢ Ras2¥3 Hence R is not symmetric on % {iii) Transitive: Let (@, 6) € R and (b,c) € Ra>band b>e Now a>b>c=a>c= (a,)ER Hence R is a transitive relation on % Option (6) is correct. fay= aan One-one Let xy, € R (domain) such that 44h meg giily gy gil = fey) # fee) fis one-one 22 | Mathematics-Xil: Term-1 _a ‘Onto For 0 R (Co-domain) there is nox € R (domain) such that fx) = 0. «. fis not onto Range of f= R-(0}R Hence fis one-one into function, Option (a) is correct. For onto function, we have : x Co-domain = Range =0 0] We are given that (Foxy? — 4FCF' (+ F =O oy HO 164 (oy AQ) Ge) = FET _ fl) + 2V3 fe) ca =Fay2 V3) a f@n Fay = 249) Integrating, we get = log f(x) = (24 ¥3)x+C fla) = eB DC we 66 AAV gE where 0 > flax) = NaBH = NAHI, polve Option (6) is correct. f(x) = tan fla) is one-one and onto ie, FC) > Dor F(X) <0 and condom: B=f(-1,1)=@tan(-1),2 tan) Relations and Functions | 2324 -(e(-Hoe9)-(-4 Option (is correct Let fO=y=TyVVER YER Tex %I-x Here range of f(x) is R~(-1,1) But y can not have any of the values =1, 1 for some x is one-one "fay = + f(4) is not an onto function. Option (c) is correct. Number of onto function =3*-3¢, (3-18 +7C,8-2)6 -*c, B-3)* 9-3 x 43x 1-3-3 x 243 3x (3° - 2°41) = 3(243 - 64+ 1) = 3x (244 64) = 3180 540 Option (1) is correct. As (7,7) R, so R can not be reflexive Again (7,8) € R but (8,7)# R,s0 R is notsymmetric. As (7,8),(8,8) © R=9 (7,8) © R= R is transitive. Option (o) is correct. Let A= {1, 2,3, on 12}, n(A) = 12 (bay m) B={1,2,3,.., 11}, m(B) =11 (say 1) .. Total number of function from A to B= 11! Sey ‘oe ". Number of onto functions from A to B nt of 2" in m! (e"=1)!" Putting m = 12,0 = Iand r= 1, 2,3, .. 11. The number of onto functions is given by yg ent 2a caylne,s! +E DMG, 102+ 1)'MC, 1 cyte, to! +Me,g!24..+Mc, 32 _Me, 2 4Me, 12 cy? "ets" Cg +... MCS Me? eMC I? Also, coefficient xin 121 (e"=1)!" = covffici én 121(14 = coefficient of in 121(1 + 2 in a( = coettcient of: in 12 = coefficient of x"? in 12! = coefficient of vin waft +(3 Mathematics-XiI: Term-1a7. 51. 35. = coefficient of x in 121 = coefficient of xin sabe xt 2 Total number of functions which are not onto = 11"? — Option (A) is correct “fle f= xy" (i) 1 Replacing x by 5 we have from () flex fay =A x4) = tral -—! 8, pgp I= Fie FOr = a ieee + Put y= LO)" = Fay = Fay = fy =a syay- le) ‘ 7 Gor =15 4) =fy=y¥" Replacing y as x, we have fay=2” (i) efor” Let y= pas y= tt” flr.D= 28 = flay Now from (ji) and (ii), we get a axes: boa (id x = baal Option (6) is correct Number of relations that can be defined on 4 = 2"" Option (¢) is correct. We have R = {(a, a), (b, 8), (6 Oe (6,0, (a, 0) For (6,0) R, but (6,0) RK Hence R is not symmetric. Also for (a, 1), (0,c) ER but (a,c) € R. => Risnot transitive. As (aa) RVAEA Hence Ris reflexive. Option (@) is correct. Let A= {1,2}, B= (a, 6) Relations and Functions 2526 57. Let R={(1,4), (1, ), (2, a), (2,b)) Clearly R isa relation from A to B Bul Ris not a function. As (1,4), (1,8) © Rand (2,4), 2,6) © R Option (H) is correct. R=(Q,2,4= (1,23) Clearly R is neither reflexive nor symmeteie. As (1,2) € Rbut 3 (2,) € Riorb © A such that (1,b) ER. Hence R is a transitive relation on A. Option (#) is correct. R= (a,b): d Reflexive Clearly (4,0) © R VWER Hence R is reflexive. Symmetric “QIER but (1,2) ER Hence R is nol symmetric, ‘Transitive Let (,B) and (b,c) © R => azbandb>c = ate Hence (@, b) and 6) ER=3(4,)ER > Risa transitive relation on R Option (t) is correct. Renu): [e-¥| <7} R={(1,1), 2,2), 8,3), 4 4), (5,5), (1,2) (23)) Option (@) is correct. a Mathematics-XiI: Term-1