Relations and Functions

CLASS XII
MATHEMATICS
By:DR. VIKRAM SINGH TANUSHREE SINGH
YEAR OF PUBLICATION-2010
All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, transmitted in any form or by any meansElectronic, Mechanical, Photocopying, Recording or otherwise, without prior permission of the Authors and Publisher
TM
SAVANT INSTITUTE
Mathematics
Relations and Functions
1
RELATIONS AND FUNCTIONS
_________________________________________________________________________________________________ Slide 1 Relations-: Two objects are said to related if there exists a recognizable connection or link between the two objects or quantities. The concept of relation can be applied to sets in which we relate the elements of one set with the corresponding elements of the other set. Let A and B be two sets. Then a Relation R from A to B is a subset of A B. Where A B represents the Cartesian product of the two sets A and B. Thus, if R is a relation from A to B then R A B ___________________ Slide 2 ___________________ Lets try to understand relation with help of a example suppose I have two sets A and B shown below in which the set A represents the collection of different vehicles and set B represents the collection of the values of speed of different vehicles. There exists a link or connection between the elements of the two sets this link is mathematically termed as relation. Slide 3 Now we know that the relation is a subset of the Cartesian product of the two sets so if we take the subset speed of particular vehicle then we will get S = {(bus, 40 km/hr), (car, 80 km/hr), (Jet plane, 500 km /hr), (Scooter, 60 km/hr)} Thus S will form a relation because it relates the elements of set A with the corresponding elements of set B Note-: Relation can exists between two same sets also it is not necessary that the two sets must be different. For example if we say relation on set A that means we are relating elements of set A with the elements of set A only. ___________________ Slide 4 ___________________ Solved Example-: If A = {a, b, c, d}, B = {p, q, r, s}, then which of the following are relation from A to B: Give Reasons? (a) R1 = {(a, p), (b, r) (c, s)} (b) R2 = {(q, b), (c, s), (d, r)} (c) R3 = {(a, p), (a, q), (d, p), (c, r), (b, r)} Solution-: (a) Clearly: R1 A B. So R1 is a relation from A to B. (b) Since (q, b) R2 but (q, b) A B so R A B Thus R2 is not a relation from A to B. (c) Clearly R3 A B So R3 is a relation from A to B.
SAVANT EDUCATION GROUP E-17, East of Kailash, New Delhi 110065. Ph.: +91-11-26224417 www.savantgroup.org
6
Slide 5 Illustration-:
Mathematics
If A = {1, 2, 3} and B = {a, b, c} then whether R = {(1, b), (2, c) (1, a) (3, a)} is a relation or not? ___________________ Slide 6 ___________________ Various Types of relation
Either (T1, T2) R T1 is congruent to T2 T2 is congruent to T1 (T2,T1) R Hence R is symmetric Moreover (T1, T2), (T2, T3,) R which implies that T1 is congruent to T2 and T2 is congruent to T3 which implies. T1 is congruent to T3 (T1, T3) R Therefore R is transitive Since R is reflexive, symmetric and transitive thus R is a equivalence relation. __________________ Slide 10 ___________________ Illustration-: Show that the relation R in the set {1, 2, 3} given by R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3)} Is reflexive but neither symmetric nor transitive? __________________ Slide 11 ___________________
___________________ Slide 7 ___________________ Empty relation-: A relation R in a set A is called empty relation if no element of A is related two any element of A i.e. R = A A. Universal relation-: A relation R in a set A is called a universal relation if each element of A is related to every element of A i.e. R = A A. Both empty and universal relation are sometimes called trivial relations. ___________________ Slide 8 ___________________ Reflexive relation: A relation R in a set A is called reflexive if (a, a) R for every a A. Symmetric Relation: A relation R in a set A is called symmetric if (a1, a2) R implies that (a2, a1) R, for all a1, a2 A. Transitive relation: A relation R in a set A is called transitive if (a1, a2) R and (a2, a3) R implies that (a1, a3) R for all a1, a2, a3 A. A relation R is in a set A is said to be an equivalence relation if R is reflexive, symmetric and transitive. ___________________ Slide 9 ___________________ Solved Example-: Let T be the set of all triangles in a plane with R a relation in T given by R = {(T1, T2): T1 is congruent to T2} Show that R is an equivalence relation? Solution-: R is reflexive since every triangle is congruent to itself.
Illustration-: Show that the relation R in the set Z on integers given by R {(a, b): 2 divides a b} is an equivalence relation? __________________ Slide 12 ___________________ Function Let X and Y be two nonempty sets of real numbers. A function from X into Y is a rule or a correspondence that associates with each element of X a unique element of Y. The set X is called the domain of the function. For each element x in X, the corresponding element y in Y is called the image of x. The set of all images of the elements of the domain is called the range of the function.
Mathematics
Slide 13

Slide 16
Activity-: For the function f below, evaluate f at the indicated values and find the domain and range of f
We observe that f1 is not a function from set A to set B, since here is an element 3 A which is not associated to any elements of B. Also f2 is not a function from A to B because an element 4 A is associated to two elements d and e. f3 is a function since each element of A is associated to a unique element in B. f4 is a function since each element in set A is associated to a unique element in set B. __________________ Slide 17 ___________________
__________________ Slide 14 ___________________ Mathematical definition of function Let A and B be two non-empty sets. Then a function f from set A to set B is a rule or method which associates elements of set A to elements of set B such that. (i) All elements of set A are associated to element in set B. (ii) An element of set A is associated to a unique element in set B. In other words, a function f from a set A to set B associates each element of set A to a unique element of set B. If f is a function from a set A to a set B then we write f : A B which is read as f is a function from A to B. __________________ Slide 15 ___________________ For Example Let A {1, 2, 3, 4} and B = {a, b, c, d, e} be two sets and let f1, f2, f3, and f4 be rules associating elements (A to elements of) B as shown is the following figures:
Domain, co-domain and range of a function Let f: A B be a function defined for two sets A and B Then, the set A is known as the domain of function f. The set B is known as the co-domain of f. The set of all f-images of elements of A is known as the range of f. __________________ Slide 18 ___________________ Solved Example-: Let A = {2, 1, 0, 1, 2} and B = {0, 1, 2, 3, 4, 5, 6} be two sets and we define a function f: A B such that f(x) = x2. Determine the domain, co-domain and range of function f(x) = x2. Solution: Now the domain of function f will be domain (f) = A = {2, 1, 0, 1, 2} Co-domain of function f will be co-domain (f) = B = {0, 1, 2, 3, 4, 5, 6} Now f (2) = (2)2 = 4 f(1) = (1)2 = 1 f(0) = (0)2 = 0 f(1) = 12 = 1 f(2) = 22 = 4 thus the range of f is range (f) = {0, 1, 4} __________________ Slide 19 ___________________ Types of functions-: 1. Injective or one to one function: A function f: A B is called injective if the images of distinct elements of A under f are distinct i.e. for every a1, a2 A, f(a1) = f(a2) implies that a1 = a2 Otherwise: f is called many-one 2. Surjective (onto) function: A function f: A B is surjective if every element of B is the image of some element of A under f i.e. for every b B there exists a element a A such that f(a) = b. 3. Bi-jective functions: A function f: A B is called bi-jective if it is both oneone and onto.
8
Slide 20

Slide 24
Mathematics
Out of the given four function determine which is injective
Composition of function and Invertible functions Let f: 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 C given by gof = g (f (x)) x A
__________________ Slide 25 ___________________ Solved Example-: Let f: [2, 3, 4, 5] [3, 4, 5, 9] and y: [3, 4, 5, 9] [7, 11, 15] be functions defined as f(2) = 3, f(3) = 4, f(4) = f(5) = 5 and g(3) = g(4) = 7 and g(5) = g(9) = 11 find gof ? Solution-: We have gof(2) = g(f(2)) = g(3) = 7 gof(4) = g (f(4)) = g(5) = 11 gof (5) = g (5) = 11 __________________ Slide 26 ___________________ Illustration-: Show that if f:
7 3 R R is defined by 5 5 3 3x + 4 7 and g : R R is defined by f (x) = 5x 7 5 5 7x + 4 then fog = IA and gof = IB. g( x) = 5x 3 3 7 Where A = R ; B = R 5 5 IA (x) = x, x A, IB (x) = x, x B are called identity functions on set A and B respectively.
f1 is one-one or injection function f2 is many-one (into) function f3 is also many one function f4 is onto and one-one i.e. bi-jective function. __________________ Slide 21 ___________________ Solved Example-: Let A be set of all 50 students of class X in a school. Let A N be function defined by f(x) = roll number of the student x. Show that f is one-one but not onto? Solution-: Not two different students of the class can have same roll number. Therefore f must be one-one. We can assume without any loss of generality that roll numbers of students are from 1 to 50. This implies that 51 in N is not roll number of any student of class, so that 51 cannot be image of any element of X under af. Hence f is not onto __________________ Slide 22 ___________________ Illustration-: Show that the function f: N N given by f(1) = f(2) = 1 and f(x) = x 1, for every x > 2, is onto but not one-one __________________ Slide 23 ___________________ Illustration-: Show that f: N N given by , if x is odd x + 1 f ( x) = , if x is even x 1 is both one-one and onto.
__________________ Slide 27 ___________________ Solved Example-: Show that if f: A B and g : B C are one-one, then gof : A C is also one-one. Solution-: Suppose gof(x1) = gof(x2) g(f(x1) = g (f(x2)) f(x1) = f(x2) as g is one-one x1 = x2, as f is one-one Hence, gof is one-one.
Mathematics
Show that if f: A B and g : B C are onto, then gof : A C is also onto. __________________ Slide 29 ___________________ Invertible function A function f: X Y is defined to be invertible, if there exists a function g : Y X such that gof = Ix and fog = Iy. The function g is called the inverse of f and denoted by f1. Thus if f is invertible then f must be one-one and onto conversely, if f is one-one and onto then f must be invertible. __________________ Slide 30 ___________________ Solved Example-: Let f : N Y be a function defined as f(x) = 4x + 3 where Y = {y N : y = 4x + 3 for some x N} show that f is invertible. Find the inverse? Solution-: Consider an arbitrary element y of Y. By the definition of Y. y = 4x + 3, for some x in the domain N this shows that ( y 3) x= 4 ( y 3) Define g : Y N by g ( y ) = 4 ( 4x + 3 3 ) = x Now gof (x) = g (f(x)) = g(4x + 3) = 4 y 3 4 ( y 3) And fog (y) = f ( g ( y ) ) = f +3= y = 4 4 This shows that gof = IN and fog = Iy which implies that f is invertible and g is the inverse of f.
A binary operation* on a set A is a function * : A A A where we denote * (a, b) by a * b. a a + b, a b, a b and for b 0 are all for basic binary b operations. __________________ Slide 33 ___________________ A binary operation * on the set X is called commutative if a b = b a for every a, b X. A binary operation *: A A A is said to be associative if (a * b) * c = a * (b * c), a, b, c, A. Consider a binary operation *: A A A an element e A, if it exists is called identity for the operation * if. a e = a = e * a, a A. Given a binary operation * : A A A with identity element e in A, an element a A is said to be invertible with respect be the operation *, if there exists are element b in A such that a * b = e = b * a and b is called the inverse of a and is denoted by a1. __________________ Slide 34 ___________________
Solved Example-:
Show that *: R R R defined by a * b = a + 2b is not commutative? Solution-: We are given a * b = a + 2b For a = 3 and b = 4 we have 3*4=3+42 = 3 + 8 = 11 And 4 * 3 = 4 + 2 3 = 4 + 6 = 10 Now since 3 * 4 4 * 3 thus the operation * is notcommutative. __________________ Slide 35 ___________________
Solved Example-:
__________________ Slide 31 ___________________

Illustration-:
Let y = {n2: n N} N. consider f : N Y as f(n) = n2. Show that f is invertible. Find the inverse of f? __________________ Slide 32 ___________________
Binary operations
Show that addition and multiplication are associative binary operations on R. But subtraction and division are not associative on R? Solution-: Addition and multiplication are associative since (a + b) + c = a + (b + c) and (a b) c = a (b c) a, b, c R. However subtraction and division are not associative as (8 5) 3 8 (5 3) And (8 5) 3 8 (5 3) Thus finally we conclude that addition and multiplication are commutative binary operations while subtraction and division are not.
Binary means two and we are familiar with basic four operations. Addition, subtraction, multiplication and division. Binary operation in general is nothing but association of any pair of elements a, b from a set X two another element of X.
10
Mathematics
CURRICULUM BASED WORKSHEET

Topics for Worksheet I
Relations Reflective Relation Symmetric Relation Transitive Relation Equivalence Relation
Show that * : R R R given by a * b a + 2b is not associative? __________________ Slide 37 ___________________

Illustration-:
Show that a is the inverse of a for the addition operation 1 is the inverse of a 0 for the multiplicative + on R and a operation on R? __________________ Slide 38 ___________________
Solved Example-:
Worksheet I
Determine which of the following binary operation on the set N are associative and which are commutative a * b = 1 a, b N
2 Solution-: a*b =
( a + b ) a, b N
(a) clearly by definition a * b = b * a = 1, a, b. N Also (a * b) * c = (1 * c) = 1 and a * (b * c) = a * 1 = 1, a, b, c, N Hence R is both associative and commutative. a+b (b) now a * b = 2 b+a or = or = b * a 2 Shows that * is commutative a+b Further (a * b) * c = *c 2 a+b *c a + b + 2c 2 or = or = 2 4 b+c But a * (b * c) = a * 2 b+c a+ 2 or = 2a + b + c or = 2 4 Since (a * b) * c a * (b * c). Hence * is not associative.
1. Three relations R1, R2, and R3 are defined on set A = {a, b, c} as follows: (i) R1 = {(a, a), (a, b), (a, c), (b, b), (b, c), (c, a), (c, b), (c, c)}, (ii) R2 = {(a, b), (b, a), (a, c), (c, a)} (iii) R3 = {(a, b), (b, c), (c, a)}. Find whether each of R1, R2 and R3 is reflexive, symmetric and transitive. 2. Determine whether each of the following relations are reflexive, symmetric and transitive. (i) Relation R in set A = {1, 2, 3,.., 13, 14} defined as (ii) Relation R in set A = {1, 2, 3, 4, 5, 6} as (iii) Relation R in set A = {all the lines in a plane} as R = {(L1, L2): L1 L2} (iv) Relation R in set X of all integers defined as R = {(x, y): x y is an integer} 3. Prove that the relation R on the set Z of all integers defined by (x, y) R x y is divisible by n Is an equivalence relation on Z. 4. Prove that the relation R on the set N N defined by (a, b) R (c, d) a + d = b + c for all (a, b), (c, d) N N is an equivalence relation. 5. Let A be the set of all lines in xy-plane and let R be a relation in A, defined by R = {(L1, L2) : L1 || L2}. Show that R is an equivalence relation in A. Find the set of all lines related to the line y = 3x + 5. 6. Let A be the set of all lines in a plane and let R be a relation in A defined by R = {(L1, L2) : L1 L2}. Show that R is symmetric but neither reflexive not transitive. 7. Let N be the set of all natural numbers and let R be a relation in N, defined by R = {(a, b) : a is a multiple of b}. Show that R is reflexive and transitive but not symmetric.
Mathematics

Topics for Worksheet III
Binary Operations Commutative binary operations Associative binary operation Identity element of binary operation Inverse of a binary operation
11
8. Let N be the set of all natural numbers and let R be a relation on N N, defined by (a, b) R (c, d) ad = bc. Show that R is an equivalence relation.
Topics for Worksheet II

Functions Types of function Compression of functions Invertible functions
Worksheet III
Worksheet II
1. Define (i) One-one function (ii) Onto function (iii) One-one and onto function 2. 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. Show that f is one-one. 3. Let f: N N be defined by
x +1 , if x is odd f (x) = 2 x , if x is even, for all x N 2
Show that f(x) is not a bijective function. 4. Let A = R {3} and B = R {1} x2 Let F: A B be defined as f ( x ) = . x3 Show that f(x) is one-one and onto. 5. Let f: {1, 3, 4} (1, 2, 5} and g: {1, 2, 3} {1, 3} be given by f = {(1, 2), (3, 5), (4, 1)} and f = {(1, 3), (2, 3), (5, 1)}. Write down gof. 6. If f(x) = 8x3 and g ( x ) = x 3 , find gof and fog. 7. Let f: N N, g: N N and h : N N be defined as f(x) = 2x, g(x) = 3x + 4 and h(x) = Sin x. Show that ho(gof) = (hog) of. 8. If f : Q Q is given by f(x) = x2, then find (i) f1(9) (ii) f1(5) (iii) f1(0)
1
1. Let * be the binary operation on N given by a * b = LCM of a and b. Find (i) 5 * 7 (ii) 20 * 16 2. Consider the binary operation on the set {1, 2, 3, 4, 5} defined by a ^ b = min {a, b}. Write the operation table of ^. 3. Find the identity element in Z for * on Z, defined by A * b = a + b + 1 4. Show that the operation * on Q {1}, defined by a * b = a + b ab is. (i) Commutative (ii) Associative 5. Let f : N Y : f(x) = 4x2 + 12x + 15 and Y = range (f). Show that f is invertible and find f1. 6. Show that the function operation on Z, defined by a b = a + b + 1 for all a, b Z satisfies(i) the closure property, (ii) the associative law and (iii) the cumulative law. (i) Find the identity element in Z. (ii) What is the inverse of an element a Z? 7. Show that the operation o Q {1}, defined by a b = a + b ab for all a, b Q {1} satisfies (i) the closure property, (ii) the associative law, (iii) the commutative law. (iv) What is the identity element? (v) For each a Q {1}, find the inverse of a. 8. On the set N of all natural numbers, defined the operation on N by m n = gcd (m, n) for all m, n N. Show that is commutative as well as associative.
12
Mathematics
CURRICULUM BASED CHAPTER ASSIGNMENT

1 Mark Questions
1. Show that 2. 3. 4. 5. 6. 7.
8.
9. 10.
1 is the inverse of x 0 for the x multiplication operation on R. If f = {(3, 1), (2, 3), (1, 2) find f1 if f is one-one and onto. A relation R in a set A is called .., if no element of A related to any element of A. A relation R in a Set A is called ..........., if each element of A is related to every element of A. A relation R in a set A is called .........., if (a, a) R, for every a A. A relation R in a set A is called ............ if (a1, a2) R (a2, a1) R for all (a1, a2) A. R is a relation in a set {1, 2, 4} given by R = {(1, 1), (2, 2), (4, 4)}. State whether R is reflexive or symmetric. If a function f : X Y is defined to be one-one (or injective), if for all a1, a2 X, if f(a1) = f(a2), then it implies ....... otherwise f is ....... If f is one-one and onto, so f1 is .......... to f. Let * be a binary operation on set Q of rational numbers as follows a*b = (a b)2 . Then is this operation commutative?
16. Consider the binary operation on the set {1, 2, 3, 4, 5} defined by a b = min {a, b}. Write the operation table of the operation . 17. Let the * binary operation on N be defined by a * b = H.C.F of a and b. Is * commutative? Is * associative? Does there exist identity for this operation on N? 18. Let f : N R be a function defined as f(x) = 4x2 + 12x + 15. Show that f : N S where, S is the range of f (x). Find the inverse of f. 19. Let A = {1, 0, 1, 2} B = (4, 2, 0, 2} and f, g : A B be function defined by f(x) = x2 x, x A and 1 g( x) = 2 x 1 x A. Then, are f and g equal? 2 Justify your answer.
3 Marks Questions
2 Marks Questions
20. Let f, g and h be functions from R R. Then show that (i) (f + g) oh = foh + goh (ii) (f.g) oh = (foh).(goh) 21. If f : [1, 2, 3] [a, b, c] and g : [a, b, c] [apple, ball cat]. Show that f, g and g of are invertible. Find out f1, g1 and (gof)1 and show that (gof)1 = f1 og1. 22. Define a binary operation * on the set {0, 1, 2, 3, if a + b < 6 a + b 4, 5} as a + b 6 if a + b 6 Show that 0 is the identity for this operation and each element of the set is invertible with 6 a being the inverse of a. 23. Let * be the binary operation on the set Q of rational numbers which are as follows: (i) a * b = a b (ii) a * b = a2 + b2 (iii) a * b = a + ab Find which of the binary operation are commutative and which are associative. ( 4x + 3 ) , Show that fof (x) = x for all 24. If f ( x ) = ( 6x 4 )
x 2 . What is the inverse of f(x)? 3
11. If A = R (3) and B = R (1), consider the function x2 f : A B defined by f ( x ) = . Is f one-one and x3 onto? Justify your answer. 12. Show that the function f : R R given by 1 if x > 0 f ( x ) = 0 if x = 0 is neither one-one nor onto. 1 if x < 0 13. Check the injectivity and surjectivity of the following: (i) f : N N given by f(x) = x2 (ii) f : R R given by f(x) = x2 14. Show that the Relation R in the set A = {x z : 0 x 12} is an equivalence relation. R = {(a, b): |a b| is a multiple of 4} 15. Determine whether the following relations are reflexive, symmetrical, and transitive if relation R, in the set N of Natural numbers is defined as R = {(x, y) : y = x + 5 and x < 4}.
Mathematics
13
QUESTION BANK FOR COMPETITIONS

1. Let R be the relation on the set R of all real numbers defined by aRb iff |a b| 1. Then R is (a) reflexive symmetric and not transitive. (b) symmetric only. (c) transitive only. (d) anti-symmetric only. 2. Let A be the non-empty set of children in a family. The relation x is a brother of y on A is (a) reflexive. (b) symmetric. (c) transitive. (d) none of the there. 3. Let R be a relation on the set N be defined by {(x, y) x, y, N, 2x + y = 41}. Then R is (a) reflexive. (b) symmetric. (c) transitive. (d) none of these 4. An integer m is said to be related to another integer n if m is a multiple of n. then the relation is (a) reflexive and symmetric. (b) reflexive and transitive. (c) symmetric and transitive. (d) equivalence relation. 1 x 5. If 2f ( x 1) f = x, then f(x) is x 1 1 (a) 2 (1 + x ) + 3 (1 + x ) 1 x ) ( (b) 2 ( x 1) x 1 (c) x 2 + 2 + 4 x 1 1 (d) ( x + 2 ) + 4 x + 2 ( ) 6. Let R be a relation < from A = {1, 2, 3, 4} to B = {1, 3, 5}, i.e., (a, b) R a < b then RoR1 is (a) {(1, 3), (1, 5), (2, 3), (2, 5), (3, 5), (4, 5)} (b) {(3, 1), (5, 1), (3, 2), (5, 2), (5, 3), (5, 4)} (c) {(3, 3), (3, 5), (5, 3), (5, 5)} (d) {(3, 3), (3, 4), (4, 5)} 7. Given the relation R = {(1, 2), (2, 3)} on the set A = {1, 2, 3}. The minimum numbers of ordered points which when added to R make it on equivalence relation is (a) 8 (b) 7 (c) 6 (d) 4. 8. Let L denote the set of all straight lines in a plane. Let a relation R be defined by R , , L. Then R is (a) reflexive (b) symmetric (c) transitive (d) none of there.
9. Let R be an equivalence relation on a finite set A having n elements. Then the number of ordered points in R is, (a) less than n (b) greater than or equal to n. (c) less than or equal to n (d) none of there. 10. The inverse of the function
y = loga x + (a)
(x
)
+ 1 , ( a > 0, a 1) is
))
1 x a a x 2 (b) not defined for all x (c) defined for only positive x (d) none of the above
3 x + 1, x < 0 ( x 1) , x < 1 f (x) = 2 , g( x) = 1/ 2 x + 1, x 0 ( x 1) , x 1 1/3
11. If
compute (gof) (x) (a) x (b) 2x (c) x (d) none of these. x 12. Let f ( x ) = , x 1. Then, for what value of x +1 is f[{f(x)}] = x? (b) 2 (a) 2 (c) 1 (d) 1 1 + x, 0 x 2 13. f ( x ) = find fof ( x ) 3 x, 2 < x 3
2 + x, 0 x 1 (a) 2 x, 1 < x 2 4 x, 2 < x 3
2 x, 0 x 1 (c) 3 x, 1 < x 2 4 + x, 2 < x 3
3 + x, 0 x 1 (b) 2 + x, 1 < x 2 4 x, 2 < x 3
(d) none of these.
14. f(x) = |sin x| has an inverse if its domain is (a) [0, ] (b) [0, / 2]
(c) , 4 4
(d) none of there. 10 x 10 x is 10 x + 10 x 1 1+ x log10 (b) 2 1 x 1 2x log10 . (d) 4 2 x
15. The inverse of the function y =
(a) log10 (2 x) (b)

1 log10 ( 2x 1) 2
14

16. Find the domain of the function f ( x ) =
1
Mathematics
1 x 2 x
(x) x
is
23. Find the domain of f ( x ) =
(a) (0, ) (c) (, )

17. If f(x) = cos
1
(b) (, 0) (d) none of there. (x x) +

2
(a) x [ 1, 1] ( , 2 ) ( 2, ) (b) x [ 1, 1] ( , 2 ) ( 2, ) (c) x [ 1, 1] ( , 2 ) ( 2, ) (d) none of these.

24. If x R and P =
1 1 1 + 2 , x 1 x
domain of f(x) is (where [.] is the greatest integer) 1+ 5 1 5 2, (b) (a) 2, 2 2

1+ 5 (c) 2, 2
x2 , then P is lies in the x 2x 2 + 4

4
(d) none of these
18. The domain of the function. f ( x ) = log2 log2 log2 ........log2 x is
n times
interval 1 (a) 0, 2 1 (c) 0, 3
3 4 (b) , 4 5 1 (d) 0, 4
25. Find the domain of f ( x ) =
1 x x
(a) (2n1, ), (b) (2n2, )
(b) [2n, ]
(d) none of these. ax a x 19. The inverse of the function f ( x ) = x is a + a x 1 1 x 1 1+ x (a) (b) loga , loga , 2 1+ x 2 1 x 1+ x (c) loga (d) none of these. 1 x 2 2 ex e x 20. Let f: R R defined by f(x) = x2 2 , then e + e x (a) f(x) is one-one but not onto (b) f(x) is neither one-one nor onto (c) f(x) is many one but onto (d) f(x) is one-one and onto
21. The range of the function y =
x is 1 + x2
2
(b) empty set (d) none of these x 26. Find the domain of sin1 log3 . 3 (b) 1 x 9 (a) 1 > x 7 (c) 2 x 8 (d) none of these.
27. The period of ecos x+ x[x]+cos x is ([.] denotes the greatest integer function) (a) 2 (b) 1 (c) 0 (d) 1 28. If the function f : R R be such that f(x) = x [x], where [.] denotes the greatest integer function, then f1 (x) is 1 (b) [x] x (a) x [ x]
4 2
(a) null set (c) single ton set
(a) [0, 1) (c) (0, 1)
(b) [0, 1]
(c) not defined (d) none of these 29. The period of the function f(x) = a sin kx + b cos kx is 2 2 (a) (b) k k (c)
(d) none of these. x 2 3x + 2 22. The range of the function f ( x ) = 2 lies x +x6 in the interval 1 (a) ( , ) \ , 5 (b) ( , ) \ {1}
1
(d) none of these as its
30. Let f ( x ) =
(b)
( , )
sin 2nx , n N has 6 1 + cos2 nx fundamental period, then n is equal to (a) 2 (b) 4 (c) 6 (d) 8
(d) none of these.

Relations and Functions

Caricato da

Informazioni sul documento

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Relations and Functions

Caricato da

Copyright:

Formati disponibili

CLASS XII

By:DR. VIKRAM SINGH TANUSHREE SINGH