Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
30 views

Relations and Functions

Uploaded by

Aslam
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
30 views

Relations and Functions

Uploaded by

Aslam
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 14
CONTENTS S.No. Chapters Page No. PART-1 [Important Terms and Concepts, NCERT Questions, NCERT Exemplar Problems, Solved Question Bank, Practice Question Bank, Integrated Exercises, Assess Yourself] {UNIT-I] RELATIONS AND FUNCTIONS ~~» 1. Relations and Functions .. 2. Inverse Trigonometrie Functions {UNIT-1T] ALGEBRA ws 3. Matrices .. 4. Determinants .... (UNIT-IN CALCULUS Continuity and Differentiability.. 6. Application of Derivatives. 1.99 = 126 7. Integrals, 127 - 184 8. Application of Integrals 185 - 193 194 - 215 9, Differential Equations «. (UNIT-IV] VECTORS AND THREE-DIMENSIONAL GEOMETRY 10, Vector Algebra . 216 + 234 11, Three Dimensional Geometry (10) {UNIT-V] LINEAR PROGRAMMING ee eee tT 787) 247 - 252 12. Linear Programming (UNIT-VI] 13. Probability 253 - 216 ‘+ Solutions to Practice Questions and Integrated Exercises of all the Chapters .... 277 - 426 Assess Yourself'— Solutions available at gowebrachnasagar.com PART-II [Practice Papers] 428 - 451 ‘+ Practice Papers | ~ 2 (Solved)... 482. - 492 ‘© Practice Papers 3 ~ 10 (Unsolved ~ Solutions available at gowebrachnasagar.com). (ty LEARNING OUTCOMES IMPORTANT TERMS AND CONCEPTS IN THE FORM OF FLOW CHARTS, WHEREVER POSSIBLE SOLVED oO Question Bank including * Previous Years’ and Important Questions NCERT Questions + NCERT Exemplar Problems + Questions Issued by Directorate of Education (DoE) + Very Short (Objective Type) / Short Answer Type + Long Answer Type Questions + Higher Order Thinking Skills (HOTS) Questions + Competency/Case-Based/Passage-Based Integrated Questions PRACTICE ° Question Bank including * Pre + Very Short (Objective Type) / Short Answer Type us Years’ and Important Questions * Long Answer Type Questions * Higher Order Thinking Skills (HOTS) Questions * Competency/Case-Based/Passage-Based Integrated Questions INTEGRATED EXERCISES ASSESS YOURSELF WITH ANSWERS (Solutions available at gowebrachnasagar.com) CHAPTERWISE SOLUTIONS TO PRACTICE QUESTIONS AND INTEGRATED EXERCISES Unit-I : Relations and Functions | Relations and Functions LEARNING OUTCOMES By the end of this chapter, students will be able to: «learn about different types of relations + learn about finding equivalence class related to a given relation + learn about different types of functions + lear about different functions and invertible functions REFLEXIVE, SYMMETRIC, TRANSITIVE AND EQUIVALENCE RELATIONS Arelation in set A is a subset of A x A. We also write it as A = {(a,b) © A x Al afb}. For relation R in set A, A" is inverse relation #f aft%b => DR ' 1 y ‘ Relation fon set ArelatonRonsetA said tobeanemply A relation A on set Ais called a Aelaton onset Ais cle an dentty ‘A's a subset of relation ora vod relation ino element of universal lation if each element relation if each element of Ais related AXA, sets réated to any element f sete. of A is related fo every element to tsof only. 1. aa, va eA, we write ie R:A>A = R=6. OA ie R=AX A Rel, SS ————— t 1 1 Reflexive Relation: Symmetric Relation: Transitive Relation: ‘A relation Fin a set A Is sald to be reflexive, if ATelaton Rina set Ais said tobe symmetric, A relation in a setAis sai to be transitive, @, a) € A, for every a € A or we say afa, for If (a,b) «R= 0 a) © A, for al it a,b) < Rand (b,c) © A evarya = A. 2D © A, We can also say ab = OFa, => 0) R, treeya, b,c eA Note: An identity relation is reflexive relation but for every a, Dc A, ‘We can also say reflexive relaon may of may not be identity relation. aR, BRe = af, forall a b, 0 I, Ll, Not true Symmetric, tre as f,R ly => 1, R h Transitive, false a5 J Rly R [y= 1y||- Rly T, : 6,8, 10; T,: 4,7, 9 and a relation R in set of triangles defined as R= {(4,,4,): A, is similar toA,)- Which triangles belong to the same equivalence class? (@ T,andT, (6) T, and 7, (© Tand 7, — @ T,and 7, (6, T, and 7; are similar as ther sides are proportional Given set A ={1, 2, 3} and a relation R = (C1, 2), @,1)}, the relation R will be (@) reflexive if (1, 1) is added (6) symmetric if (2, 3) is added (6) transitive if (, 1) is added (@) symmetric if @, 2) is added (©, here (1, 2) € RQ, 1) € R, if transitive (1, 1) should belong to R. Given set 4 = {a, b,c}. An identity relation in set Als © R= (Gd, 0} ) R= (4,0), (b, 6), (6,0) (©) R= ((a, 0), (6, 8), (6, 0, (4,09) @ R= (6a), (6,0), (@, a} (@), A relation Ris an identity relation inset 4 if for alla c 4, (aa) R. "A relation S in the set of real numbers is defined as xSy=>.x—y+ /3 is an irrational number, then relation S is (a) reflexive (0) reflexive and symmetric (@ symmetric and transitive (a), reflexive, true as x Sx => x—x+ 13 = V3 is an irrational number. (©) transitive Symmetio,filse eg. = 73, xSy=> V3 2+ V3 = 273 ~2 is an irrational number, but Sx => 2~ V3 + V3 =2 isnot an irrational number. transitive, filse eg x= 14 3, y=5,2=2V3 xSy 31+ J3- 54 ¥3 = 203 -4 isan irrational number yz 5-2V3 +13 number, ~ J is an irrational But x8: => 1+ /3 - 293 + V3. irrational number. Sol. Ex. 8 Sol Ex.9. Sol. Ex. 10, Sol. Sol Ex. 12, Sol. Ex. 13. Sol. |. Let R be a relation in the set of natural numbers NV defined by R= f(a, ) ©. N* N: a aa, not tue. Let be any nonempty set and PU) be the power set of A.Arelation R defined on YA) by XR Ve XO Y=X, X, ¥ © P(A), Examine whether R is symmetric. XRYOXOY=XSVOX=X RX. Hence, symmetric. State the reason for the relation R in the set {1,2,3} given by R= {(1, 2), (2, 1)} not to be transitive. INCERT; Dethi 2011] (2) € 22 Ne R bull, DER Show that the relation R in the set {1, 2, 3} given Dy R= {(1s1), (2,2), (3,3), (1,2) 2,3} is reflexive but neither symmetric nor transitive. |\CERt| Given R= (1, 1),(2,2).@,3).(1,2).2, 3)} defined on RB: {12,3} > (12,3) For reflexive: As (1,1), 2.2), Hence, refiexive For symmetric: (1, 2) € R but 2, 1) € R. Hence, not symmetric. For transitive: (1, 2) © R and (2, 3) © R but (1,3) € R. Hence, not transitive Let A = {3, 4,5} and relation 2 on set 4 is defined as R= {(a, b) © AA: a~ b= 10}. Is relation an empty relation? We notice forno value of a,b < 4,a~6= 10, Hence, (a,b) @ R fora, b © A. Hence, empty relation Given set A {a,b} and relation R on is defined as R= {(a, 2), (6,6). Is relation an identity relation? Yes, a8 (a, a) € R, forall a € A DER, Let set A represents the set of all the girls of @ particular class. Relation R on A is defined as R={(a, b) © Ax A: difference between weights of a and & is less than 30 kg}. Show that relation Ris a universal relation Let a, 6 © A then a ~ 6 < 30 kg, always true for students of a particular class, ie. aRb ¥ a, b ¢ A. Hence, universal relation, If A= (1, 2, 3} and relation R= {(2, 3)} in A. Check whether relation X is reflexive, symmetric and transitive, Not reflexive, as (I, 1) @ Not symmetric, as (2, 3) © R but (3, 2) ¢ R ‘Transitive, as relation R in a non empty set containing. ‘one element is transitive. Long Answer I / Long Answer II Type Ex. 14. Sol Ex. 15. Sol Ex. 16. Sol, Let T be the set of all triangles in a plane with R ion in T given by R= {(Ty T,): 7, = T3)- Show that R is an equivalence relation. (SCF | Given R= (7,7) € TXT: 7,2} For reflexive: (7,, 7;) € R is true as 7, = 7) for all T, € T (ic. triangle is congruent to itself). Hence, R is reflexive, For symmetric: (7,, 7,) € R= 7, (Ty T,) € R. Hence, R is symmetric. For transitive: Let (7,, 7;) € Rand (T,, T,) € R = 1,=T,and 7,27, STeT > MHeR Hence, R is transitive Since R is reflexive, symmetric and transitive. Hence, Ris an equivalence relation. Show that the relation S in the set R of real numbers, defined as $= {(a,6): a,b Randasb"} is neither reflexive, nor symmetric, nor transitive. INCERT; HOTS} Given $= {(a, 6) R* Rl asd} We can consider counter example. For reflexive: Let (-2, -2) ¢ S=>-2< (2)? => -2<-8, false, Hence, not reflexive. For symmetric: Let (-1, 2) ¢ S=>-1.< 2)? => -1<8imue, If symmetric then (2,1) < S => 2 (C1) => 2<-1, false, Hence, not symmetric, For transitive: Let (25, 3) € Sand (3,2) € 5 => 25 < (3) and 35(2? = 25 $27 and 3 <8, true in both cases. If transitive then (25, 2) < S = 25s (2) = 25 <8, false Hence, not transitive. Let Z be the set ofall integers and R be the relation on Z defined as R= {(a, 6) : 4, b Zand (a~ 5) Is divisible by 5}. Prove that R is an equivalence relation. R= {(a, 6): a~ bis divisible by 5 and a, b € Z} For reflexive: (a, a) ¢ R => a~a~ is divisible by 5, true for all a € Z. Hence, relation R is reflexive. For symmetric: Let (a, 6) € R => a— bis divisible by 5 = b~ais divisible by 5 = (b,a) ¢ Rfora,b Z. Hence, relation R is symmetric. ve: Let (a, b) € Rand (b, c) € R, for Ex. 17. Sol. Ex. 18, Sol Relations and Functions 15 = (a~D)is divisible by Sand (6 ~c) is divisible by 5. = (a— 6) + (bc) = (a~ 6) is divisible by 5 [-+ if numbers are divisible by 5, then their sum is also divisible by 5] Sader As(a,b) © Rand(b,c) €R Sacer Heace, R is transitive. As relation R is reflexive, symmetric and transitive Hence, relation R is an equivalence relation, Let N be the set of all natural numbers and let R be a relation on NN defined by (4,6) R (¢,d) = ad= be for all (a,b), (c,d) NN. Show that R is an equivalence relation on Vx N. IHOTS| Relation R is defined by (a, b) R (c, d) 2 ad = be for all (a, 6), (¢, 2) € Nx N. For reflexive: (a, b) R (a, 6) <> ab = ba, which is, true in N. Hence, reflexive. For symmetric: (a, b) R (c, d) © ad = be <2 cb ~ da & (c, d) R(a,b). Hence, symmetric. For transitive: Consider (a, 6) R (c, d) and (ed) Ref) <9 ad = be and of = dee adel = berde & af = be © (a, 8) R (ef. Hence, transitive, Since relation Ris reflexive, symmetric and transitive Hence, relation 2 is an equivalence relation. IER, and R, are two equivalence relations in a set A, show that R, © R, is also an equivalence relation. INCERT] Wehave RR, = {(a,)| (a,b) € R, and (a, 6) € R,} For reflexive: Let a ¢ A, then (a,a) € R, and(a,a) € Ry = (aa) € RO Ry, Hence, reflexive, For symmetric: Let (a, ) © R, OR, = (a,b) © R, and (a, 6) € Ry = (bya) © R, and (b, a) © Ry (as R, and R, are equivalence relations) 3 (6,4) ROR, Hence, symmetric. For transitive: Let (a, ), (0) € RO Ry = (a,b), (b, 0) © R, and (a, 6), (B, 6) © Ry = (a,0) € R, and (a, 0) € Ry (2 R, and R, are equivalence relations) S@OER AR, AS (a, 0). (6,0) © ROR, > (a, 0) € R, 0 Ry, So, transitive Since relation R, © R, is reflexive, symmetric and transitive. Hence, R, O.Ryis an equivalence relation. 16 Together with® Mathematics—12 Ex. 19. Show that the relation R in the set of real numbers, defined as R = {(a, b) : a < 6%} is neither reflexive nor symmetric nor transitive. 1 Sol. Ex. 20, Sol. INCERT] For reflexive: Let a + 4s ft ice (aa) © R= L=(4) > p<}, false Hence, not reflexive. For symmetric: Let (-1, 2) € R as 1 s (2), te Now 2,-1) ¢ R= 2S (1) = 25, false, As(-1,2) € R2 (2,1) € R, Hence, not symmetric. For transitive: Let 6, 3), 3, 2) © R as (6,3) eR 365 G56 9, tne G,2)eR=>3< QP 9354, me wwe have to show, (6, 2) € R = 6 (2)! > 6 <4, false. So, not transitive Lot A= (1, 2,3, mm 9} and R be the relation in AXA defined by (4, 8) R (cd) ita + d= b + 6, for (a,b), (esd) € AXA. Prove that R isan equivalence relation, also obtain the equivalent class ((2, 5)]- INCERT Exemplar; Delhi 2014] For reflexive: Let for (a, 6) €4 * A (a,b) R(a, 6) > a+ b= b+ a, tue, Hence, reflexive For symmetric: Let for (a, 6), (¢, d) «A * A (5) Rid > atd=b+e Sct b=d+a=> (6d Rab) Hence, symmetric. For transitive: Let for (a, 6), (c,d, (ef) © 4 * A => (a, 6) RG, d) and (c, A) R(e = atd-btemdctf=dte Batdtetfabtctdte Satfabte>@bRE/, PRACTICE QUESTIONS Very Short (Objective Type) / Short Answer Type Let Z be the sot of integers and R be a relation defined in Z such that aRb if (a — b) is divisible by 5. Then number of equivalence classes are (a2 3 @4 is Let R be a relation defined as R = {(x, x), (9). 2) (x, 2)) im set A = (x, y,2} then relation 2 is (2) reflexive (®) symmetric (0) transitive (A) equivalence TPR = (x,y) :x +2) =8) isa relation on W, then range of Ris [ar 2014) @ 8} (©) (1,23) (©) ,2,3, 0 8 @ 0,3 Ex. 21 Sol. . For the set Hence, R is transitive As R is reflexive, symmetric and transitive, hence R is an equivalence relation. 1f (a, b) & equivalent class (2, 5)] then (a, 8) R2, 5) = atS=b+2eg.a=1,b=4 = (1,4) (2. 50] = {, 4), 2, 5), 3, 8), 4, 7h (3, 8), 6, 94 Show that the relation R defined in the set A of all triangles as R = {(7,, T,) : 7, is similar to 7;}, is ‘equivalence relation. Consider three right angle triangles 7, with sides 3, 4, 5; T, with sides 5, 12, 13 and T, with sides 6, 8, 10. Which triangles among T,, 7, and T, are related? [NCP IT] A : set ofall triangles and relation R is R= (I, T,) €A* A:T, ~ Ty For reflexive: For T, ¢ 4 (1,7) €R>7,~T, which is true as every triangle is similar to itself Hence, R is reflexive. For symmetric: For T,, 7, € A 1,~h>T~T (Ty TeR Hence, R is symmetric. For transitive: For T,, TT, € 4 Let (Ty, T,) € R= T,~ and (T,,T,) € R=>T,~T, From geometry, we notice T,~T,and T,~T, = 7,~T, S,TER Hence, relation 2 is transitive. Asthe relation Ris reflexive, symmetric and transitive. Hence, relation & is an equivalence relation. In triangles 7,, T,, Ty triangles 7, and 7, are related as sides 3, 4, 5 and 6, 8, 10 are proportional (Grom geometry) Let 4 = {a, b,c}, then the total number of distinct relations in set 4 are (a) 64 (6) 32) 256 (S12 Consider set A = (1, 2,3} and the relation R= {(1,2)}, then R is a transitive relation. State true or false. Every relation which is symmetric and transitive is reflexive also, State true or false. . Let R be a relation in set N, given by R= ((a,b):a=b~2, b> 6} then (3, 8) € R. State ‘rue or false with reason, (1,2, 3}, define a relation R in the set 4 as follows: R= ((1, 1), 2, 2), (3, 3), (1, 3)}. Write the ‘ordered pairs to be added to R to make it the smallest equivalence relation. INCERT Exemplar] 9. Let R= {(a, a°) =a is a prime number less than 5} be a relation, Find the range of R. [Foreign 2014] 10. A relation in a set 4 is called relation, ifeach element of 4 is related to itself [CBSE 2020] 11, Let set A= {1, 2, 3}, define relation R on A as R= ((a,b) Ax A: a+b <6}. Show that Ris a universal relation 12. Check whether the relation R defined on the set (1, 2, 3, 4} as R= {(a, ) : b= a + 1} is transitive. Justify your answer, 2021 (©1 Long Answer I / Long Answer II Type 13, Prove that the relation R in the set A = {5, 6, 7, 8, 9} given by R= {(a, d) : ja ~ b| is divisible by 2}, is an equivalence relation. Find all elements related to the clement 6. [Foreign 2013] 14, Let P be the set of all the points in a plane and the 17 Relations and Functions distance between points A and B is less than 3 units} Show thatthe relation R is not an equivalence relation. 15. If the relation R on the set A = {x : 0x < 12} given by R= {(a, b): a=) is an equivalence relation, then find the set of all elements related to 1. {2021 (©)| 16, Prove that the relation R in the set A = {1, 2, 3. 4, 5} given by R = {(a, b):| ab] is even}, is an equivalence relation. Show that all the elements {1 3, 5} are related to each other and all the elements of {2, 4} are related to each other. But no element of {1, 3, 5} is related to any element of (2, 4}. [NCERT; DoE; Chennai 2015] 17. Check whether the relation R defined in the set A= (1,2,3,4,5,6} as R= ((@, 1) b= a+ I is reflexive, symmetric or transitive. INCERT] 18, Show that the relation R in the set 4 of points in a plane given by R= {(P, Q): distance of the point P from the origin is same as the distance of the point Q from the origin}, is an equivalence relation. Further, show that the set of all points related to a point P (0, 0) is the relation R in set P be defined as R {,B)eP «P| cirele passing through P with origin as centre. [NCERT] ONE-ONE (INJECTIVE) FUNCTION, ONTO (SURJECTIVE) FUNCTION, ONE- ONE AND ONTO (BIJECTIVE) FUNCTION One-one (injective) function: Afunction fA —>B is sai to be one-one (or injective) if the images of distinct elements ofA under the rule fare distinct in, Le. for every a,c A, a+b —> f(a) = 100) ‘r we can also say that fla) = f(b) => a = Onto (surjective) function: CEES i 8 ‘Afunction > Bis sad tobe onto (or surjective), itevery element of is the image of some element E of A under the rule f, ie. for every b « B, there tists an element a ¢ A such that fa) = Note: A function is onto i and ony if range off : ne-one and onto (bijective) function: A function f: A -> Bis sald to be one-one and onto (or bijective) i is both one-one and onto, SOLVED EXAMPLES Very Short (Objective Type) / Short Answer Type Ex. 1. Set 4 has 3 elements and the set 8 has 4 elements. ‘Then the number of injective functions that can be defined from set 4 to set Bis (@ 144 () 12 (@ 64 Sol. (c), total injective mappings/functions =P, (© 24 Ex. 2, Consider the set 4 containing 7 elements, then the ‘total number of injective functions from set 4 onto itself is Sol. Total number of injective functions from set containing ‘elements to a set containing n elements is"P, = n! Ex.3, The domain of the function f: R -> R defined by foxy = Va= x is Sol. [-2, 2]. For domain 4-7 20> 42 ox? <4 = Ps Qo 25x52 10.122) 18 — Fagether week? Mathematics—12 Ex4. Ex 5. Sol. Ex. 6. Sol. Ex.7. Ex.9. Sol. Ex. 10, Sol. Let 4 = {a, b}. Then number of one-one functions from A to A possible are @2 4 or @3 (a), as if n(4) =m, then possible one-one functions from 4 to 4 are m! Let 4 = {1, 2,3, 4) and B= {a, b,c). Then number of one-one functions from A to B are 0, as m(A) > mB) Let set X = {1, 2, 3} and a relation R is defined in X as: R= {(1, 3), (2, 2), 3, 2)), then minimum ordered pairs which should be added in relation R to make it reflexive and symmetric are @ (0,0, @, 3), 0,2) ©) {G,3 B,D. 0,2} © (0, D,G, 3, D, 2,3} @ (1,0, B, 3B, 0, (1,2)} 0 Let A= (1, 2,3}, B= (4, 5,6, 7} and let f= ((1, 4), (2, 5), @, 6)} be a function from 4 to B. State whether fis one-one or not, [Ar 2011) ICBSE 2021) L. One-one, as for x, # x, = flr) # fle) Let fe R> defined by f(x) = |x | Is function Fonto? Give a reason. IMors} |. fis not onto, as for somey € R from co-domain, there isno x © R from domain such that y = lx), ¢.g. for = 2. R (condomain) there is nox € R (domain) such that fx) ~-2, i, ni =-2. Hence, nt onto Prove that f: R-» R given by f(x) =2° + Lis ‘one-one function. Given f(x) = +1 For, +, = & aptlex+1 => flx,)# fla). Hence, one-one ‘Show that the Signum F Life>o 0, if x = 0 ismeither one-one nor onto. HL if <0 INCERT] ction f: R > R, given by f)= | Lifr>0 0, ifx=0 Given function is f(x) = 1, if x <0 => Range of function is {—1, 0, 1} and eo-domain is set of real numbers B. Ex. I, Sol. => Range & co-domain, ‘There is atleast one element in R(€o-domain) which is not image of any element of the domain, e.g. for 2 € R(co-domain), there is no x in domain such that f)=2, eR. Hence, function is not onto, Also, let, =2 and.x, =3 then /(x,) = 1 and fo ie, x, # x = fly) =for). So, function is not one-one Given fo) for 9 (0, =) ( sin x check if function fis one-one Given fle) = sin x OE Zeon Then Az) = sin = 4 and (5) ~ sin5®- 4 as Ee Sout E) Hence, not one-one (iy Por (4.3): Let ay ay e (FF then x, # a, => sin, # in. => flo) * fey), Henee, one-one. Long Answer I / Long Answer II Type Ex. 12. Sol. Let 4 = R~ {3} and B= R— {1}. Consider the function f: A> B dened by fe) = =, Show that fis one-one and ont. UDethi 2012 r-2 Given, 4 = R~ (3}, B= R~ {1} and fis) For one-one: Let for xj. € A, u As Hence, fimetion is one-one. For onto: Let for y € B, there exists x € A such that yo fs) = y= A= = w-3yax-2 > ay-x = W-)=3y-2> Hence, onto Ex, 13, Show that the function f: R~ {0} > R—{0} defined 1 is one-one and onto. Is the result true, py f= 4 if the domain R — {0} is replaced by N? Sol. Given f: R~ {0} > R— {0}, defined by fx) = + For one-one: Let for x,y € R— {0}, (domain), fo = tat Sa) = fo) 1 > x=, Henee, one-one For onto: Let y <¢ R ~ {0} (co-domain), then there rust existsx € R ~ {0} (domain), such that f(x) = » a teysx Zo hence fory eR, there exists unique + € R- {0} Hence, onto. If domain is replaced by N then for y (<0) « R~ {0} we must have x € NW such that y= f(x) => y= 4 sxe 7 <0 € N, So, result is not true if domain is replaced by N. ex. 14, Show that: N > NV given by jective (both one-one a [xtbitxisodd 5, med ane and onto). INCERT; Delhi 2012} PRACTICE QUESTIONS ‘Very Short (Objective Type) / Short Answer Type 1. Ifm(4)= p, then number of bijective functions from set Ato A are (ap ) P fp @ ph 2. What is the domain of the function cos !(2x — 3)? Orn ©) 2 © C1, (@ [1,2] [cBse 2021} 3 Hfto)= =H aG0 1) R bon ange of is OH OH} OR @) 4. IER= ((s,y); x,y € 2x2 +)? <4) isa elation in set 2, then domain of R is (@) {01,2} © {0,-1, -2} (0) (-2,-1,0,1,2) (@) (-1,0,1) 19 Relations and Functions x41, if xisodd. Sol. Given funtion f= f° +P ETO For one-one: (0 Let xy x, € Nand x, x, are both even Le fl) 4/65) (ii) Let sx, € Nand x1, are both odd nencrtlent! fe) 4f6) (ii) Letxy x, € Nandy, isevenandx, iso, Then, x, Also, f(x,)=x,~ I (odd) and f(z) =x,+ 1 (even) Ssepefey In all the three enses x, 2X5 aS ly)A ser). Hence, function is one-one, For onto: Let € N (co-domain) yey seay ley Ify is even syartlox=y-1eNGomain) fy-Yay-1h Ify is odd Syar-lax=y+1 © Gomain) Sot D=ytl-tay . For every y © 1 (co-domain), there exists x € N (domain) such that y= fx). Henee, function is ont. + f'is both one-one and onto. 5, The function f: R» R defined as f(x) = [x], where [x] is reatest integers x, i oto function, State (ue oF false Let fi > R be defined by fls) = 2 Is f one-one? IDoE 7, Show thatthe modulus funetion f: R -» R, given by ‘fls)= jis neither one-one nor onto. (NCERT Long Answer I / Long Answer Il Type 8, Let fix)= jar x #-l, then find the value(s) of a for which fofis identity function a © {/2,-V2,1,-1} 9, Show that the function f: R ~ (-1} -» R~ {1}, given by fo = Fp a bijective function 10, Show that the function f in A = R— {3} defined as 443 fay= 24 is one-one and onto. {Panchkula 2019; Delhi 2013] 20 Together with? Mathematics—12 INTEGRATED EXERCISE ‘Very Short (Objective Type) / Short Answer Type 1. Let the function ‘f” : V > N be defined by Aix) = 2x +3, x © N. Then ‘f is (a) not onto © bijective function (©) many-one, into funetion (d) none of these 2. A relation defined in a non-empty set 4, having n elements, has (2) n relations (@) 2 relations (©) W rel Is (d) 2” relations 3. A relation & in human beings defined as = ((a, 6) a,b © human beings ; a loves 5} is (@) reflexive (©) symmetric and transitive (6) equivalence __(d) neither of these 4. A function f: R > R is defined as fix) =? + 1. Then the function has {CBSE 2021) (@) no minimum value (®) no maximum value (6) both maximum and minimum values (@) neither maximum value nor minimum value 5. Let A = {a, b,c} and the relation be defined on A, as follows: R= {(a,q), (b,€), (a, 6)}. Then, write minimum number of ordered pairs to be added in R 10 make R reflexive and transitive, INCERT Exemplar] 6. Given set A= {a,b,c}. Isrelation R= {(a,)} transitive? 7. Prove that the Greatest Integer Function f: R > R, given by f(x) = [x] is neither one-one nor onto. Where [e] denotes the greatest integer less than or equal to x. INCERT] 8 Leta = {1,2, 3), B~ (4,5, 6,7} and let £= {(1, 4), 2, 5), G, 6)} be a function from A to B. ‘Show that fis one-one, INCERT] 9. Let f: N+ N be defined by f(x) ~ 3x. Show that fis not onto function. IHOTS} Let the function f: R + R be defined by f(x) = cos x ‘YX R. Show that fis neither one-one nor onto. INCERT Exemplar] 10, Long Answer I / Long Answer II Type Il. Let L be the set of all lines in XY plane and R be the relation in L defined as & = ((L,, £3): Ly is parallel to £,}. Show that R is an equivalence relation. Find the set of all lines related to the line y = 2x + 4, [NCERT] 12. Let A = {x ¢ Z:0 B be defined by R = {(1, 1), (1,2), (2, 2), B, 3), (4, 4), GS, 5), (6, 6)}, then R is () Symmetric (ii) Reflexive and Transitive (ii) Transitive and symmetric (i) Equivalence 21, Aclass teacher wants to make different groups of students so that they can be given different tasks of enlighting other about the effect’s of COVID-19. Students are making groups with friends but the teacher ssid not like this, we will make a group of students with roll number in such a way that the difference of roll number is divisible by 3, Based on the above information, answer the following questions. (a) Name the properties which whole group should satisfy to get divided into different groups equivalence classes) (b) Provide the relation forthe roll number of students in the group of student with roll number 5. (© Which roll number students will be inthe group of students with roll number $ if there are 30 students in the class? (d) Provide the relation forthe roll number of students in the group of student with roll number 2. (©) Which roll number students will be inthe group of student with roll number 2, if there are 20 students in the class? 22 Tagecher with® Mathematics—12 ASSESS YOURSELF 1, Let f: R~ (2) > R~ {1} be a function defined by Ses) = =}, then fis (@) into funetion (8) many one function (0) bijective function (d) many one, into function 2. The relation R in the set of real numbers defined as = {(a, 6) © Rx R: 1 +ab>0} is (@) reflexive and transitive (®) symmetric and transitive (0) reffexive and symmetric (@) equivalence relation 3. Lethe function ‘/* be defined by fx) = Sx? +2, Vx € R, Then ‘fis (@) onto function (8) one-one, onto funetion (©) one-one, into function (@) many-one, into function 4. State the reason for the relation R in the set {1, 2, 3} given by R= {(1, 3), G, 1)} not to be transitive. 5. Show that f: RR, given by fx) = 32 + 1 is not a ‘one-one function 6. Is f: [0, x] + R, given by ftw 7. 18: [0, 21] > R, given by f(x) = cos x, one-one? 8. Show that the function f: V+ given by f(x) =? +x + 1 is injective function but not surjective function. [Delhi 2019} 9. Let A be the set of all 46 students of class XII of a school. Let f: A > N be a function defined by Ax) = roll number of a student x. Show that fis one-one but not onto. 10. Consider function [0,5] - R given by A) 108 x, one-one? and [0.5] +R, given by es) = osx Show tat f and g are one-one but /+ g is not one-one. 11. An organization conducted bike race under 2 different Is. Totally there were 250 participants. Among all of them finally three from Category | and two from Category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project. Let B= (by, by, bs}, G = gy, 42} where B represents the set of boys selected and G the set of girls who were selected for the final race. categories-boys and 2. Ravi decides to explore these sets for various types of | relations and functions. [CBSE Question Bank} (a) Ravi wishes to form all the relations possible from, B to G, How many such relations are possible? (2 (iy Gil) 0 (ny B (b) Let R: B— B be defined by R= {(x, ») zr and. .) are students of same sex}, Then this relation Ris (Equivalence (ii) Reflexive only (ii) Reflexive and symmetric but not transitive (i) Reflexive and transitive but not symmetric (0) Ravi wants to know among those relations, how many functions can be formed from B to G? 2 i 2 (it) ¥ (iy 2 (@ Let R: B+ G be defined by R= {(b,, 8,)s (By 8). ye 84). then Ris, (8 Injective (i) Susjective (iii) Neither Surjective nor Injective (a) Surjective and Injective (© Ravi wants to find the number of injective functions from 8 to G. How many numbers of injective functions are possible? wo (i) 2! (i) 3! () 0! Students of Grade 9, planned to plant saplings along straight lines, parallel to each other to one side of the playground ensuring that they had enough play area Let us assume that they planted one of the rows of the saplings along the line y = x ~ 4. Let L be the set of all lines which are parallel on the ground and R be @ relation on L, [CBSE Question Bank] ‘Answer the following using the above information. (@) Let relation R be defined by R= {(L,, £3): Ly ||L,whereLy.L, € L} then Ris relation () Equivalence (i) Only reflexive (ii) Not reflexive (iv) Symmetric but not transitive (0) Let R= {(L,, Ly) : Ly LL, where Ly, L, € 1} which of the following is true? (@ Ris Symmetric but neither reflexive nor transitive (ii) B ig Reflexive and transitive but not symmetric (ii) Ris Reflexive but neither symmetric nor transitive (iv) Ris an Equivalence relation (©) The function f: R > R defined by fix) =x — 4 is (i), Bijective (i) Surjective but not injective (Gi) Injective but not Surjective (iv) Neither Surjective nor Injective @ Letf: RR be defined by x) = x4. Then the range of fx) is OR WZ (i) W (w)Q (©) Let R= {(L,, L) ) : L; is parallel to Ly and 1, :y=x—4} then which of the following can be taken as 1? @ 2-2y+5=0 Gi) x+y (iii) 2e+2y+7=0 (wy xty=7 SS YOURSELF (ANSWERS) y 2.0) 3. @) 7. No 2e-2y+5=0 . IL. (a) 2%, (6) (@ Equivalence, (c) (iv) 2°, (d) (it) Surjecti Equivalence, (2) ())R is Symmetric but neither reflexive nor transitive, (c) (I) Bijective, (@) () Ry, 13. (a) (i) Neither Surjective nor Injectve, (B) (ii) Inject (2) (8 {1, 4,9, 16,..}, (€) (@ Neither Injective nor Surjective Relations and Functions 23 13, Raji visited the Exhibition along with her family. The Exhibition had a huge swing, which attracted many children. Raji found thatthe swing traced the path of Parabola as given by y= =. ‘Answer the following questions using the above information. (a) Let f: R-> R be defined by fix) = = is (i) Neither Surjective nor Injective i) Surjective (iti) Injective (i) Bijective (b) Let f: N > N be defined by foc) =? is__ (i) Surjective but not Injective (i) Surjective (iii) Injective (iv) Bijective oles: (1,2, 3,23 {15 4,9; be defined by (i, Bijective (ii) Surjective but not Injective (ii) Injective but Sujective (iv) Neither Surjective nor Injective (A) Let: N > R be defined by fix) = 27, Range of the funetion among the following is (14,9, 16,03 (i) (1.4.8, 9,10 (iii) 1,4, 9, 15,16, (iy) 14,8, 16, (e) The function f: Z > Z defined by fix) = 27 is } @ Neither Inj Gi) Injective (iii) Surjective nor Surjective (iv) Bijective 4. (1,3),@, 1) € R but (1, 1) does not belong to R. (2) (0 (c) () Bijective,

You might also like