Scribd
Upload
16 views26 pages

Relation&function

Chapter 1 covers the concepts of relations and functions, including Cartesian products, types of relations (identity, empty, universal, reflexive, symmetric, transitive, antisymmetric, and equivalence relations), and functions (one-to-one, onto, many-one, and bijective). It explains the definitions, properties, and examples of these mathematical concepts. Additionally, it discusses the composition of functions and their properties.

Uploaded by

belanishrey17
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
16 views26 pages

Relation&function

Chapter 1 covers the concepts of relations and functions, including Cartesian products, types of relations (identity, empty, universal, reflexive, symmetric, transitive, antisymmetric, and equivalence relations), and functions (one-to-one, onto, many-one, and bijective). It explains the definitions, properties, and examples of these mathematical concepts. Additionally, it discusses the composition of functions and their properties.

Uploaded by

belanishrey17
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
CHAPTER - 1 Relations and Functions ‘The topics and subtopics covered in relations and Functions for class 12 are: + Cartesian product of sets Relation ‘Types of Relations Types of Functions ‘Composition of functions and invertible functions Binary operations CARTESIAN PRODUCT OF SETS Let A and B be two non-empty sets. The set of all ordered pairs (a,b) such that a€ A and b € B is called the cartesian product of set A with set Band is denoted by A x B. ‘Thus, Ax B= ((a,b):a€ Aand be B} Note Bx A=((b,a):be Band ae A} Domain: Let R be a relation from a set A to a set B. Then the set of all first components of the ordered pairs belonging to R is called the domain of R. ‘Thus, Domain of R = {a: (a,b) €R] WA=(1,3,5,7},B 6,8,10} and R= {(1.8).( 3,6) ,(5.2), (1,4)} is a relation from A to B, then domain ={ 1,3, 5}. Range: Let R bea relation froma set A to aset B. Then the set of all second components of ordered pairs belonging to R is called the range of R. ‘Thus, Range of R= ab)ER) 3) and B then ,AXB Ly).(2x), 2y), ([Link]) RELATION Mathematically, "a relation R from a set A toa set Bis a subset of the cartesian product A x B obtained by describing a relationship between the first element x and the second elementy of the ordered pairs in A x B Representation: if( 2, b) € R then we writea Rb which is read as" ais related to b by the relation R” IF (a.,b) @ R then we say “ais not related to b under R” Note ax. Example IfA=(1.3,5,7),B=(2,4,6.8,10) and R= (1,8) (36) (.2),( 14)} is 2 relation from A to B, then range of R= [24,6,8}, RELATION ON A SET Let A be anon empty set. Then a relation from A to itselfie, a subset of A x A Is called a relation on set A. INVERSE OF A RELATION Let A,Bhe two setsand let R be a relation froma set Ato a set B Then, the inverse of R, denoted by R~? = {(b.a) :(.b) € R Clearly, (a,b) € Riff (b,a) € R- If A and B are finite sets consisting of m and n elements respectively, then A x B has mn ordered pairs, therefore , total number of relation from A to Bis 2” Let A be the set of students of class XII ofa school and Be the set of students of class XI of the same school. ‘Then relation R = {(a,b) € AxB: ais brother of b} Example \_Beanele 7 Let A= {1,23}, B= {a,b .¢,d] be two sets and R= (C1, a) (1,0) } relation from A to B but R~ (¢.1)} isa inverse of relation from B to A. ‘TYPES OF RELATIONS Identity Relation: Identity relation isthe one in which every elements related to Itself only. Le, Let A be a set. Then, the relation I, = {(a,a):a€ Apis called identity relation Example Let A be a nonempty set (1,2,3) {(L1),@.2),,3)) is a Identity relation. then R= Empty Relation Ifno element of A is related to any element of A, ie. R= @ © AxA, then the relation R in a set A is called empty relation Let A be the set ofall students of a boys school. Then the relation R = ((a, b):a is sister of b) is a empty relation, Universal Relation: Ifeach element of A is related to every element of A, Le. R = Ax A, then the relation R in set A is said to be universal relation, Example Let A be the set ofall students of a boys school. Then the relation R = {(a, b): the difference between heights of a and b is less than 3 meters} is universal set. Note Both the empty and universal sometimes called trivial relations. relation are Reflexive Relation: If (a, a) €R, for every a € A then Ris, called reflexive relation on Let A= {1, 2, 3) and R= {(1, 1), (2,2) ‘Then, Ris not reflexive since 3 € A but (3,3) ¢ R. Note ‘The identity relation on a non-empty set Ais always reflexive relation on A. However, areflexive relation on A is not necessarily the identity relation on A. Example (2, a),(b, b)(6, (a, b)} isa reflexive relation on set A={, b,c} but itis not the identity relation on A, ‘Symmetric Relation: If (ai, a2) € R implies that (a, a) €R, for all ai, az€ A then Ris called symmetric relation on A. ee Let A= (2,34) R= (23),8.2)) R = {2 3),3.2),(3,4)) Here &; is a symmetric relation on A but Ry is nota ‘symmetric relation on A because (3, 4) € Rs but (4, a)@R, C Note ‘The identity and the universal relation on a non- empty set are symmetric relations, A reflexive relation on a set A is not necessarily symmetric. ‘The relation R = { (1.1) @ 2), (33) (13) } is reflexive relation on set A = ( 1 2,3} but it is not symmetric, ‘Transitive Relation: If (as, a3) € Rand (a, as) € Rimplies that (as, a3) € R for all ay, 3,23 € A. Let A= {1,2,3} R= ((1,2),(2.1, (1.1) R= {2,2}, (2,3),(8,2),(8,3) Then, Ris not transitive since (2,1) €R (1,2) € Rbut (2,2) ¢R. R, istransitive (2,3) € Ry, (3, 2)e Ry = (2,2)€R, and (3,2)e Ry, (2,3)e Ry => (3,3)e Ry Note ‘The identity and universal relations on a non-empty set are transitive, Antisymmetric Relation: Let A be any set. Arelation Ron set ‘Ais said to be an antisymmetric relation iff (a,b) € Rand (b A)ER=a=bforalla,b EA. Let $ be a non-empty set and R be a relation on power set P(S) defined by (A, 8) € Riff subset Bfor all A, BE P(S). Then, R is an antisymmetric relation on P(S) , because (A,B) € Rand (B,A) €R=Aisasubset and B isa subset A => A ( Note ) ‘The identity relation on a set A is an antisymmetric relation, A relation which is not symmetric, is not necessarily anti ~ symmetric. EQUIVALENCE RELATION: A relation R in a set A is an equivalence relation if R is reflexive, symmetric and transitive, Example Let A=(1,2,3,4,5) bea set and the relation R= {(a,b):{a-b| iseven } defined on A then Risan equivalence relation. C Note Number of Equivalence relatio Number of symmetric relation = 27 Equivalence Classes: An equivalence relation on R defined on a set A partition the set A into pair wise disjoint subsets. These subsets are called equivalence classes determined by relation R. The set of all elements of A related to an element a € A is denoted by [a] = (x €A: (x, a) € R}.This is an equivalence class. The collection ofall equivalence classes form a partition of set A. SOME USEFUL RESULTS ON RELATIONS ‘Theorem 1: If R and A are two equivalence relations on a set ‘A,then RNS is also an equivalence relation on A. ‘Theorem 2: The union of two equivalence relations on a set Als not necessarily an equivalence relation on the set. Let A= (a, b,c} and let R and $ be two relations on Avgiven by R= ((a,a) ,(b, b), (c, ¢) (a,b) ,(b, a) } and = {(a, a) (bb), (6c) ,(b,¢) Cc, b)) Itcan be easily seen that each one of Rand S is an equivalence relation on A. But RUS isnot transitive, because (a,b) €RUSand (b,c) RUS but (a,c) ¢ RUS. Hence, R US is not an equivalence relation on A. ‘Theorem 3: If Ris an equivalence relation on set A, then R-* isalso an equivalence relation on A. FUNCTIONS Mathematically, “a relation ffrom a set A toa set Bis said to be a function if every element of set A has one and only one image in set B". In other words, Let A and B be two non ~ empty sets. A relation ffrom A to B Le, a subset of A x Bis called a function (oramapping or a map) from Ato B , if (0 Foreach ae A there exist € Buch that (a,b) €f (i) [a,b)efand(a, lef sb Representation: If Fis function from a set X toa set Y, then we write f: XY, which is read as fis a function from X to Y or FmapsK to, x Y Domain: In function f: A> B, the set A is called domain and the elements of A are called pre-images f: (1,2,3,4) > (2,4,9,16) defined by f(x) = 2x. Domain of function = (1,2,3,4) Co-domain: In function f:A +B, the set Bis called co-domain and the element of Bare called images. £:(1,2,3,4) > (1,2,3,..16}} defined by f(x) = 2x. 1.23, .,16} and range = {1,4,9,16). Range: The set ofall f- images of A is known as the range of For image set of A and is denoted by f(A), ‘Thus, (A) = (1(9) :x € A} = Range off. f: 1.2.34) > 0 range of f= (1,49, Thus, f:X- Y isa surjection ifffor each y €Y, there exists x€X such that f(x) = y. TYPES OF FUNCTIONS One to one Function: A function f:X—> Y is defined to be one- one (or injective), ifthe images of distinct elements of X under fare distinct, ie, for every xi, xz € X, f(x: ) = f{xz ) implies xi = xX Y { Note } Letf:A— Band letx, y€[Link] x= y > (9) = f(y) is always true from the definition. But f(x) = fly) = x= y is true only when f is one ~ If A and B are two sets having m and n elements respectively such that m X is always injective, 2if function f: R-r R, then (9 3. function f: + R, then I 2x is injective, 2x-+1 isinjective, Onto Function: A function f: X + Y is said to be onto (or surjective), ifevery element of Vis the image of some element of X under fe, for every y € Y, there exists an element x in X such that f( Let C= (1,2,3), D = (4, 5) and letg = ((1,4), (2,5), (3, 5)}.Show that the function gisan onto function from C into D. Solution: Domain set = (1, 2,3) We can see that the element from C,1 has an image 4,and both 2 and 3 have the same image 5. Thus, the Range of the function is (4, 5) which is equal to D. So we conclude that g: C +D is an onto funetion, ‘Many-one function: If two or more elements of X have same image in. ‘Thus, f: X + Y is a many one function if there exist x, y € X such that x # ybut f(x) = fy) x Y —— fa, b,¢) > y,2, w} defined by f(a) =x, f(b) = xand f= ¥ Into function: If there exists at least one element in B which does not have a pre-image in A. £ (1.23) + (A.B,C.D) defined by ((1) = f(3)=a One-one and Onto Function: A function f: X + Yis said to be one-one and onto (or bijective), iffis both one-one and onto. A 8 ‘The function f: R > R. (x) = 2x + 1 is bijective, since foreach y there isa unique x =(y~ 1)/2sueh that f(x) =y. (2) = B and Note It follows from the above discussion that if A and Bare two finite sets and f: A — Bisa function, then (i) fisan injection > n(A) B and g: B > C be two functions. Then the composition of f and g, denoted by gof, is defined as the function gof: A € given by; (gof)(X) = g(f09), forall x EA. Given the functions f (x) = x? + 6 and g (x) = 2-1, find (Fo g) (9. Solution: Substitute x with 2x~ 1 in the function fx) =x +6. (fog) (x)= (2x- 1)? + 6= (2x-1) (2-1) +6 PROPERTIES functions isnot he composition of commutative ic. fog + got. Theorem 2: The composition of functions is associative Le. fg hare three functions such that (fog)oh and fo(goh) exist, then (FogJoh = fo(goh) ‘Theorem 3: The composition of two bijections ie, if fand gare two bijection, then gof is also a bijection. Theorem 4: Let f: A+B. Then, fol, = Igof = f ie. the ‘composition of any function with the identity function is the function itself. ‘Theorem 5: Letf:A +B, g: B-+A be two functions such that gof = J,-Then Fis an injection and g is a ssurjection, Letf: A Band g: B-> A be two function such that fog = /[Link]. fis a surjection and g is an inje Theorem 7: Let f:A-Band g: B-Che two function, Then, ()) got: >Cisonto>g:B—Cis onto (i) got: A Cis one-one =f: A Bis one - ‘one (ii) gor: = f:A Bis onto (iv) gof: A Cis one-one and f: AB is onto = g:BCisone-one. INVERSE OF AN ELEMENT Let A and B be two sets and let [: A > B bea mapping. Ifa €A, {is associated to b € B under the function f, then bis called the fimage of aand we write itasb = f(a} ‘Theorem 6: Cis ontoand g: B Cis one -one We also say that a is the pre-image or inverse element of b under Fand we write a = f-1(b) Iff: A Bis abijection wwe can define a new function from B to A which associates each element y € B to its pre-image '() €[Link] function is known as the inverse of function Fand is denoted by f~! IFA=(1,234),B = (2,468) and. A ~ Bis given x. then write fand J-" asset of ordered Solution: ((1) = 2.f(2) =4 (3) = 6 and (4) =8 Therefore f= ((1,2),(2,4) (3,6) (48) } which is clearly a bijection On interchanging the components of ordered pairs inf, we obtain f= (2,),(2,4), (6 3), 8,9} PROPERTIES Theorem 1: The inverse ofa bijection is unique. ‘Theorem 2: The inverse of a bijection is also a bijection ‘Theorem 3: If f: A + Bisa bijection and g: B+ Ais the inverse of {then fog = I, and got = I, where 1, and i are the identity functions on the sets Aand Brespectively. Theorem 4: Iff:A— Band g: Care two bijection, then gol: A > Cis a bijection and (gof)” frog Theorem 5: Letf:A+Bandg:B— Abe two functions such that gof = I and fog = Ip Then f and g are bijections and g= f-" Theorem 6: Let f: A + B be an invertible function, then FN =F INVERTIBLE FUNCTION A function f X — V is defined to be invertible if there exists a funetion g: ¥— X such that gof= Ix and fog = ly. The function g Iscalled the inverse of f and is denoted by f- Find the inverse for the function f(s) = (3x42)/(a-1) Solution: First, replace f(x) with y and the function becomes, y= Gx12)/(e1) By replacing x with y we get, x= (@ye2)/(y-1) Now, solve in terms of x =x(y-1)=3y+2 axy-x=3yt2 Sxy-dy=24x Sy(x-3)-20x sy=(2+3)/(s-3) (x)= (8#2)/(03) If fis invertible, then F must be one-one and onto and conversely if Fis one-one and onto, then f must be invertible, BINARY OPERATION Abinary operation «ona set Ais function +:Ax A+[Link] denote « (a,b) bya*b Closure Property: A binary operation * on a non-empty set Phas closure property, ifa € P, be P>a*beP. Suppose addition be the binary operation and R be the set of real numbers. 243-55 5eR 6+-9=-35-3ER This is true for all real numbers R Associative Property: The associative property of binary ‘operations holds if, for a non-empty set S, we can write (ab) "c=a"(b* c), where (a,b,c) ES, Suppose multiplication be the binary operation and Robe the set of integers. Let,a=-3,b=5,and =240=ax (xo). 116. We can write (a * b) * All binary operations are Tot associative, for ‘example, subtraction denoted by ™ Commutative Property: A binary operation * on @ non- empty set Sis commutative, ifa * b= b* a, forall (a,b) €S. Suppose addition be the binary operation and N be the set fof natural numbers. Let, a= 4 and b= 5,a+b=9=b-+ a, where a,b belongs to set of natural numbers Distributive Property: Let * and # be two binary operations defined on a non-empty set S. The binary operations are distributive if, a* (b # c) = (a* b) # (a* c) forall {a,b,c} ES. Suppose * is the multiplication operation and # is the subtraction operation defined on 2 (set of integers), Suppose * is the multiplication operation and # is, the subtraction operation defined on Z (set of integers). Let, a=3,b = 4,and¢=7. Then,a"(b # ¢) =a (b~ 3(4-7)=-9. And, (a*b) # (a* c) = (ab) ~ [axc) = (8*4)-(3x7)= 12-21 =-9, Therefore, at (b Hc) = (ab) # (a* 6), forall (a,b, JZ Identity Element: A non-empty set P with a binary operation * is said to havean identity e € P, feta = a= ate, Va P. Here, is the identity element. isadditive identity for addition binary operation, Inverse Property: A non-empty set P with a binary ‘operation * Is said to have an inverse element, ifa* b= b* a =¢,¥ a,b, € € P, Here, ais the inverse of b, bis the inverse of and eis the identity element, is the additive inverse of ‘a’ under the addition binary operation. Where ‘a’ belongs to the set real numbers, iil Mind-Map ti suonouny R suONepay a. a. a. as. @. quo. qu. Ear Multiple Choice Qui I) ry operation on the setRa*b =1 ions as. Determine the bi for alla, DER. (2) +is only commutative (b) = is only associative (©) +s both commutative and associative (@) None ofthese Qs. Ief:R > Rs.t. f(a) = x2 and g:R > Rs.t.g() = 2x + 1,then fogis (2x8 +1 (2x41 (4241 {@) None of these 06. If f:R > Risa bijection given by Fx) = 2° + 3, then f-1() is: @e "6 Ole Q. yns have inverse 1,10), (2,10), (3,10), (4,10)} {A), (6,3), (7,4), (8,2)} Which of the following func F:(.23,4} > (2} with f 4} with g 911,13} with h = {(2,7), (8:9), (41), (5,13)} (0) g but not h and f (©)F butnot hand g (a) h but not f and g IFf: R= R, defined by f(x) = x2 + 1, then the values of | Q1% 1°-2(17) and f~"(3) respectively are (2) 6,(4,-4) (b) {3,-3),.@ Ooo (OK-4 aus. Me f:Z > Zs.t.f@) =x? +xVx € Z, then fis: (2) Many one (b) One - One (Onto (a) None of these aus. Let A = {1.2.3}. Then number of equivalence relations containing (1,2) is @1 )2 3 @e us. ION: @sf72@=4+394 Let A and B be sets. Then the function f:A x B > BX A such that f(a,b) = (b,a) is (a) One-one only, (b) Onto only (©) Into only (4) Bijective Let f:(1,3,4} > (1.2,5) and g: (1,25) > {1,3} be given by f = {(1,2),(3,5), (4.1)} and g = ((1,3), (23), (5,1)}- Then gof =? (@){G.3),3.1),4.3)) () (C13), Ga), 3.3)) (1(0.3),.B.,43).6.0} (@) None What is the minimum value of the expression 2? + ax+10 @-3 (b)-6 (go (a2 ‘What is the maximum value of expression 5 ~ 6x ~ x? (10 (b)12 ou (a) 16 Let A = (1,2,3). Then number of relations containing (1,2) and (1,3) which are reflexive and symmetric but not transitive is (@1 (b)2 (3 ws Number of binary operations on the set {a,b} are (a) 10 (b) 16 (20 @s Find the number of all onto functions from the set (12.3, 1) to itself [a)2"—n () 2" (ont wa IF f:R > Ris defined by f(x) = 2,find FF) (a) x4 — 6x" + 10x? — 3x +1 3x+ que. (0) x4 — 6x3 + 10x? 3-1 ()x* ~ 6x? + 10x? 3x (a) x4 — 6x? + 10x? + 3x In the following graph for x € [-1,1]; /(2) is defined by: q7. qs, 19. qo. qa. 2. qs. (@)bd+1 @)=[} +1 (-bk +4) @=b)-1 Find the domain of the function, f(x) = =**** @R-(25} (o) R- 3.4) (R- {45} (d) R- (12) ‘What is the maximum possible value of xy, where [x+5|=Bandy=9-|x-4] (a) 401 (o) 124 (104 (4) None If Aand Bare finite sets such that nA) = mand n(B) i, find the number of relations from A to B @2" (b) mk jm (mk +4 If) = then @rotr(Q=1 () Foy + F(Z)=0 crea.r)=0 @ F@).¢ 2)=2 Find the range of f(x) = [2x ~ 3] -3 (a) [3,.00) (b) (2,09) (0 [-2,00) (@)[-3,0) I f() isa one to one function, where f(x) = 1, then find the inverse of the f(x): (@) None of these 1F F(x) isa one to one function, where f(x) = [Link] the value off (2) + #-" 2) @y wt gas. ws. Q26, 7. gas. 2s. Q30, gsi. 932. 933. (@) None ofthese (b)5~* (a) None of these (9 f@) = (@) f@) we = (0) fx) = x54 (@) None of these Find the domain and the range of the function f[x) = ee” (@) Domain = R; Range = (0,1) (b) Domain = R- (0} ; Range (0) Domain = R- {0,1} ; Range (@ Domain = R ; Range = (0,1) Find domain of the function f(x) = — fa) (L.) (b) [0, 09) (c) (0,6) (4) [1, 00) If = (1,2,3},then the relation R = (1.2), 2,3),(.3)} in A is (@) transitive only (b) reflexive only (© symmetric only (@) symmetric and transitive only The domain of the relation {(x,y):y = le-1x€ Zand |x| <3} @)(-3,-2,-1,0,1,2,3) (0) {4,3,2,1,0) (6) (16,1,2,3,4) (a) None of these For any two real number, an operation defined by a + b= 1+ab then the value of 4+ 6 (@2s (0)26 (40 (as A function f(x) is linear and has a value of 29 at x = and 39 at x= 3,Then value of f(x) at x= 5is @34 43 (2 (a) 50 1Ff0) = (1.33 (9234 x#3,then f-4(—2) is equal to (b) 145 (03.33 34, 35. 036, a7. Qs. Q39. qo. 42, Qua. If solution of the equation 7cos x + 5 sin x = 2k + Lis possible, then the number of integral values of kis (a4 (b)6 (8 (d) 10 ‘The number of symmetric relation on a set with 5 elements is 2" we om wz Number of equivalence relation defined inthe set S=fa,b,od}is (as 12 (920 (29 If 6) = A BC) = f(FG9) and n(x) = f(eGx)).then f(x).g(x)-h(a) is equal to (a2 (b)-1 (3 @-3 Ify = 4sin®x ~ cos 2x then y lies in the interval (@) (1,5) (b) (1,5) (C15) (4) [-1,5] Let be the set of integers, Then the function f: Z > 2x2 defined by f(x) = (x- 1,1) forall x € Zis (a) Only one- one (b) Only onto (One-oneand onto (d) None of these What is the domain of the function f(x) = T-@-? @C1y (b) (0.1) O02 @O.2) . If: R > Rand g: RR defined by f(x) = 2x + 3 and g(x) = x? +7, then the value of x for which f (g(x) = 25's @tt #2 (+3 (@)t4 If f: RR defined by f(x) = function , then find f(x) is an invertible os wz oF oe . Let f:R +R, g:R—R be two functions such that f@)=2x-3,g(@x) =x +5, The function (fog) © is equal to oy (x oy ay Let » be a binary operation on set of integers ! defined by a+b = 2a+b—3, then find the value of 3 #4 (aa ()2 (06 (a7 qs. qas. qa. Q50. Qs. 52. Q53. Qs4. A binary operation * on the set (0, 1,2,3,4, 5) is _{ @tbifatb<6 ata naam (242 O SS sd identity element. @3 1 The number of commutative binary operations that can be defined onaset of 2 elements is @s 4 @2z @es @2 j@o . The number of bijective functions from set A to itself when A contains 106 elements is {a) 1061 (b) (106)? (©) (106)'°* (a) 106 Consider the following two binary relations on the set A=(a,b.c} Ry = [Ce .@), (6, b),(a,0),(€,€),(b,c) (a,a)} and Ry = (a,b), (b 0), (6), (6,2), (aa), (b,), (@,6)} Then (@) R, is not symmetric but itis transitive (b) Both Ry and R, are transitive (©) Rais symmetric but itis not transitive (d) Both Ry and Rz are not symmetric Let A=(1,2,3,..,m) and B={a,b} ‘Then the number of surjections from A into B is (aj2"-2 (b) 2" +1 2" (@)n4i Let f:A > B and g : 8 + C be the bijective functions. ‘Then (gof)~? is (@) frog (0) fog (jg ‘of * (@) gof If [x —5[x] +60, where [.] denote the greatest integer function, then @rep) (0) xe@23] (x e[23] (@) xe (24) Range of f(x) = is ofa] wl (Co, -1uf.«) @ [- Let f(x) = VIF, then FY) = FIFO) — 0) FGy) 2 £[Link]) (©) f(xy) $ FOO.F() (A) None of these Let R be a relation from the set {12,3 .., 60 to itself such that R= {(a,b):b = pq where p,q 23 are prime numbers }. Then, the number of elements in Ris (a) 600 (b) 660 (os40 (a) 720 Qss. Q56. Qs7. Q58. Q59. Q60. Qe1. Let f : R= R be defined as f(x) = ax? + bx +¢,a,b and c being fixed non - zero real numbers. Which one of the following statements is correct in general? (a) If 6? — 4ac > 0, then F-*(0) does not contain 0 (b) If? = 4ac < 0, then f~*(0) must contain 0 (6) lb? — 4ac > 0, then (0) may contain 0 (@) If b? ~ 4ac <0, then f~(0) may contain 0 ‘Te domain ofthe funtion [7+ RF Tis @o O0)anda # 1is (0,<2) and range of f(s) = R II Range of f(x) = vx Wx > 01s [0,00) Select the correct answer using the code given below : (@) only! (b) Only i (c) Both land II (d) Neither I nor I Q77, Which of the following statements is/are true? Lista =(a,b,e,d,e,f.g,h}and {(a,a), (bb) (4,4), (6,4), 9), (4.0) .(g,b).(g.g)} then RC Ax A IIsLet And B be two sets then number of relations from A to Bis 2"(4)"™#) Seloct the correct answer using the code given below: (a) Only 1 (b) Only 1 (© Both land t (@) Neither nor Q78. Which ofthe following statements is/are true? The signum function f : R + R, given by f(x) = 1, x50 o.x=0 Hijx<0 11 The modulus function is (x) = bxl.x € R UL Function f(x) = =+; defined on set of real numbers, Select the correct answer using the code given below: (a) only (b) Hand tit (land (@) Tand It Q79. Which of the following statements is/are true? Lf +R Ret. f(@) = cosx is one-one IL f :R-» Rst. f(x) = [x] is notone - one Select the correct answer using tie code given below (a) only (b) Honly (land 1 (a) Netther I nor Q80. Which ofthe following statements is/are true ? Lif fg +R > Raretwo functions defined as f(x el + x and g(x) = [xl ~x, x € R then (gof)(x) ower ILA fg: Raretwo functions defined as FG) = x1 “paand ols) |x| =x, ¥x € R then road (ep eeo selec the core anes sig the ode ven below rap iy hou Giada (a) Netter nor Q81. Match the columns Let A = {a,b,c} beasetand R, ,R;,Ryand R, are relations defined on the set A. COLUMN I COLUMN Ri Tempty relation Ca.) (a0), (b.D).Ce.6)} [Link] Th Tdentity relation {(@.),(b.a), (@.a), (6.4), (@c)) CRs = (@,a),(8,b),(.2)} Til Reflexive relation DR=o TV. Symmetric relation (@ASILBW,C>I,Do1 (b) AS1,B41,C511,D41V (QAS,B51V,C41,D>1 (@) ASW,B1C41,D5 m1

You might also like