ae MATHEMATICS Competency-Focused Questions CBSE Examination Papers-2023 Constructed Response Questions CBSE Sample Question Paper-2024 NCERT Textbook & Exemplar QuestionsPrinting History: ‘Twentieth Revised Edition: 2023-24 Syllabus Covered: CBSE, Delhi Price: Seven Hundred Twenty Rupees ® 720/-) ISBN: 978-939-561 2-255-0 Publaher may be peared, © Copyrignt Reserved by rod No eat without witen pomision om te pusher Published By: VK Global Publications Pvt. Ltd. Regd. Office: 4323/3, Ansari Road, Darya Ganj, New DeFii-110002 Ph: 91-11-23250105, 23250106 Fax: 91-11-23250141 Corporate Office: 15/1, Main Mathura Road, Faridabad-121003 (NCR) Haryana Phone: 0129-7117719-48 lines, Fax: 0129-2260322 Email: mall@vkpublications.com wae vkpublications.com Printed At: VK Global Digital Pvt. Ltd. ssngcages tt4 Contents PART-A Relations and Functions Inverse Trigonometric Functions. Algebra of Matrices Determinants Continuity and Differentiability . Application of Derivatives Integrals Application of Integrals . Differential Equations Vector Algebra Three Dimensional Geometry Linear Programming . Probability PART-B CBSE Sample Question Paper-2024 (Solved) CBSE Sample Question Paper-2023 CBSE Examination Paper-2023 (Code: 65/4/1) CBSE Practice Question Paper Xam a7 7 101 143 193 239 293 317 361 393 427 467SYLLABUS Central Board of Secondary Education, New Delhi MATHEMATICS Class-XI1 (2023-24) Time: 3 hours One Paper Max. marks: 80 S.No. Units No. of Periods ‘Marks: 1 | RELATIONS AND FUNCTIONS 30 08 1. | ALGEBRA 50 10 m. | CaLcuLus 80 38 IV._| VECTORS AND THREE-DIMENSIONAL GEOMETRY 30 4 Vv. | LINEAR PROGRAMMING 20 05 vi. | PROBABILITY 30 Total 240 Internal Assessment 20 UNIT-I: RELATIONS AND FUNCTIONS 1. Relations and Functions (15 Periods) 1 ‘Types of relations: reflexive, symmetric, transitive and equivalence relations. One to one and onto functions. Inverse Trigonometric Functions (15 Periods) Definition, range, domain, principal value branch. Graphs of inverse trigonometric functions. LGEBRA Matrices (25 Periods) Concept, notation, order, equality, types of matrices, zero and identity matrix, transpose of a matrix, symmetric and skew symmetric matrices. Operation on matrices: Addition and ‘multiplication and multiplication with a scalar. Simple properties of addition, multiplication and scalar multiplication. Non-commutativity of multiplication of matrices and existence of non- zero matrices whose product is the zero matrix (restrict to square matrices of order 2). Invertible matrices and proof of the uniqueness of inverse, if it exists; (Here all matrices will have real entries). Telegram : @Xam_ldea2 Determinants (25 Periods) Determinant of a square matrix (up to 3 x 3 matrices), minors, co-factors and applications of determinants in finding the area of a triangle. Adjoint and inverse of a square matrix. Consistency, inconsistency and number of solutions of system of linear equations by examples, solving system of linear equations in two or three variables (having unique solution) using inverse of a matrix. UNIT-IHI: CALCULUS 1 3 4 Continuity and Differentiability (20 Periods) Continuity and differentiability, chain rule, derivatives of inverse trigonometric functions, like sin”! x, cos“! x and tan’ x, derivative of implicit functions. Concept of exponential and logarithmic functions. Derivatives of logarithmic and exponential functions. Logarithmic differentiation, derivative of functions expressed in parametric forms. Second order derivatives. Applications of Derivatives (10 Periods) Applications of derivatives: rate of change of quantities, increasing / decreasing functions, maxima and minima (first derivative test motivated geometrically and second derivative test given as a provable tool). Simple problems (that illustrate basic principles and understanding of the subject as well as real-life situations). Integrals (20 Periods) Integration as inverse process of differentiation. Integration of a variety of functions by substitution, by partial fractions and by parts. Evaluation of simple integrals of the following types and problems based on them. ae dr pdt ax de wea Veal | eax | attbete’ | dart bere” Ja, (a, Pia, [eax atebere * Vaxtebxee Jvak+bx+c dx, Fundamental Theorem of Calculus (without proof). Basic properties of definite integrals and evaluation of definite integrals. Applications of the Integrals (15 Periods) Applications in finding the area under simple curves, especially lines, circles /parabolas/ellipses (in standard form only). Differential Equations (15 Periods) Definition, order and degree, general and particular solutions of a differential equation. Solution of differential equations by method of separation of variables, solutions of homogeneous differential equations of first order and first degree. Solutions of linear differential equation of the type: ay dx dx {iy tPE™O, where Pand Q are functions of yor constants +Py~Q, where P and Qare functions of x or constants Telegram : @Xam_lIdeaUNIT-IV: VECTORS AND THREE-1 IMENSIONAL GEOMETRY 1. Vectors (15 Periods) Vectors and scalars, magnitude and direction of a vector. Direction cosines and direction ratios of a vector. Types of vectors (equal, unit, zero, parallel and collinear vectors), position vector of a point, negative of a vector, components of a vector, addition of vectors, multiplication of a vector by a scalar, position vector of a point dividing a line segment in a given ratio. Definition, ‘geometrical interpretation, properties and applications of scalar (dot) product of vectors, vector (cross) product of vectors. 2. Three-dimensional Geometry (15 Periods) Direction cosines and direction ratios of a line joining two points. Cartesian equation and vector equation of a line, skew lines, shortest distance between two lines. Angle between two lines. UNIT-V: LINEAR PROGRAMMING Linear Programming (20 Periods) Introduction, related terminology such as constraints, objective function, optimization, graphical method of solution for problems in two variables, feasible and infeasible regions (bounded and unbounded), feasible and infeasible solutions, optimal feasible solutions (up to three non-trivial constraints). UNIT-VI: PROBABILITY Probability 0 Periods) Conditional probability, multiplication theorem on probability, independent events, total probability, Bayes’ theorem, Random variable and its probability distribution, mean of random variable. The changes for classes XI-XII (2023-24) internal year-end Board Examinations are as under: 4 Objective Questions are 20% Remaining 50% Questions are Short Answer/Long Answer Questions Particulars Academic Session 2022-23 Academic Session 2023-24 Composition of | Competency Based Questions ‘Competency Focused Questions |question paper year} are 30% in the form of Multiple- in the form of MCQs/Case end examination/ | Choice Questions, Case Based. Based Questions, Source-based Board Examination) Questions, Source Based Integrated Questions or any (Theory) Integrated Questions or any other type = 40% other type. Select response type questions (MCQ) = 20% Constructed response questions (Short Answer Questions /Long Answer type Questions, as per existing pattern) = 40% | egramDesign of Question Paper Mathematics Code No. 041 Class XII (2023-24) Time: 3 hours ‘Max. Marks: 80 % S.No. ‘Typology of Questions Total Marks Weightage Remembering: Exhibit memory of previously learned material by recalling facts, terms, basic concepts, and answers, 1. | Understanding: 4 55 Demonstrate understanding of facts and ideas by organizing, comparing, translating, interpreting, giving descriptions, and stating main ideas Applying: 2, _| Solve problems to new situations by applying acquired 9 oe knowledge, facts, techniques and rules ina different way. Analysing: Examine and break information into parts by identifying motives or causes. Make inferences and find evidence to support generalizations Evaluating: Present and defend opinions by making judgments 3. | about information, validity of ideas, or quality of work ‘based on a set of criteria, Creating: ‘Compile information together in a different way by combining elements in a new pattern or proposing alternative sotutions 16 20 TOTAL 80 100 1. No chapter wise weightage. Care to be taken to cover all the chapters. 2. Suitable internal variations may be made for generating various templates keeping the overall weightage to different form of questions and typology of questions same. Telegram : @Xam_ldeaChoice (s): There will be no overall choice in the question paper. However, 33% internal choices will be given INTERNAL ASSESSMENT 20 MARKS, Periodic Tests ( Best 2 Out of 3 tests conducted) 10 Marks Mathematics Activities 10 Marks Note: For activities NCERT Lab Manual may be referred Conduct of Periodic Tests: Periodic Test is a Pen and Paper assessment which is to be conducted by the respective subject teacher. The format of periodic test must have questions items with a balance mix, such as, very short answer (VSA), short answer (SA) and long answer (LA) to effectively assess the knowledge, understanding, application, skills, analysis, evaluation and synthesis. Depending on the nature of subject the subject teacher will have the liberty of incorporating any other types of questions too. The modalities of the PT are as follows: (a) Mode: The periodic test is to be taken in the form of pen-paper test. (b) Schedule: In the entire Academie Year, three Periodic Tests in each subject may be conducted as follows: Test Pre Mid-term (PT-) | Mid-Term (PTA) | Post Mid-Term (PT-L) Tentative Month July-August November December-January This is only a suggestive schedule and schools may conduct periodic tests as per their convenience. The winter bound schools would develop their own schedule with similar time aps between two consecutive tests. (©) Average of Marks: Once schools complete the conduct of all the three periodic tests, they will convert the weightage of each of the three tests into ten marks each for identifying best two tests. The best two will be taken into consideration and the average of the two shall be taken as the final marks for PT. (@) The schoo! will ensure simple documentation to keep a record of performance as suggested in detail circular no Acad 05/2017. (@) Sharing of Feedback/Performance: The students’ achievement in each test must be shared with the students and their parents to give them an overview of the level of learning that has taken place during different periods. Feedback will help parents formulate interventions (conducive ambience, support materials, motivation and morale-boosting) to further enhance learning. A teacher, while sharing the feedback with student or parent, should be empathetic, non- judgmental and motivating, It is recommended that the teacher share best examples/ performances of IA with the class to motivate all learners. | egram‘Assessment of Activity Work: Throughout the year any 10 activities shall be performed by the student from the activities given in the NCERT Laboratory Manual for the respective class (XI or XID which is available on the link hitp://www.ncert.nic.in/exemplar/labmanuals.html. A record of the same may be kept by the student. An year end test on the activity may be conducted. ‘The weightage are as under: © The activities performed by the student through out the year and record keeping: 5 marks © Assessment of the activity performed during the year end test: Smarks © Viva-voce : 2marks Telegram : @Xam_ldeaPART-A Points to Remember Competency-Focused Questions (As Per NEP) » Multiple Choice Questions » Assertion-Reason Questions » Case-based/Data-based Questions Conceptual Questions Constructed Response Questions (As Per NEP) » Very Short Answer Questions » Short Answer Questions » Long Answer Questions Questions For PracticeTelegram : @Xam_ldeaRelations and Functions POINTS TO Relation: If A and B are two non-empty sets, then any subset R of A x Bis called relation from set A to set B. ie, R:A+B @ RcAxB For example: Let A = {1,2}, B= (3,4) Then = (0,3), 4), (2,3). (24)) A subset R, = {(1, 3), (2, 4)}< A x B is called relation from A to B. Similarly, other subsets of A x B are also relation from A to B. If (x,y) € R, then we write Ry (read as xis R related toy) andif (x,y) ¢ R, then we writex Ry (read as xis not R related to y). Domain and Range of a Relation: If R is any relation from set A to set B then, (@) Domain of R is the set of all first coordinates of elements of R and it is denoted by Dom (R) (b) Range of R is the set of all second coordinates of R and itis denoted by Range (R).. A relation R on set A means, the relation from A to Aie, RCA x A Some Standard Types of Relations: Let A be a non-empty set. Then, a relation R on set A is said to be (a) Reflexive: If (x, x) © R for each element x € A, ie, ifxRx for each element x © A. (®) Symmetric: If (x,y) € R> (y, x) € R for all x, y € A, ie, ifxRy > yRx for all x, ye A. (o) Transitive: If (x, y) € Rand (y,2) € R= (x,z) € R for all x, y,z€ A, ie, if xRy and yRz = xRz. Equivalence Relation: Any relation R on a set A is said to be an equivalence relation if R is reflexive, symmetric and transitive. Antisymmetric Relation: A relation R in a set A is antisymmetric if (@,b) eR (6,0) eR > a=bV abe R,oraRband bRa > a=b,¥a,beR For example, the relation “ greater than or equal to, "2" is antisymmetric relation as azbbea > a=bWa,b [Note: “Antisymmetric” is completely different from not symmetric.] Equivalence Class: Let R be an equivalence relation on a non-empty 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 “¢ REGWeAgSpd Functions 9 rok tal A] A = Rai ON Moe AN] [OFe|Forexample, Let A= (1, 2,3} and R be the equivalence relation on A given by R=, 0, 2,2), 3,3), (1,2) 2 DI) The equivalence classes are [1] = equivalence class of 1 = {x € A: (x,1) € R} = {1,2} Similarly, [2] = (2, 11 so [1] = [2] and [3] = 13) 7. If Aisa finite set with 1 elements, then () Total number of relations in A = 2" (i?) Total number reflexive relations in A ne (ii) Total number of symmetric relations in A= 2? (io) Total number of equivalence relations in A = B,, where B, denotes the Bell numbers given by By=1, By=1, B)=2 and Byer = 5," for n>2 Where Se 8. Function: Let X and Y be twonon-empty sets. Then, a rule f which associates to each element x € X, a ‘unique element, denoted by f(x) of ¥, is called a function from X to Y and written as f:X—> Y where, (fie) is called image of x and x is called the pre-image of f(x) and the set Y'is called the co-domain of _fand f(X) = (f(a): x € XJ is called the range of f 9. Types of Function: (@ One-one function (Injective function): A function f : X + Y is defined to be one-one if the image of distinct element of X under rule fare distinct, ie, for every x4, x) © X, flzy) = flay) implies that xy = x. (i Onto function (Surjective function): A function f: X—> Y is said to be onto function if each ‘element of Y is the image of some element of x, ie, for every y ¢ Y, there exists some x ¢ X, such that y= f(x). ‘Thus fis onto if range of f= co-domain of f (if) 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. (io) Many-one function: A funetion f : X — Y is said to be a many-one function if two or more ‘elements of set X have the same image in Y. ie,,f: X + Y isa many-one function if there exist , be X such that a #b but la) = fb). 10. Composition of Functions: Let f:A > Band g : B—> C be two functions, Then, the composition of ‘and g, denoted by gof, is defined as the function. es Wu [aa] a Wu Py ea) fared oe) p= WY) oa - ie) (ay, 0 omcenpaegram :@Xam_IideanL 2 13. uw 16. ” 19. a. gof:A>C — givenby ‘gofix) = gfx), ¥xEeA Clearly, dom(gof) = dom() Also, gof is defined only when range(f) < dom(g) Identity Function: Let R be the set of real numbers. A function I : R—> R such that I(x) =x x € Ris called identity function. Obviously, identity function associates each real number to itself. Number of Functions: If X and Y are two finite sets having m and n elements respectively then the number of functions from X to Y isn" = m,n(8) =m then, number of one-one function from A to B= le Uimse If n(4) = m, n(B) = then number of onto functions from A to B (0, ifmen = [oa ese —ayt tegen)" —tCyon—3y"+ + (A""C,_y ifm > n Ifn(a) if m>n Invertible Function: For f: A —> B, if there exists a function g : B—> A such that gof = 1, and fog = Ip, where I, and Ip are identity functions, then f is called an invertible function, and ¢ is called the inverse of f and it is written as f= g. If (A) = n, then total number of bijective maps from A to A =n! If A isa finite set then any one-one map from A to A must be onto function. If Aisa finite set then any onto functions from A to A must be one-one. If A is an infinite set then any one-one function from A to A not necessarily onto function and vice versa. Vertical Line Test: It is used to check whether a relations a function or not. Under this test, graph of given relation is drawn assuming elements of domain along x-axis. Ifa vertical line drawn anywhere in the graph, intersects the graph at only one point then the relation is a function, otherwise itis not a function. fee? axis yaxis 1Q)=5F =.) @ ©) (@) It is graph of function ie,, ffx) =2" is a function. (©) Itis not the graph of function iz, f(x) =41/x is not a function. 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 x-axis) drawn anywhere in graph, intersects the graph at only one point then the function is one- one, otherwise it is many-one. Telegram : @Xam_leeaenncios vu = es al Vv) Sa Ss) ze) m K< faa = ow m avais yy eave yeas Horizontal ine L 5 Horizontal in ® (@) fix) = 2x +1 is one-one function. (®) fia) =x is many-one function. faye Multiple Choice Questions Choose and write the correct option in the following questions. 4: 4 A relation R in set A = {1, 2, 3}is defined as R = {(1, 1), (1,2), 2, 2), (3, 3)}- Which of the following ordered pair in R shall be removed to make it an equivalence relation in A? [CBSE Sample Paper (2021-22) (Term-1) (@) (1,1) () G2) (©) 2,2) @ 3,3) Let the relation Rin the set A ={x € Z:0 < x < 12}, given R ={(a,b): |a—b| is amultiple of 4). Then [1], the equivalence class containing 1, is ICBSE Sample Paper (2021-22) (Term-1)] @ 15,9) (b) {0,1,2, 5) Oe @a Forreal numbers x and y, define xRy if and only if x - y+ 2 is an irrational number. Then the relation Ris INCERT Exemplar] (@) reflexive (8) symmetric (©) transitive (@ none of these Consider the non-empty set consisting of children in a family and a relation R defined as aRb if ais brother of b, then Ris INCERT 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] @ (2 (3 @s5 Let I 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 mt V 1, m € L. Then Ris INCERT Exemplar] (@) reflexive (®) symmetric (c) transitive (d) none of these A relation R is defined on N. Which of the following is the reflexive relation? [CBSE 2021-22 (Term-1)] (@) R=(@,y):x>y,x,yeN) (&) Re(@eyix+y=10,x,yeN} (©) R= {(x, y):xyis the square number, x, y € N} (d) R={(x,y):x + 4y = 10; x, ye N) 2 omcenpeegram :@Xam_Iidea10. a 2 1B. 14. 15. 16. 7 18. 19. 2. ‘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)] 2 3 @ Rbif and only if a” ~7ab + 667 = 0. Then, Ris [CBSE 2021-22 (Term-1)] (@) reflexive and symmetric (8) symmetric but not reflexive (c) 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 [NCERT Exemplar] (@) Reflexive (©) Transitive (© Symmetric @ None of these Let R be a elation on A = {a, b, ch such that R = {(a, a), (b,b), (c, 0), then Ris (@) Reflexive (#) 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 [CBSE Sample Paper 2021-22 (Term-1)] @ @4eR OBHeR (SER @MBHER Let A and B be finite sets containing m and n elements respectively. The number of relations that can be defined from A to Bis (a) 2" () 2" (c) mn @o Let A ={3, 5}. Then number of reflexive relations on A is (CBSE 2023 (65/5/1)] (a) 2 (4 (0 @8 The relation R in the set {1, 2, 3} given by R = {(, 2), (2, 1), (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 (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)] @t (2 3 @4 The function f: R-> R defined as flx) = xis. [CBSE Sample Paper 2021-22 (Term-1)] (@) one-one but not onto {B) not one-one but onto, (0) neither one-one nor onto (d) 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 [NCERT Exemplar] (@ 144 (12 (©) 24 @ 64 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 [CBSE Sample Paper 2021-22 (Term-1)] (@) surjective function (b) injective function _(c) bijective function (d) function The number of functions defined from {1, 2, 3, 4, 5} — {a,b} which are one-one is [CBSE Sample Paper 2021-22 (Term-1)] @s 3 (2 @o The function f: R — R defined by flx) =4 +3 cos xis [CBSE 2021-22 (Term-1)] (@) bijective (B) one-one but not onto, (0) onto but not one-one (@) neither one-one nor onto Telegram : @Xam_hbe@aerneion 1s2 apm Rey na Ueaaly AER NORE (@) one-one (®) onto (©) bijective (@ not defined ntl ies Ty vit nisodd 23, The function f: N — Nis defined by f()=] ,, ifm is even The function fis (@) bijective (8) one-one but not onto (©) onto but not one-one (@) neither one-one nor onto Answers 1® 2. (a) 3 (a) 4 (b) 5d Ct} 8. (0) 9d) 10. (b) 1. @ 2 (0 13. (@) 15. (a) 16. (6) 17. (a) 18.0 19. 20. (d) 2 @ 23. (0) Solutions of Selected Multiple Choice Questions 1. Given relation R on set A = {1,2, 3h is, R=(2,0),(,2),22,8,3)) From the given relation R if we removed (1, 2) then R={(1,1), 2,2), (3, 3)) is an equivalence relation in A. Hence, ordered pair (1, 2) should be removed. *. Option (6) is correct. [1] = be A: |x-1| isa multiple of 4) = {1,5,9] ++ Option (a) is correct. 4. Given, aRb => aisbrother of b This does not mean that b is also a brother of a because b can be a sister of a. Hence, R is not symmetric. Again, aRb > aisbrother of b and bRe > bisbrother of c So, a is brother of c. Hence, R is transitive. * Option (b) is correct. Number of equivalence relation in A = By = CyB "CB, +? CyB, = By 2B, + By 21424255 ix ++ Option (d) is correct. 6. ForlmeL if(Lm)eR > lim => mil > (mDeR 2. Ris symmetric. Option (b) is correct. > 4 oowefetegram : @Xam_Iidea ICBSE 2021-22 (Term-1)] a) 4. @) 21. (d)10. 1. 2 A relation Ris defined on N by R = {(x, y) :xy is the square number, x, yeN } Let reN, = @a)ixxx => @,xeR «. Risreflexive on N. ++ Option (¢) is correct. We have total possible pairs = {(1, 1), (1,2), (1,3), (2,1), @,2,2,3), 3, 1), 3,2), 3,3)} The smallest equivalence relation R; containing (1, 2) and (2, 1) is (1, 1), 2, 2), (3,3), (1, 2), 2, 1)} Now, we are left with any 4 pairs namely (2, 3), 3,2), (1,3) and @, 1). ? which is a square number €N If we 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 Q,1) is two. +. Option (¢) is correct We have a relation R defined on Z as aRb if and only if a 7ab + 64° = 0. Reflexive: Let 2eZ w—7ax a+ 6a = 70° ~ 7a? =0 => aRa Itis reflexive. Symmetric: Let a, beZ and (a, 6)eR -aRb => a—7ba+ 6b?=0 but ba because &? ~7ha + 64” # 0 (may or may not be zero) * Itis not symmetric. Hence, R is reflexive but not symmetric. +. Option (d) is correct. R=((1,2,A={1,2,3) Clearly R is neither reflexive nor symmetric. As (1,2) € Rbut 4 (2,6) € Rforb © A such that (1, 6) ER. Hence R is a transitive relation on A. * Option (b) is correct. Re (Ga), (0,0), (60) Reflexive: Let (xx) € R ¥xeA So, R is reflexive. Symmetric: For (x, yJER, x= y > (y, ER Wr YEA So, Ris symmetric. Transitive: For (x, y) € R there is no (y, 2) € R such that (x, 2) € R so R is transitive. Hence, R is an equivalence relation. ~ Option (d) is correct. a=b-2andb>6 => ©8)eR ©. Option (¢) is correct. Telegram : @Xam_fe@aennan 1s4. 15, 16. m 18, 19. 2. 16 Som tae pereg ram Ifa set containing m elements then number of symmetric relations in A = 2"°-" Here n(A) =2 -. Number of symmetric relations = 27~? = 2? = 4 © Option (b) is correct. Given relation R in the set (1, 2, 3} given by R = {(1, 2), (2, 1), (1, 1)} is symmetric and transitive, but not reflexive because (2,2) €R and (3,3) €R. ++ Option (a) is correct. Given set A = (1,3, 5} We have, smallest equivalence relation R, = ((1,1), 8,3), 5), (1,3), 0} If we add (3, 5), then we have to add (5, 3) also, as it is symmetric. 2 Second equivalence relation will be R= (3G, 1),(1,0),8,3)-6, 5)-8,5)-6,3)-(1, 5)-6,1)) Hence, number of equivalence relations containing (1, 3) is 2 -. Option (b) is correct. Let flx,) =f) Vt,a,€R (domain) => xpax? > =x = fisone-one. Letfix)=X=yvVyeR (co-domain) = xsyeR (domain) Every image ye R (co-domain) has a unique pre image in R (domain). = fisonto. Hence, fis one-one and onto. + Option (d) is correct. The total number of injective mappings from the set containing nt elements into the set containing 1m elements is"P,. So here itis *P, = 4! = 24. As every preimage x € A has a unique image y ¢ B. = _fisinjective function. Option (b) is correct. Let X= (1,2,3,4,5} and Y= (a, b} <. Number of functions defined from fi X + Y which are one-one is zero (0), because number of elements in set X is 5 and number of elements in set Yis2 => n(X)> (1) => No one-one function possible. *. Option (d) is correct. Given function f: R-+ R defined by f(x) = 4 +3.cos.x One-one: Let x, =O and x, = 2a jexex => cos x, =cos0=1 and cos x; = cos 2 = 1 "COS x; = COS x, 3 443cosx,=4+3cosx, = flr) = flea) Tt is not one-one. Onto: As we know that for all xeR, we have -1Scosx £1 >-3 S3cosx 23 >154+3cosx <7 =-15 fa) <7 = Range of f= [1,7] )Xam_ldClearly, Range of f+ co-domain of f «. fisnotonto. Hence, fis neither one-one nor onto. < Option (d) is correct 22. Given function fi R + Rbe defined by flx)= +, for all xeR Clearly, when x =0eR fx) 7 = (ce) (not defined) <2 Option (@) is correct. nti > if nisodd 23. Given function f: N+ Nis defined by flm)= 2 sod ae if niseven One-one: Letn=1 (edd) > fll)= +1 and, n=2(even) = f(2)= Clearly, itis not one-one function. Onto: For every value of n whether it is even or odd fine Co-domain = Range It is onto. Hence, function fis onto but not one-one. + Option (¢) is correct. Assertion-Reason Questions 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. © Ais true but Ris false. @) Ais false but Ris true. 1. Assertion (A) : Reason (R) : 2. Assertion (A) : Reason (R) : 3. Assertion (A) : Let R be the relation on the set of integers Z given by R = {(a, b) :2 divides (a-6)} is an equivalence relation. A relation R in a set A is said to be an equivalence relation if R is reflexive, symmetric and transitive. Let f:R > R given by f(z) =x, then fis a one-one function. = Bis said to be onto function if for each b € B, a ¢ A such that A function g: 3a) =. Lot function f: {1, 2, 3} + (1, 2, 3} be an onto function. Then it must be one-one function. Telegram : @Xam_e@aemeos »Reason (R) : A one-one function g: A > B, where A and B are finite set and having same number of elements, then it must be onto and vice-versa 4. Assertion (A): Letf: R > R such that f(x) = x, The function fis an onto function. Reason (R) : A function g: A> Bis said to be onto function if (4) = B ie,, range of g = B. 5. Assertion (A): The number of all onto functions from the set (1, 2,3, 45} to itselfis 5! Reason (R) : Total number of all onto functions from the set (1, 2,3, .. nto itself is n!. Assertion (A): Let f: R + R givenby 1 if x>0 fey = 0 if x=0 isabijection. Hl if x<0 Reason (R) : A function g: A —> Bis said to be bijection if it is one-one and onto. 7. Assertion (A): Let A = (1, 2,3} then define a relation on A as R = [(1, 2), (2, 1)), R is not transitive relation. Reason (R) : A relation R defined on a non-empty set A is said to be transitive relation if (a,b), ER > G@deR Answers 1. @) 2. (b) 3. (a) 4. (d) 5. (a) 6. (d) 7. (a) Solutions of Assertion-Reason Questions 1. Reflexivity: Clearly (a, 2) € Rasa ~a = 0 which is an even integer and is divisible by 2. So, it is reflexive. ‘Symmetry: Let (a, b) ¢ R= 2 divides (a-b). = 2divides-(a-b) > 2dividesb-a = (b,a)eR So, itis symmetric. Transitivity: Let (a, 6) € Rand (b,c) €R. = 2dividesa-band2dividesb-c = 2dividesa—b+b-c=a-c > (a,QeR So, itis transitive, = Relation R is an equivalence relation. So A is true. Clearly R is also true and gives the correct explanation of A. Hence option (a) is correct. 2. Let xx) € R such that flx,) = fox) = x =m > fisa one-one function. Clearly A is true and Ris also true. But R does not give correct explanation of A Hence option (b) is correct. 3. Suppose fis not one-one function. ie., 3 two elements say 1 and 2 in the domain mapped to a single element of the co-domain. ‘Then 3 can be mapped to any one of two remaining element. So, range set has only two elements. 18 omic PHO A m: ( > @Xam_Iidea4 5 % = Rif) * (1, 2,3) which contradict the fact that fis an onto function. Thus / must be a one-one function. So, A and R gives the correct explanation of A. Hence option (a) is correct. Clearly R(A = [0,-) Here R ()# R = (=, 2) = fis notan onto function. So, A is false but R is true. Hence option (d) is correct. One-one 1 can map to any one Of 1, 2, mm Sie, 5 ways. After that 2 can be mapped to any four of the remaining 4 elements. After that 4 can be mapped to remaining three elements, Now 4 can be mapped to remaining two element. And 5 can be mapped to remaining one element. Total number of one-one functions = 5 x 4x 3x2x1=5! ‘We know that total number of onto map ona finite set = Total numbers of one-one map = 5! Total number of bijective map = 5! So A is correct statement. Also R is a correct and gives correct explanation of statement A. + Option (a) is correct. Jf: R > R such that 1 if x>0 fz)=} 0 if x=0 -1 if x<0 For 1,2. R (domain) (fl) = 1 =f) but 122 => _fis not one-one. Also R(f) = {-1,0,1] 4 R (Co-domain) = fis not onto. fis neither one-one nor onto. = _ fis nota bijective map. SoA is nota true statement. But R is the correct statement and R does not gives correct explanation of A. * Option (d) is correct. We have A ={1,2,3}, R=(0,2,2,0) (1,2), 2,1) € Rout (1,1) ¢R = Ris not transitive. So statement A is correct. Also statement R is correct and gives correct explanation of statement A. +. Option (a) is correct. Telegram vxXam pedyergapa Functions 19Case-based/Data-based Questions Each of the following questions are of 4 marks. 1. Read the following passage and answer the following questions. A general election of Lok Sabha is a gigantic exercise, About 911 million people were eligible to vote and voter turnout was about 67%, the highest ever. ONE - NATION ONE - ELECTION FESTIVAL OF DEMOCRACY GENERAL ELECTION- 2019 NVA VAL CO Let Ibe 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: Re (Vz, Vs): Vz, Vo € and both use their voting right in general election ~ 2019}. ( Two neighbours X and Y ¢ I. X exercised his voting right while Y did not cast her vote in general election ~ 2019. Is XRY? Give reason. (d) Mr.’X’ and his wife ‘W’ both exercised their voting right in general election -2019. Is it true that XRY and YRX? Give reason. (a) Three friends F,, F; and F, exercised their voting right in general election- 2019. Is it true that F,RF,, F,RF, = F,RF,? Give reason. OR (iii) (&) Mr. Shyam exercised his voting right in General Election ~ 2019, then find the equivalence class of Mr. Shyam. Sol. We have a relation ‘R’ is defined on J as follows: Re {V;, V3}: Vz, Vp € Land both use their voting right in general election - 2019} ( Twoneighbours X and Y ¢ 1. Since X exercised his voting right while Y did not cast her vote in general election - 2019. Therefore, (X, ¥) ¢ R. (ii) Since Mr. "X’ and his wife ‘W" both exercised their voting right in general election - 2019. Both (X, W) and (W, X) ¢ R. (iii) (a) Since three friends Fy, F, and F exercised their voting right in general election — 2019, therefore (Fi, Fa) €R, (Fy, Fy) € Rand (Fy, F:) €R. OR (iii) (b) Me. Shyam exercised his voting right in General election-2019, then Mr. Shyam is related toaall those eligible voters who cast their votes. 20 mideampeademram ° G@ Xam2. Read the following passage and answer the following questions. Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice, Sherlin’s sister Rafi observed and noted the possible outcomes of the throw every time belongs to set {1,23,45,61. Let A be the set of players while B be the set of all possible outcomes. ={5, D, B={1.234,56} [CBSE Question Bank] (i) Let R: BB be defined by R = ((x, y):y is divisible by x). Verify that whether Ris reflexive, symmetric and transitive. (di) Raji wants to know the number of functions from A to B. Find the number of all possible functions. (a) Let R be a relation on B defined by R= {(1,2), (2,2), (1,3), (3, 9, 3, 1), 4,3), (5, 5)}. Then Ris which kind of relation? OR (ii) (b) Raji wants to know the number of relations possible from A to B. Find the number of possible relations. Sol. (i) Given R: B+ Bbe defined by R = {(x, y) :y is divisible by x). Reflexive : Letx € B, since x always divide x itself. (2) ER Itis reflexive, Symmetric: Letx,y € Band let (x,y) € R. = yis divisible by x. = 1 =k,, where k; is an integer. UxneR Itis not symmetric. ‘Transitive : Let x,y,z € Band let (x,y) eR = Zk, where kis an integer. and, (y,2) €R => 77 ky, Where hy is an integer. i ky =k (integer) = @2eR Tt is transitive. Hence, relation is reflexive and transitive but not symmetric. IFAM | GXAM _hebe@eae renctions 21(ii) We have, A={S,D} => n(A)=2 and, B=(1,2,3,4,5,6) > 8 Number of functions from A to B is 6” = 36. (iii) (@) Given, R bea relation on B defined by R= (1,2), (2,2), (1,3), (3,4), 3, 1), 4 3), 6, 5)) Ris not reflexive since (1, 1), (3,3), (4,4) ¢R Ris not symmetric as (1,2) € R but (2,1) ¢R and, —_Risnot transitive as (1, 3) ¢ R and (3, 1) e Rbut (1,1) ¢R «. Ris neither reflexive nor symmetric nor transitive. OR (if) @) -s n(A)=2,n(B)=6 = — (Ax B)=12 :. Total number of possible relations from A to B = 2"? 3. Read the following passage and answer the following questions. 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 a relation on L. [CBSE Question Bank] (@ Let relation R be defined by R relation R? (Gi) Let R = ((Ly, 13): Ly LL, where L,, 1,€1}. What is the type of relation R? (Gfi) (a) Check whether the function f:R — R defined by fix) = x ~ 4 is bijective or not. OR (fi) (b) Let f:R—R be defined by fix) = x + 4. Find the range of fla). Sol. (i) Given relation R defined by R= {(LyL,): Ly [Lp where Ly, L, € L} Reflexive: Let ye L > Ly [Ly > (ty LER. <. It is reflexive. Symmetric: Let L,,L, € Land let (Ly L,) €R. SLI, > Lill, = @,L)eR +. Ttis symmetric. Transitive: Let Ly,L,1,€L. and, let (L,,L,) € R and (LL) €R Ly||L, and LIL = Lil =U,LeR It is transitive. Hence R is an equivalence relation. 2 omic OHO A m:( (Ly Ly): Ly || Ly where Ly, L,©1}. What is the type of > @xXam_Iidea(ii) Given zelation R defined by R= {(L,,L,) Ly 4.1, where Ly, L, € L} Reflexive: Since every line is not perpendicular to itself = (Ly L)eR It is not reflexive. Let Ly, L, € Land (Ly L,) €R Shh > bik >(yb)eR :. Itis symmetric. Transitive: Let Ly, LL, €L and, let (L,,[,) € R and (LyL3)€R Lib ad hil Sully > Ger Itis not transitive. Hence relation R is symmetric but neither reflexive nor transitive. (ii) @) Given function f:R +R defined by fx) =x-4 Symmetris Injective: Let 1 x, ¢ Ruch that 4 # x. 2 4-4-4 = fix) # Ax) Itis injective Surjective: Lety=x-4 = xeyt4 For every y € R (co-domain) there exists x = y + 4 € R (domain). ie, Co-domain = Range Itis surjective. ‘Hence given function is bijective. OR (ii) (b) Given function f:R—R defined by fx) =x+4 Let ysf) > yext4 = xey-4 Fory € R (co- B be defined by R= (x, y): x and y are students of the same sex}. Check if Ris an equivalence relation in B or not. OR (ii) (b) A function f: B > G be defined by f = (@,, g), (by 8), (by 1). Check if f is bijective, Justify your answer. Sol. B= {by, by bsl, G= [gx 8al n(B) = 3, n(G) =2 n(B x G) = n(B) x n(G) =3 x 2= (i) Number of relations from B to G = 2° (ii) Number of functions from B to G = 2"*9 = (n(G)"=23 «8 (ii) @ R:B—B, R= Reflexive: (ex)eRVxEB => — Risreflexive. ‘Symmetric: Let (x,y) © R > xand yare of same sex. = yand x are of same sex. > wxeR ‘Transitive: Let (x,y) and (yz) €R = xandy are of same sex. and y and z are of same sex. = xand zare of same sex. => 2) eR = Ristransitive. Hence R is reflexive, symmetric and transitive (x, y) |x y students of same sex} = Ris an equivalence relation in B. OR Gi) © (br 81) (bas 82), bs, 81)) Alb) = 1 and flbs) = $1 = fib,) =flb,) but b, +b, As by and bs represents two different boys. = isnot one-one. = __fisnot a bijective map. 5. Read the following passage and answer the following questions. Dhanush wants take a test ofhis son Amitis a student of class XII. Dhanush said to Amit, “Observe the two functions fix) and g(x) carefully” f: R > R,g: B > R such that fa=x, gix)=2 24 oma mpeMegram | (OxXam‘The Dhanush asked some questions related to fx) and g(x) and Amit answered correctly. Write the correct response given by Amit of the following questions. (i) Check whether flx) is bijective or not. (Hi) Check whether g(x) is bijective ornot. Sol. (i) f: R + R such that fx) =x One-one: Let x;, x2 € R (domain) such that fi=fa) 3 =m = fisone-one. Onto: Lety © R (Co-domain) such that fey = tey Now fla) =f) =y So for y ¢ R (Co-domain) 3x =y€ R (domain) stich that fix) = => _ fisonto. Asfisone-oneandonto. = — f isbijective. (ii) We have g: R — R such that gaa One-one: 1,-Le R (domain) such that g()=1.gC1)=1. ie, — g(l)=g(-1) bute = — gisnotone-one. g@)=2720VxeR RG) = (0, 2)# R (Co-domain) => gisnotonto. ie,, gis neither one-one nor onto. CONCEPTUAL QUESTIONS 1. Let A = (1, 2,3, 4. Let R be the equivalence relation on A x A defined by (a, b) R (c, d) iff a+d=b +c. Find the equivalence class [(1, 3)]. [CBSE Sample Paper 2018] Sol. (x, y= Ax Aix+3 = yt 1]= (x,y) © Ax Ary—x=2) (1,3), 4) 2 (x, yx + 2y = 8) is a relation on N, write the range of R. [CBSE (AI) 2014) Sol. Telegram : @Xam_de@aernions as3. State the reason for the relation R in the set {1, 2, 3) given by R = ((1, 2), @, 1)} not to be transitive. ICBSE Dethi 20111 Sol. Ris not transitive as (1,2) ¢ Rand (2,1) € Rbut (1,1) eR. [Note: A relation R in aset A is said to be transitive if (a,b) € Rand (b,c) € R => (a,c) € R¥ a,b, ce R] 4. Let R=((a,22):@ is a prime number less than 5} be a relation. Find the range of R. [CBSE (F) 2014] Sol. Here R= {(a,a°):a isa prime number less than 5) = R=(2,8), 627) Hence range of R = (8, 27]. 5. A relation R in the set of real numbers R defined as R = ((a, b): Va = bl is a function or not. Justify. [CBSE Sample Paper 2021] Sol. No. R= (a,b): a =b) not the function because s/a does not exist for all a € (- 4,0). Image of all elements of domain does not exist. 6. An equivalence relation R in A divides it into equivalence classes A,, A,, Ay. What is the value of A,UA,UA, and A,NA,NA,? [CBSE Sample Paper 2021] Sol. A,UA,UA, = Aand A,1.A,45= 6 7. A relation R in S = (1, 2, 3) is defined as R = ((1, 1), 1, 2), ©, 2), G, 3)). Which element(s) of relation R be removed to make R an equivalence relation? Sol. (2,1) because if (1, 2) R then for being symmetric (2, 1) should belong to R. 8. How many reflexive relations are possible in a set A whose 11() Sol. Number of reflexive relation 2""-" = 2°°-® = 2° reflexive relations 9. IfX and Yare two sets having 2 and 3 elements respectively, then find the number of functions from X to Y. Sol. Number of functions from X to Y = 3*=9. Very Short Answer Questions 1. Check if the relation R in the set I of real numbers defined as R = {(a, b) : a acbthenbsa > (aeR Itis not symmetric. 1 (i) Transitive: Let a,b,c © R (set of real number) H@b eR = acb “ and()©R => bec From (i) and (if), we have acc > @OER Itis transitive 1 [CBSE Marking Scheme 2020 (65/5/1)| 2» nnwerbhalegram :@Xam_iIdeaSol. Sol. 4 Sol. & Sol. Write the inverse relation corresponding to the relation R given by R = ((x, y):x € N,x<5,y =3} Also write the domain and range of inverse relation. Given, R= ((x,y):x €N, x<5,y=3} > R=10,3),2,3),8,3,43) ‘Hence, required inverse relation is R*=(G,1),8,2),8,3)6,9)} of R* = {3} and Range of R* = {1,2,3, 4} A function f: A > B defined as f(x) = 2x is both one-one and onto. If A = (1, 2, 3, 4), then find the set B. [CBSE 2023 (65/1/1)] Given a function f: A> B defined as f(x) = 2r is both one-one and onto. ifA={1,2,3,4) » fl) =2x1=2,2)=2x2=4,f(3)=2x3= band fid)=2x4=8 2 (2,4, 6,8} Consider f:R, — [4, ) given by flx) = x” + 4. Show that fis invertible. [CBSE (AD 2013; F) 20111 ‘One-one: Let x1, 2 ¢ R, (Domain) fl) = flr) =e xp eden +4 > nok [xy x, are +ve real number] Hence, fis one-one function. Onto: Lety € [4,©) such that y=fx) ¥xeR. [set of non-negative reals] > yetea > x=yy-4 [. xis +ve real number] Obviously, V y ¢ [4, 2), xis real number ¢ R, (domain) ie, all elements of codomain have pre image in domain. = fisonto. Hence, fis invertible being one-one onto. Letf: R- {-4} ~-R bea function defined as ftx) = ,"* 7. Show that, inf: R -{-4} -+ Range of f,fis one-one and onto. [CBSE 2017(0)] 4 Let x2 € R- th 4, __ Now fim)=fe) > 323g" 3a0 > ByMtlby=yytlon > Wby=l6n > 4=% Hence fis one-one function. Since, co-domain fis range off. 4 So, f:R- {4} ~> Range of fis one-one and onto function. = Telegram : @Xam_hle@aemeos 2(CBSE Delhi 2010] (x=1) if x-1>0 or x>1 -(x=1) if x-1<0 or x<1 Gedy, @-1) Range of fix) = (+1, 1} 7 Let f:R—R be the function defined by flx)= y—1.z, ¥ xe R. Then, find the range of f. INCERT Fremplar] Obviously, x -11= 1, @ vx1, f(x) 1) Sol. Given function, f0)= atogg VEER uu UD > : sxngesey [2] 8. Prove that the function fis surjective, where f: N+ N such that * 11 seni Z vifnis odd n Sy ifmiseven Is the function injective? Justify your answer. [CBSE Sample Paper 2023] fin) Short Answer Questions 1. Check whether the relation R defined on the set A = {1, 2, 3, 4, 5, 6}. as R= {(a,b):b =a+ lhis reflexive, symmetric or transitive. [CBSE 2019 (65/2/1)] 2 nowepaegram :@Xam_IdeaSol. Detailed Solution: Given relation R defined on the set A = {1,2, 3, 4,5, 6] as R= {(a, }):b=a+1) Now, Reflexivity: Leta € A Wehave,aza+1 => (a,a)¢R Itis not reflexive, ‘Symmetric: Let a= 1 and b= baatl > 2=1+1 3 @BER butazb+lasl42+1 > @aeR It is not symmetric. Transitive: Leta, b,c eA Now, if @b)eR > beat i) and eR > cab+1 (ii) From (i) and (i), we have cx(@tIt1sat2 = c=at2 > @OER Isis not transitive. Hence, relation R is neither reflexive nor symmetric nor transitive, ‘Show that the relation R on the set Z of all integers, given by R = {(a,b) :2 divides (a - b)}is an equivalence relation. [CBSE 2019 (65/3/1)] Given relation R = {(a, 6) : 2 divides (a b)} on the set Z of all integers Reflexive: Leta ¢ Z Since (a- a) =0, which is divisible by 2 ie,, (a) € R Ris reflexive. Symmetric: Let a,b ¢ Z such that (4,b)¢R => (a-D)is divisible by 2. => ~(a—b) is also divisible by 2 = (b-a)isdivisibleby2 > (aeR => &aeR jeabea ie, @beR Ris symmetric. Transitive: Leta,b,ce Z such that (a,b)¢R => (a—b)is divisible by 2. Let a-b = 2k, where k, is an integer and (b,c)e R = (b-c)isdivisibleby2 = b-c=2k; where kyis an integer Adding (i) and (ii), we have (a-b)+(b-)=2(ky +h) > a-c=2(+k) > (a-c)is divisible by 2. => @oeR Telegram : @Xam_leeaennion 2Ris transitive. Thus, Ris reflexive, symmetric and transitive. Hence, given relation R is an equivalence relation. 3. Show that the relation $ in the set A = [x ¢ Z:0 @aes It is reflexive relation, ‘Symmetric: Let a,b AThen (a,b) ¢S = |a-b| isdivisibleby 3. = _|b-a| is also divisible by 3. => baes < Itis symmetric relation. Transitive: Let a,b,c A Then (@b) <5 => |a~b| isdivisible by 3. (© S = |b-c| isdivisible by 3. ab + b—c=+3ky + 3k = + 3k; +h) |a-c| is also divisible by 3. Goes ©. Itis transitive relation, Hence, the relation $ is an equivalence relation. 4. Show that the relation Ron IR defined as R = (a, b) : a < bl, is reflexive and transitive but not symmetric. [CBSE 2019 (65/1/1)1 +3k,, where ky isan integer ..(0) ++3hy, where ky isan integer (fi) > > Sol. [= aa) eR ter ad eck here Rs stata woe The elation DER ams ODER : & amd bse where a,b ,6 € IR — If seal A @oek + The wee-intr_telaton a TRANSTE cen wet het Gre CR, OremBR (0 61 = » onuehetegram : @Xam_IideaRis transitive. Thus, Ris reflexive, symmetric and transitive. Hence, given relation R is an equivalence relation. 3. Show that the relation $ in the set A = [x ¢ Z:0 @aes It is reflexive relation, ‘Symmetric: Let a,b AThen (a,b) ¢S = |a-b| isdivisibleby 3. = _|b-a| is also divisible by 3. => baes < Itis symmetric relation. Transitive: Let a,b,c A Then (@b) <5 => |a~b| isdivisible by 3. (© S = |b-c| isdivisible by 3. ab + b—c=+3ky + 3k = + 3k; +h) |a-c| is also divisible by 3. Goes ©. Itis transitive relation, Hence, the relation $ is an equivalence relation. 4. Show that the relation Ron IR defined as R = (a, b) : a < bl, is reflexive and transitive but not symmetric. [CBSE 2019 (65/1/1)1 +3k,, where ky isan integer ..(0) ++3hy, where ky isan integer (fi) > > Sol. [= aa) eR ter ad eck here Rs stata woe The elation DER ams ODER : & amd bse where a,b ,6 € IR — If seal A @oek + The wee-intr_telaton a TRANSTE cen wet het Gre CR, OremBR (0 61 = » onuehetegram : @Xam_Iideathatio. to be syuamervii -_ A) ahaa alee “Tropper sAnswer ZT, 5. Check whether the relation R in the set N of natural numbers given by R={(a,b): ais divisor of b} is reflexive, symmetric or transitive. Also determine whether R is an equivalence relation. [CBSE 2020 (65/2/1)1 Sol. Given relation R on the set N of natural number given by R=((a, 8): as divisor of 6) Reflexive: Let aeN We have a is divisible by a itself aRaie, (aa) ER Itis reflexive. Symmetric: Leta, b EN + @Rb= ais divisor of b. = b= ka, where kis any positive integer. wy Bake B14 anyinege = bisnotdivisor ofa > (a) ¢R ~ Itisnot symmetric. Transitive: Leta, b,c © R @Rb = aisdivisorofh > b= ka off) where ky is any positive integer and,bRe = bis divisor of c. = cok where ky is positive integer From (i) and (ii), we have c=kxka > cekka = S=kk= positiveinteger = aisdivisorofe > — @dER = aRe ~. Itis transitive. Hence, R is not an equivalence relation. 6. Let A={1, 2,3, ..., 9} and R be the relation in A A defined by (a, b) R (c,d) ifa+d=b+c for (a,b),(c,d) in A x A. Prove that R is an equivalence relation and also obtain the equivalence class [e951 INCERT Exemplar] Telegram : @Xam_he@aerncronSol. 2 sol. fo)= Ix1={ Sol. Given that, A= {1,2,3,..., 9] and (a,b) Rc, d)ifa+d=b +e for (a,b) ¢ Ax Aand (c,d) AXA. Reflexive: Since (a, b) R(a, b) as atb=b+aVabeA So, R is reflexive. ‘Symmetric: Let (a, b) R(c, d) then a+d=bec +a = (6,d) R(a,b) > c+ So, Ris symmetric. Transitive: Let (a, b) R(c, d) and (c, d) Rie, f) then +eande+fedte > +eandd+esctf b+0)-(c+f) > (a-e)=b-f > atfabre > P)RE/) So, Ris transitive. Hence, R is an equivalence relation. Now, equivalence class containing [(2, 5)] =((cy) | 2+y=543) ((@y) | y-x=3) ={(1, 4), 2, 5), 3,6), 4-7), 6, 8), (6, 9). ‘Show that the modulus function: —- R given by f where |x| is x, if ris positive or 0 and |x| is—x, if x is negative. x ifx20 -1,ifx<0 x], is neither one-one nor onto, ‘One-one: Let x; = 1, x ==1 be two elements belongs to R fxs) =f) = [1] and fle) = fil) == 1) = fea)= fle) for x, # x, => fl) is not one-one. Onto: Let f(x) > fix)isnotonto. Hence, fis neither one-one nor onto function. Let A= R- (3), B= R- (1). Iff:A > B be defined by fix)=2=3, vx © A. Then, show that fis bijective. INCERT Exemplar] Giventhat, A=R-(3),B=R-(1). 1 > |x| =-1 eR, which is not possible. {2A Bisdefined by fix)= 7-3, VxEA For injectivity: Hr? _ 2 Let fe) = fe) = Gaga Gag > (&,—2)@%2—-3) = @- 2) -3) > Xp X27 Bx, Dep + 6 = 1% 3ty— 2x + 6 = fy — 2k, = ~3xy = Dey > 2% So, fix) is an injective function. 2 uowepetegram : @Xam_IideaFor surjectivity: Let x-2=xy-3 2-3y > = > [codomain] So, x) is surjective function. Hence, fx) is a bijective function. 9 Let A = R-(2}and B= R-{1}. If f: A> Bis a function defined by fi) , show that fis one-one and onto. [CBSE 2019 (65/4/2)] Sol. Let x, € R-{2}such that f(y) =f (x) 1_%-1 = % %-2 > yy Pym +2 = yHy-Zy—my +2 1 > nen So fis one-one. % For range let flr) = xol es 1 => fisonto. % [CBSE Marking Scheme 2019 (65/4/1)] (NEP))) Long Answer Questions 1. Let N denotes the set of all natural numbers and R be the relation on N x N defined by (a, b) R (c, d) if ad(b + 0) = bela + d). Show that R is an equivalence relation. [CBSE Dethi 2015] [CBSE 2023 (65/4/1)] Sol. Here R isa relation defined as R= {(a,),(c, d)] :ad(b +c) = bela + d)} Reflexivity: By commutative law under addition and multiplication btasath VabeN ab = ba VabeN aab(b + a) = ba(a +8) VabeN > @ HRW) Hence, Ris reflexive. ‘Symmetry: Let (a, b) R (c,d) , 8) R(c,d) = ad(b +0) = bo(a+ d) Telegram : @Xam_kea 8= bela +d) = cb(d +a) = (dR, b) Hence, R is symmetric. Transitivity: Let (a, 6) R (c,d) and (c,d) Re, f) Now, (@, 6) R (c,d) and (¢,d) R (ef) = adh +0) =be (a +d) and offd +e) =dec+f) = bt+e_atd dte_ctf Bead 88d Ge => afbtey=beatf) = @bREA [cd #0] Hence, R is transitive, In this way, Ris reflexive, symmetric and transitive. Therefore, R is an equivalence relation. 2. Determine whether the relation R defined on the set R of all real numbers as R = ((a, 6): a,b ¢R and a—b+ 3 ¢ S, where Sis the set of all irrational numbers}, is reflexive, symmetric and transitive. [CBSE Ajmer 2015] Sol. Here, relation R defined on the set R is given as R= {(a,b):a,b ¢ Randa-b+ 3eS) Refiexivity: Let a € R (set of real numbers) Now, (a,a) € Rasa-a+ ¥3= ¥3eS ie, Ris reflexive. Symmetry: Taking a= /3 and b=1,we have @ WE Rasa-b+ 3 =V3-14+V3=2V3-1ES But b-aty3=1-V3+y3=1¢5 > @@eR As (a,b) © Rbut(b,a) ¢ R. + Risnot symmetric. Transitivity: Taking a= 1,b= /2 and c= 3 (a b)eRasa-b+V3=1-V2+vV3ES = @bHeER /2-\3+V3=\2eS => bQeER But a—c+/3=1-y3+/3-125 = @ ER As (a,b) and (¢, d) belongs to R but (a,c) does not belong to R. + Risnot transitive. Hence, R is reflexive but neither symmetric nor transitive. 3. Show that each of the relation R in the set A= {x ¢ 2:0 Sol. A=(xeZ:0 |x-y| isa multiple of 4. or x-y=24p — (pisany integer] > yrx=F4p = ly-x|isamultipleof4. = (,x)eR > Ris symmetric. Transitive: Let x,y,z € A, (x,y) € Rand (y,z) €R |x-y| is multiple of 4 and | y—z [is multiple of 4 x-y is multiple of 4 and y-z is multiple of 4 (x-y) + (y-2) is multiple of 4 = (x-z)is multiple of 4. |x-2| is multiple of 4. = (z)eR = Ristransitive. So, R is an equivalence relation. Let B be the set of elements related to 1, B= {ac A: |a—1| is multiple of 4} > B={1,5,9) fas [1-1] =0, [5-1 |=4, [9-1] =8] (i) R={@,b):a=6) Reflexive: Let x A vuUUY as =x > (uxeR > Risreflexive. Symmetric: Let x,y ¢ A and (x, y) €R > xy > y=x > Wx > R Ris symmetric Transitive: Letx,y,z¢ A and let (x, y) € Rand (y, 2) eR > xsyandy=z => «. Ris an equivalence relation. Let C be the set of elements related to 1 C={a¢ A;a=1}= {1}. ‘Check whether the relation R in R defined by R = {(a, b) : a < b*} is reflexive, symmetric or transitive, {CBSE (Delhi) 2010] R=((@@,b):asb Wa,be R} Reflexivity: Hore 4 R (Real number) > @2)eR > Ristransitive. a4 a fy aif and E> Lor $>(3) ord 4(Z) vo, (jer ’ 33 2. Risnotreflexive. Symmetry: 1,2 ¢ R (Real number) and 158 orl? > Telegram : @Xam_hele@ae vaio ss(1.2) eR but@, eR [> 2>10r2> 1] 2. Risnot symmetric. Transitivity: Here 10,3,2.¢ R (Real number) and 10527 or 10537 50, (10,3) eR and 3<8 or 3<2° £0, GER But 28 or 1022) or 1¥2 So, (10,2) So, here (10, 3) e Rand (3,2) < Rbut (10,2) ¢R » Ris not trai 5. Given a non-empty set X, define the relation R in P(X) as follows: For A,B ¢ P(X), (A, B)e Riff Ac B. Prove that R is reflexive, transitive and not symmetric. [CBSE Sample Paper 2023] Sol. Reflexive: Let A ¢ P(X). Then ACA => (AADER Hence, R is reflexive. Transitive: Let A, B,C e P(X) such that (A,B), BOER = ACBBEC SACCH(ACER Hence, R is transitive, ‘Symmetry: 4, X e P(X) such that 6c X. Hence, (, X) € R. But, X x6, which implies that (X, 6) € R. Thus, R is not symmetric. Let N be the set of natural numbers and R be the relation on Nx N defined by (a, b) R (c, d) iff ad = be for all a,b, c,d © N. Show that Ris an equivalence relation. ICBSE Sample Paper 2023] (CBSE 2020 (65/1/1)] Sol. sone etegram : @Xam_IideaSol. E Ayromenic. id abed en Tet abe det EN |_ uch Mok Caw RCerd> and Cod) Rees 3 od=be 3 cesde _tarbyr Cet) [ ceFos aw O.ARCod and (ed) R CEA 3 CoeyRCErh) | Ole-c1d eo EN I éeThe (elation 's kangitive ___|ns tne xetarion G TeAlextve, Symmevic and Hangve |b ie an equivelerBemiiittron po — [Topper’s Answwer 20201" A telation R is defined on a set of real numbers R as R={Gy, y): x.y is an irrational number!. Check whether R is reflexive, symmetric and transitive or not. [CBSE 2023 (65/5/1)] A relation R is defined on a set of real numbers R as R = {(x, y) : xy is an irrational number). Reflexive: Letx=v3eR 34 an irrational number 2 VB = (V3,v3)ER It is not reflexive. Symmetric: Let x, yeR G@y)eR => xyisanirrational number = pis also an irrational number KAM bbe@aerncion: s7 ram>. eR <. It is symmetric Transitive: Let x,y,z © Rsuch thatx=1,y= /2,2=3 if(x,y)¢R > xyisanirrational number ic, 1x V2 = v2 is an irrational. and, (y,2)€R > yz = V2 x3=3y2 isan irrational Now, (x2) > xx2=1x3=3 + (3) eR ~. It is not transitive. Hence, R is symmetric but neither reflexive nor transitive. 8. Consider f: R, — [-9, «) given by fix) = 5x” + 6x - 9. Prove that f is invertible. ICBSE Allahabad 2015] Sol. To prove fis invertible, itis sufficient to prove fis one-one onto. Here, (fix) = 5x2 + 6x-9 One-one: Let x, x2 € R,, then fle) = fle) => 5x? 6x, -9* Sx? +6, => Sx? +6x, -5x2-6x,=0 > 5x? -x7)+ 6G, -x,) =0 5a Vt) +6 —x)=0 > (2, -2,)(5y, +5, +6) =0 = 5x, +5x, +6 #0] ie, fis one-one function. Onto: *- fle) 522+ 62-9~8[x74 2123-3} 3 + 5fotsaxe~3«(3) -(3)-3] = {(x+2) 3] -9 = fe2-9 54 5) 35 = R= (+9, 00) = condomain. As fis both one-one and onto. = fis bijective. Hence, fis one-one onto function, ie, invertible. 9. Consider f:R, > [4, ©) given by fix) = x" + 4. Show that fis invertible. [CBSE (AI) 2013; (F) 2017] Sol. One-one: Let x, x) ¢ R, (Domain) fie) = flea) > 2 owe etegram : @Xam_ideaa Mem [xy xare +ve real number] Hence, fis one-one function. Onto: Let y € [4, 0) such that yfx) VxeR, [set of non-negative reals] Ss yeted > oxn\y-4 [xis + ve real number] Obviously, ¥ y € [4, 00), x is real number R, (domain) i, all elements of codomain have pre image in domain. = fisonto. Hence, fis invertible being one-one onto. 10. Show that the function f (-«¢, 0) + (-1, 0) defined by f(x onto. [CBSE 2020 (65/3/1)1 Tala’* € ©, is one-one and Sol. Let x, =(~ 20,0) such that ffx) = f(x.) ie, = 1 > A-5y > n= ©. fisone-one. 1 Let y€(-1,0), such that y = 7 all ee = aah 1 For each y <(-1,0), there exists x (-00,0), Bey such that f(a) = Age aa i sae fl ie Ty Hence fis onto. [CBSE Marking Scheme 2020 (6513/1)] 11. Prove that the greatest integer function f:R — R given by fj) = [x], is neither one-one nor onto, where [x] denotes the greatest integer less than or equal to x. [CBSE 20170) Sol. f:R—R given by f(x) = [x] KAM beereterunctions 39Injectivity: Let x, = 2.5 and x, = 2 be two elements of RB. f(%) =f(2.5) = [2.5] =2 fa)=fQ= (x, ) for, 2a is not one-one i, not injective. 5 R beany clement. =25 Which is not possible as [x] is always an integer. = [() = [xis not onto ie, not surjective 12. Let f: WW be defined as fn) -| ‘Show that fis invertible. Here, W is the set of all whole numbers. [CBSE (Panchkula) 2015] oie (mares BC! “Unt ign dh cide n-1, ifnisodd n+1, if mis even sot cit abuppore kab 9m, 6-0 I aptly. hut fd 429 [1 Lat coe 2 ip on, bn, ane ootd “ad =f TN uate Be comhardeatan. aca wears veldel: dt condeactiotion. Ad tase 4p hd ulm’ m de odd — fen) yey — yt] 2 met Dish NS Fara eae “Gd 0 umuenhaegram | @Xam_iIdea13. Consider f: R - {4}. >R- iG 5 a by faxr= Sol. in Ubhets no ho 40% ra Roars Uphich is een thor: 5 ana Geb ane ee Whudh is edd Lk einen ~avind Yai eW eisai | Be all e wthus—enist, dhe ainage Hfeomin gotta “nto « 44 Oe -Owr- anol Onde eee __[Topper’s Answer 2015] . Show that fis bijective. (CBSE (AI) 2017] = ler flu) = fa) eer Sey Beaty [Crerepeeaeu) Hema fx) frag) (nea) ie nye 190, + a2 yt lek ys vere any “gy (a2r4) eS es Telegram : @Xam_Hle@aen- «shay $16 eq = 1y 24 which sia_ot pouibu 7 Hamas % cannot be —¥ Heres =e) Ja ote dumetion + ole) aaa bide 4 aa wets: R- {41 5 R bea function defined as f(x) =. show that fis one-one function. 3 axed Also, check whether fis an onto function or not. [CBSE 2023 (65/4/1)] 4 Sol. Given function f:R- {3 ~R bea function defined as fx) = 57 Oneane tt 32 R-[ A] sch at eo Ax, dey and ax, # 31 > ayt4e area 4 te Bite 2 Mee fe {fit) is one-one function. Onto: Let y=fo)= 35 => Say +dy=4x = xQy-4)=-4y > ay = 4-3y Clearly when y= i. therefore does not exist vie, + has no pre image. Itis not onto, 15. A function f: [- 4, 4] > [0, 4] is given by f(x) = '16-x*. Show that fis an onto function but not a one-one function. Further, find all possible values of ‘a’ for which f(x)= V7. [CBSE 2023 (65/2/1)] Sol. Given a function f:[-4, 4] > [0, 4] defined by f(z)= 16-3”. Let y=V16-x? > y=16-7 > x=16-¥7 = x=/i6-7 Clearly for x to be real and xe[-4, 4] -¥20 > y-1620 39-4 944)20 => -4sys4 A) But y=/16-x7=0 (vx 20) 2 nnwerhalegram : @Xam_iIdea> y20 i) From (j) and (i), we have Osys4 ‘Thus, for every value of ye[0, 4] there exists some xre[-4, 4]. :. Given function is onto. When x24 => y=yi6-16=0 xe-4 => y=vi6-16=0 Here, different value of x there is some y. 50 it is not one-one. Hence, given function is onto but not one-one. Now, fla)=\7 (given) * 16-0? =7 = a=-3,3} 16. Prove that a function f : [0, ©) + [- 5, «) defined as fix) = 4x” + 4x - 5 is both one-one and onto. [CBSE 2023 (65/3/2)1 Sol. Given function f: [0, «) > [-5, «) defined as fix) = 4x + 4x-5 ‘One-one: Let x , x» € [0, ) such that x; 4x) 4x #41 dx) -Se4x)-5 Axp+ dy, 5 ¢ dx? +4x, 5 = fir) fee) Function is one-one. u u Onto: For x €[0,) se flat) = 4x? + 4x-5 = foy2-8 = R()=E5, @) - Given function is onto. Hence, function is both one-one and onto. Questions for Practice § Objective Type Questions 1. Choose and write the correct option in each of the following questions. () Let Rbe a relation on the set IN of natural numbers defined by nRm if n divides m. Then Ris (@) reflexive and symmetric (#) transitive and symmetric (©) equivalence (reflexive, transitive but not symmetric (ii) Let A = (1, 2, 3} and consider the relation R = {(1, 1), 2,2), G,3), (1,2), 2,3), (1, 3)}. Then Ris (@ reflexive but not symmetric (d) reflexive but not transitive (©) symmetric and transitive (@) neither symmetric nor transitive (iif) Ifa relation R on the set {1, 2,3} be defined by R= {(1, 2)}, then R is (@) reflexive () transitive (© symmetric (@ none of these Telegram : @Xam_hde@aenrion as(i) Letf:R + R be defined by f(x) tyre R. Then fis (@) one-one (®) onto (©) bijective (@ fisnot defined (o) EA ={1,2,31, B= (1, 4, 6,9] and R isa relation from A to B defined by ‘x is greater than y’. Then range of R is @ 114,69) (0) 14,6,9) © a (@ none of these (vi) FR = ((x, y):2,y ©Z, x" +y° = 4} isa relation in the set Z, then the domain of R is [CBSE 2021-22 (65/24) (Term-1)] (a) 10, 1,2} (){-2,-1,0,1,2} (c) (0,-1,-2) @ (10,1 (oii) Let X = {x2|]x © N} and the function f: N — X is defined by f(x) = x7, x « N. Then this function is. [CBSE 2021-22 (65/2/4) (Term-1)] (@) injective only __(b) notbijective _() surjective only _(@) bijective (viii) A function f:R > R defined by f(x) = 2 +27 is (CBSE 2021-22 (65/2/4) (Term-1)] (@ not one-one (8) one-one (©) not onto (@) neither one-one nor onto = Conceptual Questions 2. IfA=(3,5,7}and B= {2, 4,9) and R isa relation from A to B given by “is less than”, then write R as a set of ordered pairs. 8. Check whether the relation R in the set {1, 2, 3} given by R = {(1, 2), 2, 1))is transitive. 4. For the set A = {1, 2, 3}, define a relation R in the set A as follows R = {(1, 1), (2,2), (3,3), (1, )}- Write the ordered pair to be added to R to make it the smallest equivalence relation. A relation R in 5 = {1, 2,3) is defined as R = {(1, 1), (1,2), 2,2), ,3)}. Which element(s) of relation R be removed to make R an equivalence relation? 6. Check whether the function f :R —+ R defined as fx) = x* is one-one onto or not. ax, ifx>3 7. Let f:R—R be defined by f(x)=}x" , if1a+d=b+conthe Ax A, where A= (1, 2,3, ., 10 is an equivalence relation. Hence write the equivalence class of [(3, 4)]; a,b, c,d ¢ A. [CBSE (East) 2016] Check whether the relation R in the set N of natural numbers given by R={(a,b) sais divisor of b} is reflexive, symmetric or transitive. Also determine whether R is an equivalence relation. 25. Check if the relation R in the set R. of real numbers defined as R =|(a, b) : Yis one-one onto (bijective) function, then there exists a unique function ie, = ftM=x @ _—sfa)=y, xe Xandye¥ Principal value branches: Since trigonometric functions being periodic are in general not bijective (one-one onto) and thus for existence of inverse of trigonometric function we restrict their domain and co-domain to make it bijective. This restriction of domain and range gives principal value branch of inverse trigonometric function which are as follows: Range Function Domain (Principal value branch) -11) bn R-¢L) R-¢LY) R R The value of an inverse trigonometric function which lies in its principal value branch is called the principal value of that inverse trigonometric function. Principal Values: (@) Isin” ©) Tfcos 6 then @ sits principal value when -$ <0 <3. 0 then 0 is its principal value when 0<0< m. (©) Iftar x = 8 then 0 is its principal value when — i b< 1AM © (COX ari fish eenpaicrunctions a7 rok tal A] A = Rai ON Moe AN] [OFe|