Professional Documents
Culture Documents
DocScanner 19 Jan 2024 06-09-1
DocScanner 19 Jan 2024 06-09-1
= [Res WHENX Gey} St@3osrey} = HARAOKAy = ‘x a ss F()is one-one. eso, Checking onto : We have, f(x) ft 42" Let y= f(x) such that ye (- 1.) z Toe F<0 x a = Wx in S yaply seers iS 1 When 20 wetave .V ye (CLD ,ais defined. f@= > 2S (8) is onto, s ad Hence, f(x) is one-one and onto function. | Checking oosone : x 45. Given, f:R—> R, defined by F2)=— Veen S@ j= Metx, 2] =. th Letxy,xy €R such that f(x,) = f(xy) MetseR] x On putting f(x, )= (x5) = = ALL +x, Tex, = 3) tae, tay =: > mx = =0 “F-(2) is one-one. > Fy=a, oF yy =] Ss eae et Checking onto : Let £(x)= J; such that ye(—L.D. xy *F isnot one-one, as if we take x, =3and xy[-smests] Tee Reif 4k? <0 or (12k) (142k)1/2 ork <-1/2 So, f is not onto. Hence, f is neither one-one nor onto. 46. Given, R= {(x, y):(x— )) is divisible by 5} and Z=Set of integers Reflexive Let xe Z be any arbitrary clement. Now, if (x) e R, then x — x is divisible by 5, which is true. So, R is reflexive. @ @ Symmetric Let x, ye Z, such that (x, eR 5 divides (x - y) = Sdivides(-(x- y)] = 5 divides(y-x) => (ver So, R is symmetric. fel ‘Transitive Let x,y, =€ Z, such that (x, y)e Rand On zER =2x-y and y= zboth are divisible by 5 =ox- y+ y= is divisible by 5. = (x~2)is divisible by 5 = (x 2)eR So, R is transitive. Thus, R is reflexive, symmetric and transitive. Hence, R is an equivalence relation. @ j Concept A relation ona set Ais said to { Enhancer be an equivalence relation on A iff it is reflexive, symmetric and transitive 47. Given, relation is S = {(a, 6) :|a — | is divisible by 4 and a, be A} and Az {eixe Zand 0Sx $12) ‘Now, A can be written as A= 0.1,2,3,-..512} w Reflexive As, for any x ¢ A, we get|x—x|=0, which is divisible by 4. 48, Unie Relations ond Functions SO Now, let ke R be any arbitrary element and let SX) =* = (NES Vreg Therefore, S is reflexive Symmetric As, for an w YO NES, divisible by 4, DES. we gett = pig (by using definin ¥ Using definition of given relat = IX Y= 4A fo iameie ee lation} = [yn x1= 4) forsomea ez = (axes Thus, (x, MESS ONES WY ved Therefore, 5 is symmetric. s q Transitive For any (x, eS andy, 2)¢.5, we a {x slis divisible by 4 and y~ lis divisible by 4 {by using definition of given relation) = x= y= Mand) y— ze for some Ape Z. Now, x= 4, (=) 40-2) Ht4A tau s4Qrspy => [x= z/is divisible by 4, = (ses Thus, (x, ES and (y, se S = WES Va red ‘Therefore, S is transitive w Since, 5 is reflexive, symmetric and transitive, so itis an equivalence relation, Now, set of all elements related to 1 is {1,5,9) ‘The set of all clements related to [2] {a € A2|2~alis divisible by 4) = 26,10) «y The given relation is R= ((x, y):4, ye Zand x= yis divisible by 3) To prove R is an equivalence relation, we have to prove R is reflexive, symmetric and transitive, «ly Reflexive As, for any x€ Z, we have x —x=0, which is divisible by 3. = (£=2)is divisible by 3 = (eR WxeZ Therefore, R is reflexive, w Symmetric Let (x, y)€ R, where x, ye Z. => (x-y)isdivisible by 3. [by definition of R] 3.4 for some Ae Z, 3(-A) x) is also divisible by 3. > (yx)¢ R Therefore, R is symmetric. w‘ ved Papors : 1, jorwiso CBSE Sol ATH S15 ho Ma eZ, Transitive Let (x, ye R where S (= y)is divisible by 3, = ¥~ Y=34 forsome Ae Z Again, let (1. 2)e &, where 5, => ( ble by 3, = 5 34 for some B € Z, Now. (=) (y= 2) 34449 = ==3(A4+B) ible by 3 for some (A+ B)EZ = (x, 2)ER Therefore, R is transitive. Case Based Questions =ase Based Questions 1 An organisation conducted bike race under two different categories-Boys and Gitls, There were 28 Participants in all. Among all of them, finally three from category 1 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 = {b,53.0s) and G= (g,,¢3}, where B [ePresents the set of Boys selected and G the set of. Girls selected for the final race. an Based on the above information answer the following questions, @ How many relations are possible from B to G? Gi) Among all the possible relations from B to G how many functions can be formed from B to G? Gil) Let R :B > B be defined by R = {(x, y):x and y are students of same sex}. Check if & is an equivalence relation. Or A function R :B ~ G be defined by R= {6,81 )s (2,82) (3,8; )} Check if & is bijective. Justify your answer, is reflexive, s netric and tra Thus, iseftextve, symmetric and tang itis an equivalence relation, itis ¥ Iratlenst one of the conditions ic eflexiyg 0 ymmetric and transitive, is not satisfied, that the given relation is not an eq Ng n lence lig 49. (i) Do same as Q. No. 46. ii) Clearly, [1 ]= {1.3.5} oc (B]= 13,5) [2]=Q4) [4]= 2,4) 3,5) i Jk Sabha is a gigant 2. A general clection of Lo! isa ex ‘About 911 million people were eligible to vote ct voter turnout was about 67%, the highest ever, ‘ONE - NATION (ONE - ELECTION FESTIVAL OF DEMOCRACY GENERAL ELecrion-2019 BATT 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 Tas follows RAG M2) M Vy eT) and both use their voting right in general election-2019}. Answer the following questions using the above information. (CBSE Question Bn (i) Two neighbours X and ¥ € 1. X exercised his Voting right while ¥ did not cast her vote in general election-2019. Which of the following i true? @)(X¥)eR OU,eR OK DER MYERpettons ond Fnctions |S Gy Me. X and his wife I both & ight in general election 2019. Which ufthe following is tnic? (a) both OC Wand WAXY WAM Rud eR (© both (Wand GAY eR WON Kbwt WW) ee (ii) Three friends Fy, Fy and Fy exercised right in general election: following is trac? FH e ROS Re R and KE eR OE. PERE, Bek and (A. Bye R (OG. FIER, FER bur. Rye 4. @ We have n(B) =3, n(G)=2 Total number of possible relation from B to Given, n(B)= Number of function from B to G =: Gil) We have, R = (x. same sex} Here, (x,x)€ R, Vee B = Risreflexive G MER@ONER a eB = Ris symmetric and (x, 3)€ Rand (y, =) R Vx re B (x 2)ER =8 yx and yare students of the = = Ris transitive Hence, R is an equivalence relation. Or Given, R:B 9G defined by R = ((b,,8) ).(b3-82)s(by.81)) Here, b, and byhave same images g,. So, R is many-one function, and since, range of. Nervised their voting, their voting 2019, then which of the mn 1 Unit a 1 and, Pye yen (iv) The above deti ied Th above tine cao (0 Univermt relation (© Enavatonee (tenon (0) Me Shyam eterise io Hiection-2019, then Mr. §} ofthe following? nM Shy (a alsa (0 Family met (Allenizens ty (0) Bg relation ot aymmet ‘ymmetrie and, i right in Generat 'm is related to which, ible voter who eaat 9 of Me Shyam, nin ible voters of India $0. is ont function Since, Ris notone-one Thus, R is not bijective function, _ 2. (W) (d) Given, R OND K Wy ety and = use their voting right in general election-2019, -¥ €1-N exercised his voting right while Y didnot canhervoteingeneateaeeceie Clearly, (X,Y )e R. i) (@) Relation is symmetric, 2 (XM ER = WH xDeR, - ii) (@) Since, (FF) ER, F eT and F use their voting right. > Ris reflexive, (FER = (Fy, FER Ris symmetric, and (F\, Fa)e Rand (Fy, Fy)€R = (Fi, FyeR (By transitive property) iv) (c) Given, relation & is reflexive, symmetric and transitive. ++ Ris equivalence relation. (¥) (@) Clearly, Mr. Shyam exercised his voting right in general election-2019, then Mr. Shyam is related to all those eligible voters who cast their votes."099 100 8900 pF +5 como st fy (0°) 0) € ON “Senisues tou poe onounats aanxopoy suemsuy ‘wonsuny SmPatig st Sem nous 75.0) /s0%5 50 S29 9/ 64 pauep wonoiny e-tonD “gy ‘wonouny DF 6a pomp ” aso4s “EL suousend SHOW s “9a est Soy mys uo, + xy =(0)/ SA pouysp wonouny amy sty y= SIZE We Jou aap om Bujoqyo sopadond jarouyap (ye =F “LL fe sou aurounks ‘ounounucs uv oaxoyar st (g's 0: (4 ‘sisqunt ato 78s aun y Laney ng ansuen = x 58 pouyop on rep MONS “g SuoHSEND syn CVS hq 4 mn yo0GD + ‘uu pur au0-ueu HUN am Ip OS, “9 Put £1 Jo seus PIS COL Aa pause ay ean fick jot 30 OW 1x5 — E(x) f Feonouy om HoH agp Poppe 99 01s mm Ho "uaa (Cg 88 ¥ Wo Pou 9 one "OMY CAF wonoary 1p Jo Aaa OSH CY: Foon Ka pouyop 2y ey: : {2809 nok ured coamena a aun ear ee oy 3 A100 ue 1 suo a