Rd Sharma XII Vol 1 2020 Solutions for Class 12 Science Maths Chapter 2 Functions are provided here with simple step-by-step explanations. These solutions for Functions are extremely popular among Class 12 Science students for Maths Functions Solutions come handy for quickly completing your homework and preparing for exams. All questions and answers from the Rd Sharma XII Vol 1 2020 Book of Class 12 Science Maths Chapter 2 are provided here for you for free. You will also love the ad-free experience on Meritnation’s Rd Sharma XII Vol 1 2020 Solutions. All Rd Sharma XII Vol 1 2020 Solutions for class Class 12 Science Maths are prepared by experts and are 100% accurate.
Page No 2.31:
Question 1:
Give an example of a function
(i) which is one-one but not onto
(ii) which is not one-one but onto
(iii) which is neither one-one nor onto
Answer:
(i) which is one-one but not onto.
f: Z → Z given by f(x)=3x+2
Injectivity:
Let x and y be any two elements in the domain (Z), such that f(x) = f(y).
f(x)=f(y)
3x + 2 =3y + 2
3x = 3y
x = y
f(x) = f(y) x = y
So, f is one-one.
Surjectivity:
Let y be any element in the co-domain (Z), such that f(x) = y for some element x in Z (domain).
f(x) = y
3x + 2 = y
3x = y - 2
So, for every element in the co domain there need not be any element in the domain such that f(x) = y.
Thus, f is not onto.
(ii) which is not one-one but onto.
f: Z → N {0} given by f(x) = |x|
Injectivity:
Let x and y be any two elements in the domain (Z), such that f(x) = f(y).
|x| = |y|
x= y
So, different elements of domain f may give the same image.
So, f is not one-one.
Surjectivity:
Let y be any element in the co domain (Z), such that f(x) = y for some element x in Z (domain).
f(x) = y
|x| = y
x = y, which is an element in Z (domain).
So, for every element in the co-domain, there exists a pre-image in the domain.
Thus, f is onto.
(iii) which is neither one-one nor onto.
f: Z → Z given by f(x) = 2x2 + 1
Injectivity:
Let x and y be any two elements in the domain (Z), such that f(x) = f(y).
So, different elements of domain f may give the same image.
Thus, f is not one-one.
Surjectivity:
Let y be any element in the co-domain (Z), such that f(x) = y for some element x in Z (domain).
f(x) = y
Thus, f is not onto.
Page No 2.31:
Question 2:
Which of the following functions from A to B are one-one and onto?
(i) f1 = {(1, 3), (2, 5), (3, 7)} ; A = {1, 2, 3}, B = {3, 5, 7}
(ii) f2 = {(2, a), (3, b), (4, c)} ; A = {2, 3, 4}, B = {a, b, c}
(iii) f3 = {(a, x), (b, x), (c, z), (d, z)} ; A = {a, b, c, d,}, B = {x, y, z}
Answer:
(i) f1 = {(1, 3), (2, 5), (3, 7)} ; A = {1, 2, 3}, B = {3, 5, 7}
Injectivity:
f1 (1) = 3
f1 (2) = 5
f1 (3) = 7
Every element of A has different images in B.
So, f1 is one-one.
Surjectivity:
Co-domain of f1 = {3, 5, 7}
Range of f1 =set of images = {3, 5, 7}
Co-domain = range
So, f1 is onto.
(ii) f2 = {(2, a), (3, b), (4, c)} ; A = {2, 3, 4}, B = {a, b, c}
Injectivity:
f2 (2) = a
f2 (3) = b
f2 (4) = c
Every element of A has different images in B.
So, f2 is one-one.
Surjectivity:
Co-domain of f2 = {a, b, c}
Range of f2 = set of images = {a, b, c}
Co-domain = range
So, f2 is onto.
(iii) f3 = {(a, x), (b, x), (c, z), (d, z)} ; A = {a, b, c, d,}, B = {x, y, z}
Injectivity:
f3 (a) = x
f3 (b) = x
f3 (c) = z
f3 (d) = z
a and b have the same image x. (Also c and d have the same image z)
So, f3 is not one-one.
Surjectivity:
Co-domain of f1 ={x, y, z}
Range of f1 =set of images = {x, z}
So, the co-domain is not same as the range.
So, f3 is not onto.
Page No 2.31:
Question 3:
Prove that the function f : N → N, defined by f(x) = x2 + x + 1, is one-one but not onto.
Answer:
f : N → N, defined by f(x) = x2 + x + 1
Injectivity:
Let x and y be any two elements in the domain (N), such that f(x) = f(y).
So, f is one-one.
Surjectivity:
Page No 2.31:
Question 4:
Let A = {−1, 0, 1} and f = {(x, x2) : x ∈ A}. Show that f : A → A is neither one-one nor onto.
Answer:
A = {−1, 0, 1} and f = {(x, x2) : x ∈ A}
Given, f(x) = x2
Injectivity:
f(1) = 12=1 and
f(-1)=(-1)2=1
1 and -1 have the same images.
So, f is not one-one.
Surjectivity:
Co-domain of f = {-1, 0, 1}
f(1) = 12 = 1,
f(-1) = (-1)2 = 1 and
f(0) = 0
Range of f = {0, 1}
So, both are not same.
Hence, f is not onto.
Page No 2.31:
Question 5:
Classify the following functions as injection, surjection or bijection :
(i) f : N → N given by f(x) = x2
(ii) f : Z → Z given by f(x) = x2
(iii) f : N → N given by f(x) = x3
(iv) f : Z → Z given by f(x) = x3
(v) f : R → R, defined by f(x) = |x|
(vi) f : Z → Z, defined by f(x) = x2 + x
(vii) f : Z → Z, defined by f(x) = x − 5
(viii) f : R → R, defined by f(x) = sinx
(ix) f : R → R, defined by f(x) = x3 + 1
(x) f : R → R, defined by f(x) = x3 − x
(xi) f : R → R, defined by f(x) = sin2x + cos2x
(xii) f : Q − {3} → Q, defined by
(xiii) f : Q → Q, defined by f(x) = x3 + 1
(xiv) f : R → R, defined by f(x) = 5x3 + 4
(xv) f : R → R, defined by f(x) = 3 − 4x
(xvi) f : R → R, defined by f(x) = 1 + x2
(xvii) f : R → R, defined by f(x) = [NCERT EXEMPLAR]
Answer:
(i) f : N → N, given by f(x) = x2
Injection test:
Let x and y be any two elements in the domain (N), such that f(x) = f(y).
f(x)=f(y)
So, f is an injection .
Surjection test:
Let y be any element in the co-domain (N), such that f(x) = y for some element x in N (domain).
f(x) = y
So, f is not a surjection.
So, f is not a bijection.
(ii) f : Z → Z, given by f(x) = x2
Injection test:
Let x and y be any two elements in the domain (Z), such that f(x) = f(y).
f(x) = f(y)
So, f is not an injection .
Surjection test:
Let y be any element in the co-domain (Z), such that f(x) = y for some element x in Z (domain).
f(x) = y
So, f is not a surjection.
So, f is not a bijection.
(iii) f : N → N, given by f(x) = x3
Injection test:
Let x and y be any two elements in the domain (N), such that f(x) = f(y).
f(x) = f(y)
So, f is an injection .
Surjection test:
Let y be any element in the co-domain (N), such that f(x) = y for some element x in N (domain).
f(x) = y
So, f is not a surjection and f is not a bijection.
(iv) f : Z → Z, given by f(x) = x3
Injection test:
Let x and y be any two elements in the domain (Z), such that f(x) = f(y)
f(x) = f(y)
So, f is an injection.
Surjection test:
Let y be any element in the co-domain (Z), such that f(x) = y for some element x in Z (domain).
f(x) = y
So, f is not a surjection and f is not a bijection.
(v) f : R → R, defined by f(x) = |x|
Injection test:
Let x and y be any two elements in the domain (R), such that f(x) = f(y)
f(x) = f(y)
So, f is not an injection .
Surjection test:
Let y be any element in the co-domain (R), such that f(x) = y for some element x in R (domain).
f(x) = y
So, f is a surjection and f is not a bijection.
(vi) f : Z → Z, defined by f(x) = x2 + x
Injection test:
Let x and y be any two elements in the domain (Z), such that f(x) = f(y).
f(x) = f(y)
So, f is not an injection .
Surjection test:
Let y be any element in the co-domain (Z), such that f(x) = y for some element x in Z (domain).
f(x) = y
So, f is not a surjection and f is not a bijection.
(vii) f : Z → Z, defined by f(x) = x − 5
Injection test:
Let x and y be any two elements in the domain (Z), such that f(x) = f(y).
f(x) = f(y)
x 5 = y 5
x = y
So, f is an injection .
Surjection test:
Let y be any element in the co-domain (Z), such that f(x) = y for some element x in Z (domain).
f(x) = y
x 5 = y
x = y + 5, which is in Z.
So, f is a surjection and f is a bijection.
(viii) f : R → R, defined by f(x) = sinx
Injection test:
Let x and y be any two elements in the domain (R), such that f(x) = f(y).
f(x) = f(y)
So, f is not an injection .
Surjection test:
Range of f = [1, 1]
Co-domain of f = R
Both are not same.
So, f is not a surjection and f is not a bijection.
(ix) f : R → R, defined by f(x) = x3 + 1
Injection test:
Let x and y be any two elements in the domain (R), such that f(x) = f(y).
f(x) = f(y)
So, f is an injection.
Surjection test:
Let y be any element in the co-domain (R), such that f(x) = y for some element x in R (domain).
f(x) = y
So, f is a surjection.
So, f is a bijection.
(x) f : R → R, defined by f(x) = x3 − x
Injection test:
Let x and y be any two elements in the domain (R), such that f(x) = f(y).
f(x) = f(y)
So, f is not an injection.
Surjection test:
Let y be any element in the co-domain (R), such that f(x) = y for some element x in R (domain).
f(x) = y
So, f is a surjection and f is not a bijection.
(xi) f : R → R, defined by f(x) = sin2x + cos2x
f(x) = sin2x + cos2x = 1
So, f(x) = 1 for every x in R.
So, for all elements in the domain, the image is 1.
So, f is not an injection.
Range of f = {1}
Co-domain of f = R
Both are not same.
So, f is not a surjection and f is not a bijection.
(xii) f : Q − {3} → Q, defined by
Injection test:
Let x and y be any two elements in the domain (Q − {3}), such that f(x) = f(y).
f(x) = f(y)
So, f is an injection.
Surjection test:
Let y be any element in the co-domain (Q − {3}), such that f(x) = y for some element x in Q (domain).
f(x) = y
So, f is not a surjection and f is not a bijection.
(xiii) f : Q → Q, defined by f(x) = x3 + 1
Injection test:
Let x and y be any two elements in the domain (Q), such that f(x) = f(y).
f(x) = f(y)
So, f is an injection .
Surjection test:
Let y be any element in the co-domain (Q), such that f(x) = y for some element x in Q (domain).
f(x) = y
So, f is not a surjection and f is not a bijection.
So, f is a surjection and f is a bijection.
(xiv) f : R → R, defined by f(x) = 5x3 + 4
Injection test:
Let x and y be any two elements in the domain (R), such that f(x) = f(y).
f(x) = f(y)
So, f is an injection .
Surjection test:
Let y be any element in the co-domain (R), such that f(x) = y for some element x in R (domain).
f(x) = y
So, f is a surjection and f is a bijection.
(xv) f : R → R, defined by f(x) = 3 − 4x
Injection test:
Let x and y be any two elements in the domain (R), such that f(x) = f(y).
f(x) = f(y)
So, f is an injection .
Surjection test:
Let y be any element in the co-domain (R), such that f(x) = y for some element x in R (domain).
f(x) = y
So, f is a surjection and f is a bijection.
(xvi) f : R → R, defined by f(x) = 1 + x2
Injection test:
Let x and y be any two elements in the domain (R), such that f(x) = f(y).
f(x) = f(y)
So, f is not an injection.
Surjection test:
Let y be any element in the co-domain (R), such that f(x) = y for some element x in R (domain).
f(x) = y
So, f is not a surjection and f is not a bijection.
(xvii) f : R → R, defined by f(x) =
Injection test:
Let x and y be any two elements in the domain (R), such that f(x) = f(y).
f(x) = f(y)
So, f is not an injection.
Surjection test:
Let y be any element in the co-domain (R), such that f(x) = y for some element x in R (domain).
f(x) = y
So, f is not a surjection and f is not a bijection.
Page No 2.31:
Question 6:
If f : A → B is an injection, such that range of f = {a}, determine the number of elements in A.
Answer:
Range of f = {a}
So, the number of images of f = 1
Since, f is an injection, there will be exactly one image for each element of f .
So, number of elements in A = 1.
Page No 2.31:
Question 7:
Show that the function f : R − {3} → R − {2} given by is a bijection.
Answer:
f : R − {3} → R − {2} given by
Injectivity:
Let x and y be any two elements in the domain (R − {3}), such that f(x) = f(y).
f(x) = f(y)
So, f is one-one.
Surjectivity:
Let y be any element in the co-domain (R − {2}), such that f(x) = y for some element x in R − {3} (domain).
f(x) = y
So, for every element in the co-domain, there exists some pre-image in the domain.
f is onto.
Since, f is both one-one and onto, it is a bijection.
Page No 2.32:
Question 8:
Let A = [1, 1]. Then, discuss whether the following functions from A to itself are one-one, onto or bijective:
(i) f(x) = (ii) g(x) = |x| (iii) h(x) = x2 [NCERT EXEMPLAR]
Answer:
(i) f : A A, given by f(x) =
Injection test:
Let x and y be any two elements in the domain (A), such that f(x) = f(y).
f(x) = f(y)
=
x = y
So, f is one-one.
Surjection test:
Let y be any element in the co-domain (A), such that f(x) = y for some element x in A (domain)
f(x) = y
= y
x = 2y, which may not be in A.
For example, if y = 1, then
x = 2, which is not in A.
So, f is not onto.
So, f is not bijective.
(ii) g(x) = |x|
Injection test:
Let x and y be any two elements in the domain (A), such that f(x) = f(y).
f(x) = f(y)
|x| = |y|
x = y
So, f is not one-one.
Surjection test:
For y = 1, there is no value of x in A.
So, f is not onto.
So, f is not bijective.
(iii) h(x) = x2
Injection test:
Let x and y be any two elements in the domain (A), such that f(x) = f(y).
f(x) = f(y)
x2 = y2
x = y
So, f is not one-one.
Surjection test:
For y = 1, there is no value of x in A.
So, f is not onto.
So, f is not bijective.
Page No 2.32:
Question 9:
Are the following set of ordered pairs functions? If so, examine whether the mapping is injective or surjective:
(i) {(x, y) : x is a person, y is the mother of x}
(ii) {(a, b) : a is a person, b is an ancestor of a} [NCERT EXEMPLAR]
Answer:
(i) f = {(x, y) : x is a person, y is the mother of x}
As, for each element x in domain set, there is a unique related element y in co-domain set.
So, f is the function.
Injection test:
As, y can be mother of two or more persons
So, f is not injective.
Surjection test:
For every mother y defined by (x, y), there exists a person x for whom y is mother.
So, f is surjective.
Therefore, f is surjective function.
(ii) g = {(a, b) : a is a person, b is an ancestor of a}
Since, the ordered map (a, b) does not map 'a' - a person to a living person.
So, g is not a function.
Page No 2.32:
Question 10:
Let A = {1, 2, 3}. Write all one-one from A to itself.
Answer:
A ={1, 2, 3}
Number of elements in A = 3
Number of one-one functions = number of ways of arranging 3 elements = 3! = 6
(i) {(1, 1), (2, 2), (3, 3)}
(ii) {(1, 1), (2, 3), (3, 2)}
(iii) {(1, 2 ), (2, 2), (3, 3 )}
(iv) {(1, 2), (2, 1), (3, 3)}
(v) {(1, 3), (2, 2), (3, 1)}
(vi) {(1, 3), (2, 1), (3,2 )}
Page No 2.32:
Question 11:
If f : R → R be the function defined by f(x) = 4x3 + 7, show that f is a bijection.
Answer:
Injectivity:
Let x and y be any two elements in the domain (R), such that f(x) = f(y)
So, f is one-one.
Surjectivity:
Let y be any element in the co-domain (R), such that f(x) = y for some element x in R (domain).
f(x) = y
So, for every element in the co-domain, there exists some pre-image in the domain.
f is onto.
Since, f is both one-to-one and onto, it is a bijection.
Page No 2.32:
Question 12:
Show that the exponential function f : R → R, given by f(x) = ex, is one-one but not onto. What happens if the co-domain is replaced by (set of all positive real numbers)?
Answer:
f : R → R, given by f(x) = ex
Injectivity:
Let x and y be any two elements in the domain (R), such that f(x) = f(y)
f(x)=f(y)
So, f is one-one.
Surjectivity:
We know that range of ex is (0, ∞) = R+
Co-domain = R
Both are not same.
So, f is not onto.
If the co-domain is replaced by R+, then the co-domain and range become the same and in that case, f is onto and hence, it is a bijection.
Page No 2.32:
Question 13:
Show that the logarithmic function is a bijection.
Answer:
f:R+→R given by , a>0
Injectivity:
Let x and y be any two elements in the domain (N), such that f(x) = f(y).
f(x) = f(y)
So, f is one-one.
Surjectivity:
Let y be any element in the co-domain (R), such that f(x) = y for some element x in R+ (domain).
f(x) = y
So, for every element in the co-domain, there exists some pre-image in the domain.
f is onto.
Since f is one-one and onto, it is a bijection.
Page No 2.32:
Question 14:
If A = {1, 2, 3}, show that a one-one function f : A → A must be onto.
Answer:
A ={1, 2, 3}
Number of elements in A = 3
Number of one - one functions = number of ways of arranging 3 elements = 3! = 6
So, the possible one -one functions can be the following:
(i) {(1, 1), (2, 2), (3, 3)}
(ii) {(1, 1), (2, 3), (3, 2)}
(iii) {(1, 2 ), (2, 2), (3, 3 )}
(iv) {(1, 2), (2, 1), (3, 3)}
(v) {(1, 3), (2, 2), (3, 1)}
(vi) {(1, 3), (2, 1), (3,2 )}
Here, in each function, range = {1, 2, 3}, which is same as the co-domain.
So, all the functions are onto.
Page No 2.32:
Question 15:
If A = {1, 2, 3}, show that a onto function f : A → A must be one-one.
Answer:
A ={1, 2, 3}
Possible onto functions from A to A can be the following:
(i) {(1, 1), (2, 2), (3, 3)}
(ii) {(1, 1), (2, 3), (3, 2)}
(iii) {(1, 2 ), (2, 2), (3, 3 )}
(iv) {(1, 2), (2, 1), (3, 3)}
(v) {(1, 3), (2, 2), (3, 1)}
(vi) {(1, 3), (2, 1), (3,2 )}
Here, in each function, different elements of the domain have different images.
So, all the functions are one-one.
Page No 2.32:
Question 16:
Find the number of all onto functions from the set A = {1, 2, 3, ..., n} to itself.
Answer:
We know that every onto function from A to itself is one-one.
So, the number of one-one functions = number of bijections = n!
Page No 2.32:
Question 17:
Give examples of two one-one functions f1 and f2 from R to R, such that f1 + f2 : R → R. defined by (f1 + f2) (x) = f1 (x) + f2 (x) is not one-one.
Answer:
We know that f1: R → R, given by f1(x)=x, and f2(x)=-x are one-one.
Proving f1 is one-one:
So, f1 is one-one.
Proving f2 is one-one:
So, f2 is one-one.
Proving (f1 + f2) is not one-one:
Given:
(f1 + f2) (x) = f1 (x) + f2 (x)= x + (-x) =0
So, for every real number x, (f1 + f2) (x)=0
So, the image of ever number in the domain is same as 0.
Thus, (f1 + f2) is not one-one.
Page No 2.32:
Question 18:
Give examples of two surjective functions f1 and f2 from Z to Z such that f1 + f2 is not surjective.
Answer:
We know that f1: R → R, given by f1(x) = x, and f2(x) = -x are surjective functions.
Proving f1 is surjective :
Let y be an element in the co-domain (R), such that f1(x) = y.
f1(x) = y
x = y, which is in R.
So, for every element in the co-domain, there exists some pre-image in the domain.
So, f1is surjective .
Proving f2 is surjective :
Let y be an element in the co domain (R) such that f2(x) = y.
f2(x) = y
x = y, which is in R.
So, for every element in the co-domain, there exists some pre-image in the domain.
So, f2 is surjective .
Proving (f1 + f2) is not surjective :
Given:
(f1 + f2) (x) = f1 (x) + f2 (x)= x + (-x) =0
So, for every real number x, (f1 + f2) (x)=0
So, the image of every number in the domain is same as 0.
Range = {0}
Co-domain = R
So, both are not same.
So, f1 + f2 is not surjective.
Page No 2.32:
Question 19:
Show that if f1 and f2 are one-one maps from R to R, then the product defined by need not be one-one.
Answer:
We know that f1: R → R, given by f1(x) = x, and f2(x) = x are one-one.
Proving f1 is one-one:
Let x and y be two elements in the domain R, such that
f1(x) = f1(y)
x = y
So, f1 is one-one.
Proving f2 is one-one:
Let x and y be two elements in the domain R, such that
f2(x) = f2(y)
x = y
So, f2 is one-one.
Proving is not one-one:
Given:
Page No 2.32:
Question 20:
Suppose f1 and f2 are non-zero one-one functions from R to R. Is necessarily one-one? Justify your answer. Here, is given by for all .
Answer:
We know that f1: R → R, given by f1(x)=x3 and f2(x)=x are one-one.
Injectivity of f1:
Let f1(x)=f1(y)x=y
So, f1 is one-one.
Injectivity of f2:
Let x and y be two elements in the domain R, such that
So, f2 is one-one.
Proving is not one-one:
Given that
Let x and y be two elements in the domain R, such that
So, is not one-one.
Page No 2.32:
Question 21:
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of each of the following:
(i) an injective map from A to B
(ii) a mapping from A to B which is not injective
(iii) a mapping from A to B.
Answer:
(i) {(2, 7), (3, 6), (4, 5)}
(ii) {(2, 2), (3, 2), (4, 5)}
(iii) {(2, 5), (3, 6), (4, 7)}
Disclaimer: There are many more possibilities of each case.
Page No 2.32:
Question 22:
Show that f : R R, given by f(x) = x [x], is neither one-one nor onto.
Answer:
We have, f(x) = x [x]
Injection test:
f(x) = 0 for all x Z
So, f is a many-one function.
Surjection test:
Range (f) = [0, 1) R.
So, f is an into function.
Therefore, f is neither one-one nor onto.
Page No 2.32:
Question 23:
Let f : N N be defined by
Show that f is a bijection. [CBSE 2012, NCERT]
Answer:
Page No 2.46:
Question 1:
Find gof and fog when f : R → R and g : R → R are defined by
(i) f(x) = 2x + 3 and g(x) = x2 + 5
(ii) f(x) = 2x + x2 and g(x) = x3
(iii) f(x) = x2 + 8 and g(x) = 3x3 + 1
(iv) f(x) = x and g(x) = |x|
(v) f(x) = x2 + 2x − 3 and g(x) = 3x − 4
(vi) f(x) = 8x3 and g(x) = x1/3
Answer:
Given, f : R → R and g : R → R
So, gof : R → R and fog : R → R
(i) f(x) = 2x + 3 and g(x) = x2 + 5
Now, (gof) (x)
= g (f (x))
= g (2x +3)
= (2x + 3)2 + 5
= 4x2+ 9 + 12x +5
=4x2+ 12x + 14
(fog) (x)
=f (g (x))
= f (x2 + 5)
= 2 (x2 + 5) +3
= 2 x2+ 10 + 3
= 2x2 + 13
(ii) f(x) = 2x + x2 and g(x) = x3
(iii) f(x) = x2 + 8 and g(x) = 3x3 + 1
(iv) f(x) = x and g(x) = |x|
(v) f(x) = x2 + 2x − 3 and g(x) = 3x − 4
(vi) f(x) = 8x3 and g(x) = x1/3
Page No 2.46:
Question 2:
Let f = {(3, 1), (9, 3), (12, 4)} and g = {(1, 3), (3, 3) (4, 9) (5, 9)}. Show that gof and fog are both defined. Also, find fog and gof.
Answer:
f = {(3, 1), (9, 3), (12, 4)} and g = {(1, 3), (3, 3) (4, 9) (5, 9)}
f : {3, 9, 12} → {1, 3,4} and g : {1, 3, 4, 5} → {3, 9}
Co-domain of f is a subset of the domain of g.
So, gof exists and gof : {3, 9, 12} → {3, 9}
Co-domain of g is a subset of the domain of f.
So, fog exists and fog : {1, 3, 4, 5} → {3, 9, 12}
Page No 2.46:
Question 3:
Let f = {(1, −1), (4, −2), (9, −3), (16, 4)} and g = {(−1, −2), (−2, −4), (−3, −6), (4, 8)}. Show that gof is defined while fog is not defined. Also, find gof.
Answer:
f = {(1, −1), (4, −2), (9, −3), (16, 4)} and g = {(−1, −2), (−2, −4), (−3, −6), (4, 8)}
f : {1, 4, 9, 16} → {-1, -2, -3, 4} and g : {-1, -2, -3, 4} → {-2, -4, -6, 8}
Co-domain of f = domain of g
So, gof exists and gof : {1, 4, 9, 16} → {-2, -4, -6, 8}
But the co-domain of g is not same as the domain of f.
So, fog does not exist.
Page No 2.46:
Question 4:
Let A = {a, b, c}, B = {u v, w} and let f and g be two functions from A to B and from B to A, respectively, defined as :
f = {(a, v), (b, u), (c, w)}, g = {(u, b), (v, a), (w, c)}.
Show that f and g both are bijections and find fog and gof.
Answer:
Proving f is a bijection:
f = {(a, v), (b, u), (c, w)} and f : A → B
Injectivity of f: No two elements of A have the same image in B.
So, f is one-one.
Surjectivity of f: Co-domain of f = {u v, w}
Range of f = {u v, w}
Both are same.
So, f is onto.
Hence, f is a bijection.
Proving g is a bijection:
g = {(u, b), (v, a), (w, c)} and g : B → A
Injectivity of g: No two elements of B have the same image in A.
So, g is one-one.
Surjectivity of g: Co-domain of g = {a, b, c}
Range of g = {a, b, c}
Both are the same.
So, g is onto.
Hence, g is a bijection.
Finding fog:
Co-domain of g is same as the domain of f.
So, fog exists and fog : {u v, w} → {u v, w}
Finding gof:
Co-domain of f is same as the domain of g.
So, fog exists and gof : {a, b, c} → {a, b, c}
Page No 2.46:
Question 5:
Find fog (2) and gof (1) when : f : R → R ; f(x) = x2 + 8 and g : R → R; g(x) = 3x3 + 1.
Answer:
Page No 2.46:
Question 6:
Let R+ be the set of all non-negative real numbers. If f : R+ → R+ and g : R+ → R+ are defined as , find fog and gof. Are they equal functions?
Answer:
Given, f : R+ → R+ and g : R+ → R+
So, fog : R+ → R+ and gof : R+ → R+
Domains of fog and gof are the same.
Hence, fog = gof
Page No 2.46:
Question 7:
Let f : R → R and g : R → R be defined by f(x) = x2 and g(x) = x + 1. Show that fog ≠ gof.
Answer:
Given, f : R → R and g : R → R.
So, the domains of f and g are the same.
So, fog ≠ gof
Page No 2.46:
Question 8:
Let f : R → R and g : R → R be defined by f(x) = x + 1 and g(x) = x − 1. Show that fog = gof = IR.
Answer:
Given, f : R → R and g : R → R
fog : R → R and gof : R → R (Also, we know that IR : R → R)
So, the domains of all fog, gof and IR are the same.
Page No 2.46:
Question 9:
Verify associativity for the following three mappings : f : N → Z0 (the set of non-zero integers), g : Z0 → Q and h : Q → R given by f(x) = 2x, g(x) = 1/x and h(x) = ex.
Answer:
Given that f : N → Z0 , g : Z0 → Q and h : Q → R .
gof : N → Q and hog : Z0 → R
h o (gof ) : N → R and (hog) o f: N → R
So, both have the same domains.
Hence, the associative property has been verified.
Page No 2.46:
Question 10:
Consider f : N → N, g : N → N and h : N → R defined as f(x) = 2x, g(y) = 3y + 4 and h(z) = sin z for all x, y, z ∈ N. Show that ho (gof) = (hog) of.
Answer:
Given, f : N → N, g : N → N and h : N → R
gof : N → N and hog : N → R
ho (gof) : N → R and (hog) of : N → R
So, both have the same domains.
Page No 2.46:
Question 11:
Give examples of two functions f : N → N and g : N → N, such that gof is onto but f is not onto.
Answer:
Let us consider a function f : N → N given by f(x) = x +1 , which is not onto.
[This not onto because if we take 0 in N (co-domain), then,
0=x+1
x=-1]
Let us consider g : N → N given by
Page No 2.46:
Question 12:
Give examples of two functions f : N → Z and g : Z → Z, such that gof is injective but g is not injective.
Answer:
Let f : N → Z be given by f (x) = x, which is injective.
(If we take f(x) = f(y), then it gives x = y)
Let g : Z → Z be given by g (x) = |x|, which is not injective.
If we take f(x) = f(y), we get:
|x| = |y|
x = y
Now, gof : N → Z.
Let us take two elements x and y in the domain of gof , such that
So, gof is injective.
Page No 2.46:
Question 13:
If f : A → B and g : B → C are one-one functions, show that gof is a one-one function.
Answer:
Given, f : A → B and g : B → C are one - one.
Then, gof : A → B
Let us take two elements x and y from A, such that
Hence, gof is one-one.
Page No 2.46:
Question 14:
If f : A → B and g : B → C are onto functions, show that gof is a onto function.
Answer:
Given, f : A → B and g : B → C are onto.
Then, gof : A → C
Let us take an element z in the co-domain (C).
Now, z is in C and g : B → C is onto.
So, there exists some element y in B, such that g (y) = z ... (1)
Now, y is in B and f : A → B is onto.
So, there exists some x in A, such that f (x) = y ... (2)
From (1) and (2),
z = g (y) = g (f (x)) = (gof) (x)
So, z = (gof) (x), where x is in A.
Hence, gof is onto.
Page No 2.54:
Question 1:
Find fog and gof if
(i)
(ii)
(iii)
(iv)
(v)
(vi)
(vii)
(viii)
(ix)
Answer:
Page No 2.54:
Question 2:
Let f(x) = x2 + x + 1 and g(x) = sin x. Show that fog ≠ gof.
Answer:
Page No 2.54:
Question 3:
If f(x) = |x|, prove that fof = f.
Answer:
Domains of f and fof are same as R.
Page No 2.54:
Question 4:
If f(x) = 2x + 5 and g(x) = x2 + 1 be two real functions, then describe each of the following functions:
(i) fog
(ii) gof
(iii) fof
(iv) f2
Also, show that fof ≠ f2
Answer:
f(x) and g(x) are polynomials.
f : R → R and g : R → R.
So, fog : R → R and gof : R → R.
→→ →
Page No 2.54:
Question 5:
If f(x) = sin x and g(x) = 2x be two real functions, then describe gof and fog. Are these equal functions?
Answer:
Clearly, foggof
Page No 2.54:
Question 6:
Let f, g, h be real functions given by f(x) = sin x, g (x) = 2x and h (x) = cos x. Prove that fog = go (fh).
Answer:
Page No 2.54:
Question 7:
Let f be any real function and let g be a function given by g(x) = 2x. Prove that gof = f + f.
Answer:
Page No 2.54:
Question 8:
If are two real functions, then describe functions fog and gof.
Answer:
Page No 2.54:
Question 9:
If be defined as
respectively, describe fog and gof.
Answer:
Page No 2.54:
Question 10:
If be two real functions, then find fog and gof.
Answer:
Page No 2.54:
Question 11:
Let f be a real function given by .
Find each of the following:
(i) fof
(ii) fofof
(iii) (fofof) (38)
(iv) f2
Also, show that fof ≠ f2 .
Answer:
Page No 2.55:
Question 12:
Let . Find fof.
Answer:
Page No 2.55:
Question 13:
If f, g : R → R be two functions defined as f(x) = |x| + x and g(x) = |x| –. Then find fog and gof. Hence find fog(–3), fog(5) and gof (–2).
Answer:
Given: f(x) = |x| + x
and g(x) = |x| –
Therefore,
Therefore, g(f(x)) = gof = 0
Now, fog(−3) =(4)(−3) = −12 (since, fog = 4x for x < 0)
fog(5) = 0 (since, fog = 0 for x 0)
gof(−2) = 0 (since, gof = 0 for x < 0)
Page No 2.68:
Question 1:
State with reasons whether the following functions have inverse:
(i) f : {1, 2, 3, 4} → {10} with f = {(1, 10), (2, 10), (3, 10), (4, 10)}
(ii) g : {5, 6, 7, 8} → {1, 2, 3, 4} with g = {(5, 4), (6, 3), (7, 4), (8, 2)}
(iii) h : {2, 3, 4, 5} → {7, 9, 11, 13} with h = {(2, 7), (3, 9), (4, 11), (5, 13)}
Answer:
(i) f : {1, 2, 3, 4} → {10} with f = {(1, 10), (2, 10), (3, 10), (4, 10)}
We have:
f (1) = f (2) = f (3) = f (4) = 10
f is not one-one.
f is not a bijection.
So, f does not have an inverse.
(ii) g : {5, 6, 7, 8} → {1, 2, 3, 4} with g = {(5, 4), (6, 3), (7, 4), (8, 2)}
g (5) = g (7) = 4
f is not one-one.
f is not a bijection.
So, f does not have an inverse.
(iii) h : {2, 3, 4, 5} → {7, 9, 11, 13} with h = {(2, 7), (3, 9), (4, 11), (5, 13)}
Here, different elements of the domain have different images in the co-domain.
h is one-one.
Also, each element in the co-domain has a pre-image in the domain.
h is onto.
h is a bijection.
h has an inverse and it is given by
h-1={(7, 2), (9, 3), (11, 4), (13, 5)}
Page No 2.68:
Question 2:
Find f −1 if it exists : f : A → B, where
(i) A = {0, −1, −3, 2}; B = {−9, −3, 0, 6} and f(x) = 3 x.
(ii) A = {1, 3, 5, 7, 9}; B = {0, 1, 9, 25, 49, 81} and f(x) = x2
Answer:
(i) A = {0, −1, −3, 2}; B = {−9, −3, 0, 6} and f(x) = 3 x.
Given: f(x) = 3 x
So, f = {(0, 0), (-1, -3), (-3, -9), (2, 6)}
Clearly, this is one-one.
Range of f = Range of f =B
So, f is a bijection and, thus, f -1 exists.
Hence, f -1= {(0, 0), (-3, -1), (-9, -3), (6, 2)}
(ii) A = {1, 3, 5, 7, 9}; B = {0, 1, 9, 25, 49, 81} and f(x) = x2
Given: f(x) = x2
So, f = {(1, 1), (3, 9), (5, 25), (7,49), (9, 81)}
Clearly, f is one-one.
But this is not onto because the element 0 in the co-domain (B) has no pre-image in the domain (A) .
f is not a bijection.
So, f -1does not exist.
Page No 2.68:
Question 3:
Consider f : {1, 2, 3} → {a, b, c} and g : {a, b, c} → {apple, ball, cat} defined as f (1) = a, f (2) = b, f (3) = c, g (a) = apple, g (b) = ball and g (c) = cat. Show that f, g and gof are invertible. Find f−1, g−1 and gof−1 and show that (gof)−1 = f −1o g−1.
Answer:
Page No 2.68:
Question 4:
Let A = {1, 2, 3, 4}; B = {3, 5, 7, 9}; C = {7, 23, 47, 79} and f : A → B, g : B → C be defined as f(x) = 2x + 1 and g(x) = x2 − 2. Express (gof)−1 and f−1 og−1 as the sets of ordered pairs and verify that (gof)−1 = f−1 og−1.
Answer:
Page No 2.68:
Question 5:
Show that the function f : Q → Q, defined by f(x) = 3x + 5, is invertible. Also, find f−1
Answer:
Injectivity of f:
Let x and y be two elements of the domain (Q), such that
f(x)=f(y)
3x + 5 =3y + 5
3x = 3y
x = y
So, f is one-one.
Surjectivity of f:
Let y be in the co-domain (Q), such that f(x) = y
f is onto.
So, f is a bijection and, hence, it is invertible.
Finding f -1:
Page No 2.68:
Question 6:
Consider f : R → R given by f(x) = 4x + 3. Show that f is invertible. Find the inverse of f.
Answer:
Injectivity of f :
Let x and y be two elements of domain (R), such that
f(x) = f(y)
4x + 3 = 4y + 3
4x = 4y
x = y
So, f is one-one.
Surjectivity of f :
Let y be in the co-domain (R), such that f(x) = y.
f is onto.
So, f is a bijection and, hence, is invertible.
Finding f -1:
Page No 2.68:
Question 7:
Consider f : R → R+ → [4, ∞) given by f(x) = x2 + 4. Show that f is invertible with inverse f−1 of f given by f−1 , where R+ is the set of all non-negative real numbers.
Answer:
Injectivity of f :
Let x and y be two elements of the domain (Q), such that
f(x)=f(y)
So, f is one-one.
Surjectivity of f :
Let y be in the co-domain (Q), such that f(x) = y
f is onto.
So, f is a bijection and, hence, it is invertible.
Finding f -1:
Page No 2.68:
Question 8:
If , show that fof(x) = x for all . What is the inverse of f?
Answer:
Page No 2.68:
Question 9:
Consider f : R+ → [−5, ∞) given by f(x) = 9x2 + 6x − 5. Show that f is invertible with .
Answer:
Injectivity of f :
Let x and y be two elements of domain (R+), such that
f(x)=f(y)
So, f is one-one.
Surjectivity of f:
Let y is in the co domain (Q) such that f(x) = y
f is onto.
So, f is a bijection and hence, it is invertible.
Finding f -1:
Page No 2.69:
Question 10:
If f : R → R be defined by f(x) = x3 −3, then prove that f−1 exists and find a formula for f−1. Hence, find f−1 (24) and f−1 (5).
Answer:
Injectivity of f :
Let x and y be two elements in domain (R),
So, f is one-one.
Surjectivity of f :
Let y be in the co-domain (R) such that f(x) = y
f is onto.
So, f is a bijection and, hence, it is invertible.
Finding f -1:
Page No 2.69:
Question 11:
A function f : R → R is defined as f(x) = x3 + 4. Is it a bijection or not? In case it is a bijection, find f−1 (3).
Answer:
Injectivity of f:
Let x and y be two elements of domain (R), such that
So, f is one-one.
Surjectivity of f:
Let y be in the co-domain (R), such that f(x) = y.
f is onto.
So, f is a bijection and, hence, is invertible.
Finding f -1:
Page No 2.69:
Question 12:
If f : Q → Q, g : Q → Q are two functions defined by f(x) = 2 x and g(x) = x + 2, show that f and g are bijective maps. Verify that (gof)−1 = f−1 og −1.
Answer:
Injectivity of f:
Let x and y be two elements of domain (Q), such that
f(x) = f(y)
2x = 2y
x = y
So, f is one-one.
Surjectivity of f:
Let y be in the co-domain (Q), such that f(x) = y.
f is onto.
So, f is a bijection and, hence, it is invertible.
Finding f -1:
Injectivity of g:
Let x and y be two elements of domain (Q), such that
g(x) = g(y)
x + 2 = y + 2
x = y
So, g is one-one.
Surjectivity of g:
Let y be in the co domain (Q), such that g(x) = y.
g is onto.
So, g is a bijection and, hence, it is invertible.
Finding g -1:
Verification of (gof)−1 = f−1 og −1:
Page No 2.69:
Question 13:
Let A = R {3} and B = R {1}. Consider the function f : A B defined by f(x) = . Show that f is one-one and onto and
hence find f1. [CBSE 2012, 2014]
Answer:
We have,
A = R {3} and B = R {1}
The function f : A B defined by f(x) =
Page No 2.69:
Question 14:
Consider the function f : R+ given by f(x) = 5x2 + 6x 9. Prove that f is invertible with f1(y) = . [CBSE 2015]
Answer:
Page No 2.69:
Question 15:
Let f : NN be a function defined as f 965. Show that f : NS, where S is the range of f, is invertible. find the inverse of f and hence find f 1(43) and f 1(163).
Answer:
We have,
f : NN is a function defined as f (x) = 9x2 + 6x 5.
Let y = f (x) = 9x2 + 6x 5
Now,
Since, fog(y) and gof(x) are identity function.
Thus, f is invertible.
So, .
Now,
f 1(43) =
And f 1(163) =
Page No 2.69:
Question 16:
Let f : R R be a function defined as f . Show that
f : R Rang (f) is one-one and onto. Hence, find f 1.
Answer:
The function .
Injectivity: Let be such that
Hence, f is one-one function.
Surjectivity: Let y be an arbitrary element of . Then,
f(x) = y
As .
Also, because , which is not possible.
Thus,
such that
, so every element in has pre-image in .
Hence, f is onto.
Now,
Replacing x by and y by x, we have
Page No 2.69:
Question 17:
Let A = R – {2} and B = R – {1}. If f : A → B is a function defined by show that f is one-one and onto. Find f–1.
Answer:
Given:
To show f is one-one:
Since, f is one-one and onto
Therefore, f is invertible with .
Page No 2.69:
Question 18:
Show that the function f : N → N defined by f(x) = x2 + x + 1 is one-one but not onto. Find the inverse of f : N → S, where S is range of f.
Answer:
Given: The function f : N → N defined by f(x) = x2 + x + 1
To show f is one-one:
Page No 2.69:
Question 19:
Let f : [−1, ∞) → [−1, ∞) be given by f(x) = (x + 1)2 − 1, x ≥ −1. Show that f is invertible. Also, find the set S = {x : f(x) = f−1 (x)}.
Answer:
Page No 2.69:
Question 20:
Let A = {x &epsis; R | −1 ≤ x ≤ 1} and let f : A → A, g : A → A be two functions defined by f(x) = x2 and g(x) = sin (π x/2). Show that g−1 exists but f−1 does not exist. Also, find g−1.
Answer:
f is not one-one because
-1 and 1 have the same image under f.
f is not a bijection.
So, f -1 does not exist.
Injectivity of g:
Let x and y be any two elements in the domain (A), such that
So, g is one-one.
Surjectivity of g:
g is onto.
g is a bijection.
So, g-1 exists.
Also,
Page No 2.69:
Question 21:
Let f be a function from R to R, such that f(x) = cos (x + 2). Is f invertible? Justify your answer.
Answer:
Injectivity:
Let x and y be two elements in the domain (R), such that
f is not one-one.
f is not a bijection.
Thus, f is not invertible.
Page No 2.69:
Question 22:
If A = {1, 2, 3, 4} and B = {a, b, c, d}, define any four bijections from A to B. Also give their inverse functions.
Answer:
Clearly, all these are bijections because they are one-one and onto.
Page No 2.69:
Question 23:
Let A and B be two sets, each with a finite number of elements. Assume that there is an injective map from A to B and that there is an injective map from B to A. Prove that there is a bijection from A to B.
Answer:
Page No 2.69:
Question 24:
If f : A → A, g : A → A are two bijections, then prove that
(i) fog is an injection
(ii) fog is a surjection
Answer:
Given: A → A, g : A → A are two bijections.
Then, fog : A → A
(i) Injectivity of fog:
Let x and y be two elements of the domain (A), such that
So, fog is an injection.
(ii) Surjectivity of fog:
Let z be an element in the co-domain of fog (A).
So, fog is a surjection.
Page No 2.72:
Question 1:
Let
let . Then,
(a) S defines a function from A to B
(b) S0 defines a function from A to C
(c) S0 defines a function from A to B
(d) S defines a function from A to C
Answer:
(a) S defines a function from A to B
Page No 2.72:
Question 2:
(a) injective
(b) surjective
(c) bijective
(d) None of these
Answer:
f is not a function.
So, the answer is (d).
Page No 2.72:
Question 3:
If is a bijection, then
(a)
(b)
(c)
(d) None of these
Answer:
(d) None of these
Page No 2.72:
Question 4:
The function f : R → R defined by
(a) one-one and onto
(b) many-one and onto
(c) one-one and into
(d) many-one and into
Answer:
(d) many-one and into
Graph for the given function is as follows.
A line parallel to X axis is cutting the graph at two different values.
Therefore, for two different values of x we are getting the same value of y.
That means it is many one function.
From the given graph we can see that the range is
and R is the co-domain of the given function.
Hence, Co-domainRange
Therefore, the given function is into.
Page No 2.72:
Question 5:
Let the function be defined by
(a) f is one-one but not onto
(b) f is onto but not one-one
(c) f is both one-one and onto
(d) None of these
Answer:
(c) f is both one-one and onto
Injectivity:
Let x and y be two elements in the domain R- {-b}, such that
So, f is one-one.
Surjectivity:
Let y be an element in the co-domain of f, i.e. R-{1}, such that f (x)=y
So, f is onto.
Page No 2.73:
Question 6:
The function defined by is a bijection if
(a)
(b)
(c)
(d)
Answer:
(a)
Page No 2.73:
Question 7:
Let . Then, the mapping is
(a) injective but not surjective
(b) surjective but not injective
(c) bijective
(d) none of these
Answer:
Injectivity:
Let x and y be any two elements in the domain A.
Case-1: Let x and y be two positive numbers, such that
Case-2: Let x and y be two negative numbers, such that
Case-3: Let x be positive and y be negative.
From the 3 cases, we can conclude that f is one-one.
Surjectivity:
Let y be an element in the co-domain, such that y = f (x)
f is onto.
f is a bijection.
So, the answer is (c).
Page No 2.73:
Question 8:
Let be given by where [x] denotes the greatest integer less than or equal to x. Then, f(x) is
(a) many-one and onto
(b) many-one and into
(c) one-one and into
(d) one-one and onto
Answer:
(b) many-one and into
It is many one function because in this case for two different values of x
we would get the same value of f(x) .
It is into function because for the given domain we would only get the integral values of
f(x).
but R is the codomain of the given function.
That means , CodomainRange
Hence, the given function is into function.
Therefore, f(x) is many one and into
Page No 2.73:
Question 9:
Let M be the set of all 2 × 2 matrices with entries from the set R of real numbers. Then, the function f : M → R defined by f(A) = |A| for every A ∈ M, is
(a) one-one and onto
(b) neither one-one nor onto
(c) one-one but-not onto
(d) onto but not one-one
Answer:
Injectivity:
So, f is not one-one.
Surjectivity:
Let y be an element of the co-domain, such that
f is onto.
So, the answer is (d).
Page No 2.73:
Question 10:
The function
(a) one-one and onto
(b) one-one but not onto
(c) onto but not one-one
(d) onto but not one-one
Answer:
Injectivity:
Let x and y be two elements in the domain, such that
So, f is one-one.
Surjectivity:
Let y be an element in the co domain R, such that
f is not onto.
So, the answer is (b).
Page No 2.73:
Question 11:
The range of the function is
(a) {1, 2, 3, 4, 5}
(b) {1, 2, 3, 4, 5, 6}
(c) {1, 2, 3, 4}
(d) {1, 2, 3}
Answer:
We know that
So, the answer is (d).
Page No 2.73:
Question 12:
A function f from the set of natural numbers to integers defined by
(a) neither one-one nor onto
(b) one-one but not onto
(c) onto but not one-one
(d) one-one and onto both
Answer:
(d) one-one and onto both
Injectivity:
Let x and y be any two elements in the domain (N).
Surjectivity:
f is onto.
Page No 2.73:
Question 13:
Let f be an injective map with domain {x, y, z} and range {1, 2, 3}, such that exactly one of the following statements is correct and the remaining are false.
The value of is
(a) x
(b) y
(c) z
(d) none of these
Answer:
So, the answer is (b).
Page No 2.73:
Question 14:
Which of the following functions form Z to itself are bijections?
(a)
(b)
(c)
(d)
Answer:
(b) Injectivity:
Let x and y be two elements of the domain (Z), such that
So, f is one-one.
Surjectivity:
Let y be an element in the co-domain (Z), such that
f is onto.
So, f is a bijection.
So, the answer is (b).
Page No 2.73:
Question 15:
Which of the following functions from to itself are bijections?
(a)
(b)
(c)
(d)
Answer:
So, the answer is (b).
Page No 2.73:
Question 16:
Let , then f is
(a) a bijection
(b) injective but not surjective
(c) surjective but not injective
(d) neither injective nor surjective
Answer:
Injectivity:
Let x and y be any two elements in the domain A.
Case-1: Let x and y be two positive numbers, such that
Case-2: Let x and y be two negative numbers, such that
Case-3: Let x be positive and y be negative.
So, f is one-one.
Surjectivity:
Let y be an element in the co-domain, such that y = f (x)
f is onto
f is a bijection.
So, the answer is (a).
Page No 2.73:
Question 17:
If the function is a surjection, then A =
(a) R
(b) [0, 1]
(c) [0, 1)
(d) [0, 1)
Answer:
So, the answer is (d).
Page No 2.73:
Question 18:
If a function is a bijection, then B =
(a) R
(b) [1, ∞)
(c) [4, ∞)
(d) [5, ∞)
Answer:
Since f is a bijection, co-domain of f = range of f
B = range of f
So, the answer is (b).
Page No 2.74:
Question 19:
The function defined by
is
(a) one-one but not onto
(b) onto but not one-one
(c) both one and onto
(d) neither one-one nor onto
Answer:
Injectivity:
So, f is not one-one.
Surjectivity:
Let y be an element in the co domain R, such that
So, the answer is (b).
Page No 2.74:
Question 20:
The function , defined by , is
(a) bijection
(b) injection but not a surjection
(c) surjection but not an injection
(d) neither an injection nor a surjection
Answer:
Injectivity:
Let x and y be two elements in the domain , such that
So, f is one-one.
Surjectivity:
Let y be any element in the co-domain, such that
f is onto.
f is a bijection.
So, the answer is (a).
Page No 2.74:
Question 21:
Let be a function defined by
(a) f is a bijection
(b) f is an injection only
(c) f is surjection on only
(d) f is neither an injection nor a surjection
Answer:
(d) f is neither an injection nor a surjection
Therefore, this function is not injective.
Therefore, this function is not surjective .
Page No 2.74:
Question 22:
Let be a function defined by
Then,
(a) f is one-one onto
(b) f is one-one into
(c) f is many one onto
(d) f is many one into
Answer:
Injectivity:
Let x and y be two elements in the domain R-{n}, such that
So, f is one-one.
Surjectivity:
Let y be an element in the co domain R, such that
f is not onto.
Thus, the answer is (b).
Page No 2.74:
Question 23:
Let be a function defined by . Then, f is
(a) one-one but not onto
(b) one-one and onto
(c) onto but not one-one
(d) neither one-one nor onto
Answer:
Injectivity:
Let x and y be two elements in the domain (R), such that
So, f is not one-one.
Surjectivity:
f is not onto.
The correct answer is (d).
Page No 2.74:
Question 24:
is defined by
(a) one-one but not onto
(b) many-one but onto
(c) one-one and onto
(d) neither one-one nor onto
Answer:
(d) neither one-one nor onto
Page No 2.74:
Question 25:
The function is
(a) injective but not surjective
(b) surjective but not injective
(c) injective as well as surjective
(d) neither injective nor surjective
Answer:
Injectivity:
Let x and y be any two elements in the domain (R), such that f(x) = f(y). Then,
Surjectivity:
So, both -1 and 1 have the same images.
f is not onto.
So, the answer is (d).
Page No 2.74:
Question 26:
A function f from the set of natural numbers to the set of integers defined by
is
(a) neither one-one nor onto
(b) one-one but not onto
(c) onto but not one-one
(d) one-one and onto
Answer:
Injectivity:
Let x and y be any two elements in the domain (N).
Surjectivity:
f is onto.
So, the answer is (d).
Page No 2.74:
Question 27:
Which of the following functions from to itself are bijections?
(a)
(b)
(c)
(d) None of these
Answer:
(b)
It is clear that f(x) is one-one.
⇒ f is onto.
So, f is a bijection.
Page No 2.74:
Question 28:
Let be given by
Then, f is
(a) onto but not one-one
(b) one-one but not onto
(c) one-one and onto
(d) neither one-one nor onto
Answer:
Injectivity:
Let x and y be two elements in the domain (Z), such that
So, f is not one-one.
Surjectivity:
Let y be an element in the co-domain (Z), such that
f is onto.
So, the answer is (a).
Page No 2.74:
Question 29:
The function defined by is
(a) one-one and onto
(b) many one and onto
(c) one-one and into
(d) many one and into
Answer:
(d) many one and into
Graph of the given function is as follows :
A line parallel to X axis is cutting the graph at two different values.
Therefore, for two different values of x we are getting the same value of y .
That means it is many one function .
From the given graph we can see that the range is
and R is the codomain of the given function .
Hence, CodomainRange
Therefore, the given function is into .
Page No 2.75:
Question 30:
Let . Then, the solution set of the equation is
(a) R
(b) {0}
(c) {0, 2}
(d) none of these
Answer:
So, the answer is (c).
Page No 2.75:
Question 31:
If
(a) is given by
(b) is given by
(c) does not exist because f is not one-one
(d) does not exist because f is not onto
Answer:
Clearly, f is a bijection.
So, f -1 exists.
So, the answer is (b).
Page No 2.75:
Question 32:
If
(a)
(b)
(c)
(d) f and g cannot be determined.
Answer:
If we solve it by the trial-and-error method, we can see that (a) satisfies the given condition.
From (a):
So, the answer is (a).
Page No 2.75:
Question 33:
The inverse of the function given by is
(a)
(b)
(c)
(d) none of these
Answer:
So, the answer is (a).
Page No 2.75:
Question 34:
Let . The inverse of the function, given by
(a)
(b)
(c)
(d) not defined
Answer:
So, the answer is (b).
Page No 2.75:
Question 35:
Let be defined as . Then, is
(a)
(b)
(c)
(d)
Answer:
The correct answer is (b).
Page No 2.75:
Question 36:
Let
(a)
(b)
(c)
(d) none of these
Answer:
So, the answer is (c).
Page No 2.75:
Question 37:
If the function be such that , where [x] denotes the greatest integer less than or equal to x, then is
(a)
(b) [x] − x
(c) not defined
(d) none of these
Answer:
f(x) = x - [x]
We know that the range of f is [0, 1).
Co-domain of f = R
As range of f Co-domain of f, f is not onto.
f is not a bijective function.
So, f -1 does not exist.
Thus, the answer is (c).
Page No 2.75:
Question 38:
If is given by equals
(a)
(b)
(c)
(d)
Answer:
So, the answer is (a).
Page No 2.75:
Question 39:
Let , where [x] denotes the greatest integer less than or equal to x. Then for all is equal to
(a) x
(b) 1
(c) f(x)
(d) g(x)
Answer:
(b) 1
Therefore, for each interval f(g(x))=1
Page No 2.75:
Question 40:
Let . Then, for what value of α is
(a)
(b)
(c) 1
(d) −1
Answer:
(d) −1
Page No 2.76:
Question 41:
The distinct linear functions that map [−1, 1] onto [0, 2] are
(a)
(b)
(c)
(d) None of these
Answer:
Let us substitute the end-points of the intervals in the given functions. Here, domain = [-1, 1] and range =[0, 2]
By substituting -1 or 1 in each option, we get:
Option (a):
So, option (a) is correct.
Option (b):
Here, f(-1) gives -2
So, (b) is not correct.
Similarly, we can see that (c) is also not correct.
Page No 2.76:
Question 42:
Let be defined by . Then, f is invertible if X =
(a)
(b)
(c)
(d)
Answer:
Since f is invertible, range of f = co domain of f = X
So, we need to find the range of f to find X.
For finding the range, let
So, the answer is (c).
Page No 2.76:
Question 43:
If is defined by equals
(a)
(b)
(c)
(d) None of these
Answer:
(b)
Page No 2.76:
Question 44:
Let [x] denote the greatest integer less than or equal to x. If , then
(a)
(b)
(c)
(d)
Answer:
(c)
Page No 2.76:
Question 45:
If , then f(x) is equal to
(a)
(b)
(c)
(d) 2
Answer:
We will solve this problem by the trial-and-error method.
Let us check option (a) first.
The given condition is satisfied by (a).
So, the answer is (a).
Page No 2.76:
Question 46:
If and the composite function , then g(x) is equal to
(a)
(b)
(c)
(d)
Answer:
(b)
So, the answer is (b).
Page No 2.76:
Question 47:
If is given by is equal to
(a)
(b)
(c)
(d)
Answer:
(c)
So, the answer is (c).
Page No 2.76:
Question 48:
Let be a function with domain {0, 1, 2, 3}. Then domain of is
(a) {3, 2, 1, 0}
(b) {0, −1, −2, −3}
(c) {0, 1, 8, 27}
(d) {0, −1, −8, −27}
Answer:
Page No 2.76:
Question 49:
Let be given by . Then, is given by
(a)
(b)
(c)
(d) None of these
Answer:
(d)
So, the answer is (d).
Page No 2.76:
Question 50:
Mark the correct alternative in the following question:
Let f : R R be given by f(x) = tanx. Then, f 1(1) is
(a) (b) (c) does not exist (d) none of these
Answer:
Hence, the correct alternative is option (b).
Page No 2.76:
Question 51:
Mark the correct alternative in the following question:
Let f : R R be defined as f(x) =
Then, find f(1) + f(2) + f(4)
(a) 9 (b) 14 (c) 5 (d) none of these
Answer:
Hence, the correct alternative is option (a).
Page No 2.76:
Question 52:
Mark the correct alternative in the following question:
Let A = {1, 2, ... , n} and B = {a, b}. Then the number of subjections from A into B is
(a) nP2 (b) 2n 2 (c) 2n 1 (d) nC2
Answer:
As, the number of surjections from A to B is equal to the number of functions from A to B minus the number of functions from A to B whose images are proper subsets of B.
And, the number of functions from a set with n number of elements into a set with m number of elements = mn
So, the number of subjections from A into B where A = {1, 2, ... , n} and B = {a, b} is 2n 2. (As, two functions can be many-one into functions)
Hence, the correct alternative is option (b).
Page No 2.76:
Question 53:
Mark the correct alternative in the following question:
If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and onto mappings from A to B is
(a) 720 (b) 120 (c) 0 (d) none of these
Answer:
Hence, the correct alternative is option (c).
Page No 2.76:
Question 54:
Mark the correct alternative in the following question:
If the set A contains 7 elements and the set B contains 10 elements, then the number one-one functions from A to B is
(a) 10C7 (b) 10C7 7! (c) 710 (d)107
Answer:
As, the number of one-one functions from A to B with m and n elements, respectively = nPm = nCm m!
So, the number of one-one functions from A to B with 7 and 10 elements, respectively = 10P7 = 10C7 7!
Hence, the correct alternative is option (b).
Page No 2.76:
Question 55:
Mark the correct alternative in the following question:
Let f : R R be defined by f(x) = . Then,
(a) f l(x) = f(x) (b) f 1(x) = f(x) (c) fof(x) = x (d) f 1(x) = f(x)
Answer:
We have,
f : R R is defined by f(x) =
Hence, the correct alternative is option (a).
Page No 2.77:
Question 56:
Let f : R → R be defined by Then, f is
(a) one-one
(b) onto
(e) bijective
(d) not defined
Answer:
Given: The function f : R → R be defined by
To check f is one-one:
Hence, the correct option is (a).
​
Page No 2.77:
Question 57:
Let f : R → R be defined by f(x) = 3x2 – 5 and g : R → R by Then (gof) (x) is
(a)
(b)
(c)
(d)
Answer:
Given: f(x) = 3x2 – 5 and
​Hence, the correct option is (a).
​
Page No 2.77:
Question 58:
Which of the following functions from Z to Z are bijections?
(a) f(x) = x3
(b) f(x) = x + 2
(c) f(x) = 2x + 1
(d) f(x) = x2 + 1
Answer:
Given: f : Z → Z
(a) f(x) = x3
It is one-one but not onto.
Thus, it is not bijective.
(b) f(x) = x + 2
It is one-one and onto.
Thus, it is bijective.
(c) f(x) = 2x + 1
It is one-one but not onto.
Thus, it is not bijective.
(d) f(x) = x2 + 1
It is neither one-one nor onto.
Thus, it is not bijective.
Hence, the correct option is (b).
Page No 2.77:
Question 59:
Let f : A → B and g : B → C be the bijective functions. Then, (gof)–1 =
(a) f–1o g–1
(b) fog
(c) g–1of–1
(d) gof
Answer:
Given: f : A → B and g : B → C be the bijective functions
​Hence, the correct option is (a).
​
Page No 2.77:
Question 60:
Let f : N → R be the function defined by and g : Q → R be another function defined by g(x) = x + 2. Then, (gof) (3/2) is
(a) 1
(b) 2
(c)
(d) none of these
Answer:
Given: and g(x) = x + 2
​Hence, the correct option is (d).
​
Page No 2.77:
Question 1:
The total number of functions from the set A = (1, 2, 3, 4 to the set B = a, b, c) is _________.
Answer:
Given:
Number of elements in A = 4
Number of elements in B = 3
Each element of A have 3 options to form an image.
Thus, Number of functions that can be formed = 3 × 3 × 3 × 3 = 81
​Hence, the total number of functions from the set A = {1, 2, 3, 4} to the set B = {a, b, c} is 81.
​
Page No 2.77:
Question 2:
The total number of one-one functions from the set A = {a, b, c} to the set B = {x, y, z, t} is _________.
Answer:
Given:
Number of elements in A = 3
Number of elements in B = 4
To form a one-one function,
Element a ∈ A have 4 options to form an image.
Element b ∈ A have 3 options to form an image.
Element c ∈ A have 2 options to form an image.
Thus, Number of one-one functions that can be formed = 4 × 3 × 2 = 24
​Hence, the total number of one-one functions from the set A = {a, b, c} to the set B = {x, y, z, t} is 24.
​
Page No 2.77:
Question 3:
The total number of onto functions from the set A = (1, 2, 3, 4, 5) to the set B = {x, y} is _________.
Answer:
Given:
Number of elements in A = 5
Number of elements in B = 2
Each Element of A have 2 options to form an image.
Thus, Total number of functions that can be formed = 2 × 2 × 2 × 2 × 2 = 32
Number of functions having only one image i.e., {x} = 1
Number of functions having only one image i.e., {y} = 1
Thus, Number of onto functions that can be formed = 32 − 1 − 1 = 30
​Hence, the total number of onto functions from the set A = {1, 2, 3, 4, 5} to the set B = {x, y} is 30.
Page No 2.77:
Question 4:
The domain of the real function is _________.
Answer:
Given:
To find the domain, we find the real values of x for which the function is defined.
Hence, the domain of the real function is [−4, 4].
Page No 2.77:
Question 5:
The domain of the real function is ___________.
Answer:
Given:
To find the domain, we find the real values of x for which the function is defined.
Hence, the domain of the real function is (−3, 3).
Page No 2.77:
Question 6:
The range of the function f : R → R given by is _________.
Answer:
Given:
To find the range, we find the real values of y obtained.
Hence, the range of the function f : R → R given by is .
Page No 2.77:
Question 7:
The range of the function f : R –{–2) → R given by is _________.
Answer:
Given:
To find the range, we find the real values of y obtained.
Hence, the range of the function f : R –{–2) → R given by is {–1, 1}.
Page No 2.77:
Question 8:
If f : C → C is defined by f(x) = 8x3, then f–1(8) = . _________.
Answer:
Given: f(x) = 8x3
Hence, if f : C → C is defined by f(x) = 8x3, then f−1(8) = .
Page No 2.77:
Question 9:
If f : R → R is defined by f(x) = 8x3 then, f–1(8) = _________.
Answer:
Given: f(x) = 8x3
Hence, if f : R → R is defined by f(x) = 8x3 then f−1(8) = 1.
Page No 2.78:
Question 10:
If f : R – {0} → R – {0} is defined as then f–1(x) = ___________.
Answer:
Given: A function f : R – {0} → R – {0} is defined as
Hence, if f : R – {0} → R – {0} is defined as then f−1(x) = .
Page No 2.78:
Question 11:
If f : R → R is defined by f(x) = 6 – (x – 9)3, then f–1(x) = ___________.
Answer:
Given: A function f : R → R is defined by f(x) = 6 – (x – 9)3
Hence, if f : R → R is defined by f(x) = 6 – (x – 9)3, then f−1(x) = .
Page No 2.78:
Question 12:
Let A = {1, 2, 3, 4} and f : A → A be given by f = {(1, 4), (2, 3), (3, 2), (4, 1)}. Then f–1 = ___________.
Answer:
Given: A function f : A → A be given by f = {(1, 4), (2, 3), (3, 2), (4, 1)}
Hence,
Page No 2.78:
Question 13:
If f : R → R be defined by f(x) = (2 – x5)1/5, then fof(x) = ___________.
Answer:
Given: f(x) = (2 – x5)1/5
Hence, if f : R → R be defined by f(x) = (2 – x5)1/5, then fof(x) = x.
Page No 2.78:
Question 14:
Let A = {1, 2, 3, 4, 5, ..., 10} and f : A → A be an invertible function. Then, ___________.
Answer:
Given: f : A → A is an invertible function, where A = {1, 2, 3, 4, 5, ..., 10}
Hence, 55.
Page No 2.78:
Question 15:
Let A = {1, 2, 3, 4, 5, 6) and B = (2, 4, 6, 8, 10, 12). If f : A → B is given by f(x) = 2x, then f–1 as set of ordered pairs, is ___________.
Answer:
Given: A function f : A → B defined as f(x) = 2x, where A = {1, 2, 3, 4, 5, 6} and B = {2, 4, 6, 8, 10, 12}
Hence, if f : A → B is given by f(x) = 2x, then f–1 as set of ordered pairs, is
Page No 2.78:
Question 16:
Let f = {(0, –1), (–1, 3), (2, 3), (3, 5)} be a function from Z to Z defined by f(x) = ax + b. Then, (a, b) = ___________.
Answer:
Given: f = {(0, –1), (–1, –3), (2, 3), (3, 5)} is a function from Z to Z defined by f(x) = ax + b
f = {(0, –1), (–1, –3), (2, 3), (3, 5)} defined by f(x) = ax + b
Hence, (a, b) = ​(2, ​–1).
Disclaimer: The function f must be equal to f = {(0, –1), (–1, –3), (2, 3), (3, 5)}.
Page No 2.78:
Question 17:
Let f : R → R and g : R → R be functions defined by f(x) = 5 – x2 and g(x) = 3x – 4. Then the value of fog (–1) is ___________.
Answer:
Given: f(x) = 5 – x2 and g(x) = 3x – 4
Hence, the value of fog (–1) is ​–44.
Page No 2.78:
Question 18:
Let f be the greatest integer function defined as f(x) = [x] and g be the modules function defined as g(x) = |x|, then the value of is ___________.
Answer:
Given: f(x) = [x] and g(x) = |x|
Hence, the value of is ​2.
Page No 2.78:
Question 19:
If f(x) = cos [e] x + cos [–e] x, then f(π) = ___________.
Answer:
Given: f(x) = cos[e]x + cos[–e]x
Hence, f(π) = ​0.
Page No 2.78:
Question 20:
Let A = {1, 2, 3} and B = {a, b} be two sets. Then the number of constant functions from A to B is ___________.
Answer:
Given: Sets A = {1, 2, 3} and B = {a, b}
Two constant functions can be formed from A to B.
i.e., one is f(x) = a and other is f(x) = b
Hence, the number of constant functions from A to B is 2.
Page No 2.78:
Question 21:
If f(x) = cos [π2] x + cos [–π2] x, then ______________.
Answer:
Given: f(x) = cos [π2] x + cos [–π2] x
Hence, ​–1.
Page No 2.78:
Question 22:
The number of onto functions from A = {a, b, c} to B = {1, 2, 3, 4} is __________.
Answer:
Given: A function from A = {a, b, c} to B = {1, 2, 3, 4}
If a function from A to B is onto, then number of elements of A ≥ number of elements of B.
But here, number of elements of A < number of elements of B
Thus, no onto function exist from A = {a, b, c} to B = {1, 2, 3, 4}.
Hence, the number of onto functions from A = {a, b, c} to B = {1, 2, 3, 4} is 0.
Page No 2.78:
Question 23:
If f(0, ∞) → R is given by f(x) = log10 x, then f–1(x) = ___________.
Answer:
Given: f(x) = log10x
Hence, f−1(x) = 10x.
Page No 2.78:
Question 24:
If f : R+ → R is defined as f(x) = log3 x, then f–1(x) = ______________.
Answer:
Given: f(x) = log3x
Hence, f−1(x) = 3x.
Page No 2.78:
Question 25:
If f : R → R, g : R → R are defined by f(x) = 5x – 3, g(x) = x2 + 3, then (gof–1) (3) = _______________.
Answer:
Given: f(x) = 5x – 3 and g(x) = x2 + 3
Hence, gof−1(3) = .
Page No 2.78:
Question 26:
If f : R → R is given by f(x) = 2x + |x|, then f(2x) + f(–x) + 4x = _______________.
Answer:
Given: f(x) = 2x + |x|
Hence, f(2x) + f(–x) + 4x = 3f(x).
Page No 2.78:
Question 27:
If then fof(cos 2θ) = ______________.
Answer:
Given:
Hence, fof(cos 2θ) = .
Page No 2.78:
Question 28:
Let then k = ______________.
Answer:
Given:
Hence, k = 2.
Page No 2.78:
Question 29:
If f (f(x)) = x + 1 for all x ∈ R and if then f(1) = ____________.
Answer:
Given: f (f(x)) = x + 1 for all x ∈ R and
Hence, f(1) = .
Page No 2.78:
Question 30:
If f(x) = 3x + 10 and g(x) = x2 –1, then (fog)–1 is equal to ___________.
Answer:
Given: f(x) = 3x + 10 and g(x) = x2 –1
Hence, (fog)–1 is equal to .
Page No 2.78:
Question 31:
Let f = {(1, 2), (3, 5), (4, 1)) and g = {(2, 3), (5, 1), (1, 3)}. Then, gof = __________ and fog = __________.
Answer:
Given: f = {(1, 2), (3, 5), (4, 1)) and g = {(2, 3), (5, 1), (1, 3)}
Hence, gof = and fog = .
Page No 2.79:
Question 1:
Which one of the following graphs represents a function?
Answer:
In graph (b), 0 has more than one image, whereas every value of x in graph (a) has a unique image.
Thus, graph (a) represents a function.
So, the answer is (a).
Page No 2.79:
Question 2:
Which of the following graphs represents a one-one function?
Answer:
Page No 2.79:
Question 3:
If A = {1, 2, 3} and B = {a, b}, write the total number of functions from A to B.
Answer:
Formula:
If set A has m elements and set B has n elements, then the number of functions from A to B is .
Given:
A = {1, 2, 3} and B = {a, b}
= 3 and = 2
Number of functions from A to B = 23 = 8
Page No 2.79:
Question 4:
If A = {a, b, c} and B = {−2, −1, 0, 1, 2}, write the total number of one-one functions from A to B.
Answer:
Let be a one-one function.
Then, the number of one-one functions = 5 4 3 = 60
Page No 2.79:
Question 5:
Write the total number of one-one functions from set A = {1, 2, 3, 4} to set B = {a, b, c}.
Answer:
A has 4 elements and B has 3 elements.
Also, one-one function is only possible from A to B if .
But, here .
So, the number of one-one functions from A to B is 0.
Page No 2.79:
Question 6:
If f : R → R is defined by f(x) = x2, write f−1 (25).
Answer:
Page No 2.79:
Question 7:
If f : C → C is defined by f(x) = x2, write f−1 (−4). Here, C denotes the set of all complex numbers.
Answer:
Page No 2.80:
Question 8:
If f : R → R is given by f(x) = x3, write f−1 (1).
Answer:
Page No 2.80:
Question 9:
Let C denote the set of all complex numbers. A function f : C → C is defined by f(x) = x3. Write f−1 (1).
Answer:
Page No 2.80:
Question 10:
Let f be a function from C (set of all complex numbers) to itself given by f(x) = x3. Write f−1 (−1).
Answer:
Page No 2.80:
Question 11:
If f : R → R be defined by f(x) = x4, write f−1 (1).
Answer:
Page No 2.80:
Question 12:
If f : C → C is defined by f(x) = x4, write f−1 (1).
Answer:
Page No 2.80:
Question 13:
If f : R → R is defined by f(x) = x2, find f−1 (−25).
Answer:
Page No 2.80:
Question 14:
If f : C → C is defined by f(x) = (x − 2)3, write f−1 (−1).
Answer:
Page No 2.80:
Question 15:
If f : R → R is defined by f(x) = 10 x − 7, then write f−1 (x).
Answer:
Page No 2.80:
Question 16:
Let be a function defined by f(x) = cos [x]. Write range (f).
Answer:
Page No 2.80:
Question 17:
If f : R → R defined by f(x) = 3x − 4 is invertible, then write f−1 (x).
Answer:
Page No 2.80:
Question 18:
If f : R → R, g : R → are given by f(x) = (x + 1)2 and g(x) = x2 + 1, then write the value of fog (−3).
Answer:
Page No 2.80:
Question 19:
Let A = {x ∈ R : −4 ≤ x ≤ 4 and x ≠ 0} and f : A → R be defined by . Write the range of f.
Answer:
Page No 2.80:
Question 20:
Let A be defined by f(x) = sin x. If f is a bijection, write set A.
Answer:
f is a bijection,
co-domain of f = range of f
As ,
So, A = [-1, 1]
Page No 2.80:
Question 21:
Let f : R → R+ be defined by f(x) = ax, a > 0 and a ≠ 1. Write f−1 (x).
Answer:
Page No 2.80:
Question 22:
Let f : R − {−1} → R − {1} be given by .
Answer:
Page No 2.80:
Question 23:
Let be a function defined as .
Write .
Answer:
Page No 2.80:
Question 24:
Let f : R → R, g : R → R be two functions defined by f(x) = x2 + x + 1 and g(x) = 1 − x2. Write fog (−2).
Answer:
Page No 2.80:
Question 25:
Let f : R → R be defined as
Answer:
Page No 2.80:
Question 26:
Let f be an invertible real function. Write
Answer:
Given that f is an invertible real function.
Page No 2.80:
Question 27:
Let A = {1, 2, 3, 4} and B = {a, b} be two sets. Write the total number of onto functions from A to B.
Answer:
Formula:
When two sets A and B have m and n elements respectively, then the number of onto functions from A to B is
Here, number of elements in A = 4 = m
Number of elements in B = 2 = n
So, m > n
Number of onto functions
Page No 2.80:
Question 28:
Write the domain of the real function
Answer:
[x] is the greatest integral function.
Page No 2.80:
Question 29:
Write the domain of the real function
Answer:
[x] is the greatest integer function.
Page No 2.80:
Question 30:
Write the domain of the real function
Answer:
Page No 2.80:
Question 31:
Write whether f : R → R, given by , is one-one, many-one, onto or into.
Answer:
Hence, f is may-one.
Page No 2.80:
Question 32:
If f(x) = x + 7 and g(x) = x − 7, x ∈ R, write fog (7).
Answer:
Page No 2.81:
Question 33:
What is the range of the function
Answer:
Page No 2.81:
Question 34:
If f : R → R be defined by f(x) = (3 − x3)1/3, then find fof (x).
Answer:
Page No 2.81:
Question 35:
If f : R → R is defined by f(x) = 3x + 2, find f (f (x)).
Answer:
Page No 2.81:
Question 36:
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. State whether f is one-one or not.
Answer:
f = {(1, 4), (2, 5), (3, 6)}
Here, different elements of the domain have different images in the co-domain.
So, f is one-one.
Page No 2.81:
Question 37:
If f : {5, 6} {2, 3} and g : {2, 3} {5, 6} are given by f = {(5, 2), (6, 3)} and g = {(2, 5), (3, 6)}, then find fog. [NCERT EXEMPLAR]
Answer:
We have,
f : {5, 6} {2, 3} and g : {2, 3} {5, 6} are given by f = {(5, 2), (6, 3)} and g = {(2, 5), (3, 6)}
As,
fog(2) = f(g(2)) = f(5) = 2,
fog(3) = f(g(3)) = f(6) = 3,
So,
fog : {2, 3} {2, 3} is defined as
fog = {(2, 2), (3, 3)}
Page No 2.81:
Question 38:
Let f : R R be the function defined by f(x) = 4x 3 for all x R. Then write f 1. [NCERT EXEMPLAR]
Answer:
We have,
f : R R is the function defined by f(x) = 4x 3 for all x R
Page No 2.81:
Question 39:
Which one the following relations on A = {1, 2, 3} is a function?
f = {(1, 3), (2, 3), (3, 2)}, g = {(1, 2), (1, 3), (3, 1)} [NCERT EXEMPLAR]
Answer:
As, each element of the domain set has unique image in the relation f = {(1, 3), (2, 3), (3, 2)}
So, f is a function.
Also, the element 1 of the domain set has two images 2 and 3 of the range set in the relation g = {(1, 2), (1, 3), (3, 1)}
So, g is not a function.
Page No 2.81:
Question 40:
Write the domain of the real function f defined by f(x) = . [NCERT EXEMPLAR]
Answer:
Page No 2.81:
Question 41:
Let A = {a, b, c, d} and f : A A be given by f = {(a, b), (b, d), (c, a), (d, c)}. Write f 1. [NCERT EXEMPLAR]
Answer:
We have,
A = {a, b, c, d} and f : A A be given by f = {(a, b), (b, d), (c, a), (d, c)}
Since, the elements of a function when interchanged gives inverse function.
So, f 1 = {(b, a), (d, b), (a, c), (c, d)}
Page No 2.81:
Question 42:
Let f, g : R R be defined by f(x) = 2x + l and g(x) = x2 2 for all x R, respectively. Then, find gof. [NCERT EXEMPLAR]
Answer:
We have,
f, g : R R are defined by f(x) = 2x + l and g(x) = x2 2 for all x R, respectively
Page No 2.81:
Question 43:
If the mapping f : {1, 3, 4} {1, 2, 5} and g : {1, 2, 5} {1, 3}, given by f = {(1, 2), (3, 5), (4, 1)} and g = {(2, 3), (5, 1), (1, 3)}, then write fog. [NCERT EXEMPLAR]
Answer:
We have,
f : {1, 3, 4} {1, 2, 5} and g : {1, 2, 5} {1, 3}, are given by f = {(1, 2), (3, 5), (4, 1)} and g = {(2, 3), (5, 1), (1, 3)}, respectively
As,
Page No 2.81:
Question 44:
If a function g = {(1, 1), (2, 3), (3, 5), (4, 7)} is described by g(x) = , then find the values of and . [NCERT EXEMPLAR]
Answer:
We have,
A function g = {(1, 1), (2, 3), (3, 5), (4, 7)} is described by g(x) =
Page No 2.81:
Question 45:
If f(x) = 4 (x 7)3, then write f 1(x). [NCERT EXEMPLAR]
Answer:
View NCERT Solutions for all chapters of Class 12