ROTATIONS AND FUNCTIONS
Class-12 Rotations and Functions
Practice Question & worksheet for chapter 1
1. If R be a relation “less than” from A = {1, 2, 3, 4} to B = {1, 3, 5}, i.e.
(a,b) ÎR if a<b, then RoR–1 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)}
Ans. (c)
R Ì A × B under given condition a < b is given by
R = {(1, 3), (1,5), (2,3) (2,5), (3,5) (4,5)}
R–1 = {(3,1), (5, 1), (3,2), (5,2), (5, 3), (5,4)}
RoR–1 = {(3, 3), (3, 5), (5,3), (5, 5)}.
2. Two points A and B in a plane are related if OA = OB, where O is fixed point. This
relation is
(a) Partial order relation (b) equivalence relation
(c) Reflexive but not symmetric (d) reflexive but not transitive
Ans. (b) Obviously, the relation is reflexive
Because for any point A, OA = OA.
Also for any two points A and B in the plane
OA = OB fi OB = OA. Therefore the relation is a symmetric relation.
Also for any three points A, B and C in the plane
OA = OB and OB = OC fi OA = OC
\the relation is transitive relation
\the relation is equivalence relation.
3. For real number x any y, we write xRy € x - y + 2 is an irrational number. Then the
relation R is
(a) Reflexive (b) symmetric (c) Transitive (d) none
Ans. (a) We have " x ŒR, x - x + 2 = 2 , an irrational number.
hence xRx " x, i.e., R is reflexive.
R cannot be symmetric, for if x = 2, y = 1 then
x - y + 2 = 2 2 - 1, an irrational number, i.e., xRy
But y - x + 2 = 1- 2 + 2 = 1 a rational number.
Thus xRy fi/ yRx
Similarly, we may show that R is not transitive.
4. Let R = {(2, 3), (3, 4)} be a relation defined on the set A = {1, 2, 3, 4}. The minimum
number of ordered pairs required to be added in R so that the enlarged relation
becomes an equivalence relation is
(a) 3 (b) 5 (c) 7 (d) 8
Ans. (d) Given R = {(2,3), (3,4)} ...(i)
To make it reflexive, we enlarge R as following
R = {1, 1), (2, 2), (3, 3), (4, 4), (2, 3), (3,4) ...(ii)
Hence 4 ordered pairs added.
To make it symmetric, we enlarge (ii) to
{(1,1), (2,2), (3,3), (4,4), (2,3) (3,2), (3,4) (4,3)} ...(iii)
Hence two more ordered pairs added.
Finally to make it transitive, we enlarge (iii) to
{(1,1), (2,2), (3,3), (4,4), (2,3) (3,2), (3,4) (4,3), (2,4), (4,2)}
Hence, two more ordered pairs added.
\Total 8 ordered pairs must be added to make the relation R an equivalence relation.
5. In the set N ¥ N, the relation R is defined by (a, b) R (c,d) € ad = bc. Then R is
(a) partial order relation
(b) equivalence relation
(c) reflexive and transitive but not symmetric
(d) symmetric and transitive but not reflexive
Ans. (b) The relation is defined on N ¥ N, . since the elements of N ¥ N, are ordered pairs
hence the relation on relates two ordered pairs. Now,
(i) " a, b ŒN ab = ba
\ (a, b) R(a, b) " (a, b) ŒN¥ N. Thus R is reflexive
(ii) Let (a, b) R (c,d) € ad = bc " (a, b) and (c, d) ŒN¥ N
fi bc = ad fi cb = da fi (c,d) R (a, b) .
Thus R is symmetric
(iii) Again let (a,b) R (c,d) and (c,d) R (e,f)
fi ad = bc and cf = de
fi adcf = bcde fi af = de fi (a, b) R(e,f )
Thus R is transitive.
Thus R is equivalence relation.
6. The relation R defined the set A={1, 2, 3, 4, 5} by R = {(x, y) : x 2 – y2 < 16}, then
(a) R = {(1, 1), (2, 1), (3, 1), (4, 1), (2, 3)}
(b)R = {(2, 2), (3, 2), (4, 2), (2, 4)}
(c) R = {(3, 3), (4, 3), (5, 4), (3, 4)}
(d)None of these
2
Ans. (d) The relation of the option (a) does not contain ordered pairs (4, 5), (5, 4) similarly
others can be checked.
7. If f(x) = 3x – 5, then f–1(x)
1
(a) is given by
3x - 5
x+ 5
(b) is given by
3
(c) does not exist because f is not one-one
(d) does not exist because f is not onto.
Ans. (b) f(x) = 3x – 5 (given)
y+ 5
Let y = f ( x) = 3x – 5 fi y + 5 = 3x fi x = ...(1)
3
and y = f (x) fi x = f–1 (y) ...(2)
From (1) and (2)
y+ 5 x+ 5
f '(y) = fi f - 1 (x) =
3 3
8. If R = { (x, y ) : x, y Œ I and x 2 + y2 £ 4} is a relation in I, the domain of R is
(a) {0, 1, 2} (b) {– 2, – 1, 0}
(c) {– 2, – 1, 0, 1, 2} (d) I
Ans. (c) x 2 + y2 £ 4, represents all points interior to the circle x 2 + y2 = 4, hence - 2 £ x £ 2
and - 2 £ y £ 2
\integral values of x are –2, –1, 0, 1, 2
9. If f : R Æ R be a function defined by f (x) = 4x3 –7. Then
(a) f is one-one -into (b)f is many-one – into
(c) f is many-one onto (d)f is bijective
3
Ans. (d) We have f (x) = 4x - 7, x ŒR.
f is one-one. Let x1, x2 ÎR and f (x1) = f(x2).
fi 4x13 - 7 = 4x 23 - 7 fi 4x13 = 4x 23
fi x13 = x 23 fi x13 - x 23 = 0.
fi (x1 - x 2 ) (x12 + x1x 2 + x 22 ) = 0.
ÈÊ x ˆ
2
3x 2 ˘
fi (x1 - x 2 ) ÍÍÁ
Áx1 + 2 ˜˜˜ + 2 ˙˙ = 0.
ÍÎÁ
Ë 2¯ 4 ˙
˚
Þ x1 – x2 = 0, because the other factor is non-zero.
Þ x1 = x2
Þ f is one-one.
f is onto. Let k ÎR any real number.
1/ 3
Êk + 7 ˆ˜
f (x) = k fi 4x 3 - 7 = k fi x = Á
Á ˜
Ë 4 ¯˜
Á
3
1/ 3
Ê ˆ
Ák + 7 ˜˜
Now Á ŒR, because k ŒR and
Ë 4 ¯˜
Á
ÈÊk + 7 ˆ1/ 3 ˘ ÈÊk + 7 ˆ1/ 3 ˘3 Êk + 7 ˜ˆ
Í
f ÍÁ ˜
˜ ˙ = 4 ÍÍÁ ˜˜ ˙ – 7 = 4 Á ˜- 7 = k
Á ˜ ˙ Á ˜ ˙ Á
ÍÎÁ
Ë 4 ¯ ˙ Í Á 4 ¯ ˙
Ë Ë 4 ˜¯
Á
˚ Î ˚
Êk + 7 ˆ˜1/ 3
\ k is the image of Á Á ˜
Ë 4 ¯˜
Á
\ f is onto.
\ f is a bijective function.
10. Let R = {(1, 3),(4, 2),(2, 4),(2, 3),(3,1)} be a relation on the set A = {1, 2, 3, 4}. . The relation R
is
(a) Reflexive (b) transitive
(c) Not symmetric (d) a function
Ans. (c) (2,3) Œ R but (3, 2) œ R
\ R is not symmetric
11. If f : R Æ R and g : R Æ R defined by f(x) = 2x + 3 and g(x ) = x 2 + 7, then the value of
x for which f(g(x)) = 25
(a) ± 1 (b) ± 2 (c) ± 3 (d) ± 4
2 2
11. (b) f (g(x)) = f (x + 7) = 2(x + 7) + 3 = 25
fi 2x 2 = 8 fi x = ± 2
12. If R1 = {(1, 1), (2, 2), (1, 2), (2, 1), (3, 3)} and R 2 = {(1, 1), (2, 2), (2, 3), (3, 2), (3, 3)}are
two relation in the set S = {1, 2, 3}, the incorrect statement is :
(a) R1 and R 2 both are equivalence relations in S.
(b) R1 « R 2 is an equivalence relation in S.
(c) R1 » R 2 is an equivalence relation in S.
(d) R1–1 « R 2–1 is an equivalence relation S.
Ans. (c)
R1 » R 2 = {(1,1),(2,2),(1,2),(2,1),(3,3),(2,3),(3,2)}
"( x, y ) Î R1 È R2
( y, x) Î R1 È R2
R1 » R 2 is equivalence relation in S
13. Total number of equivalence relations defined in the set S = {a, b, c } is :
(a) 5 (b) 3! (c) 23 (d) 33
Ans. (a) The smallest equivalence relation is the identity relation
R1 = {(a, a), (b, b), (c, c)}
Then two ordered pairs of two distinct elements can be added to give three more
equivalence relations
R2 = {(a, a), (b, b), (c, c), (a, b), (b, a)}
4
Similarly R3 and R4. Finally the largest equivalence relation i.e., the universal relation
R5 = { (a, a), (b, b), (c, c), (a, b), (b, a), (a, c), (c, a), (b, c), (c, b)}
14. Let f (z) = sinz and g(z) = cosz. If * denotes a composition of functions, then the value
of (f + ig) * (f – ig) is :
–iz –iz –iz
(a) i e – e (b) i e e (c) – i e – e (d) None of these
Ans. (b) (f - ig)(z) = f (z) - ig(z) = sin z - i cos z
= – i(cos z + isin z) = – i eiz = q (say)
Now (f + ig)*(f - ig)(z) = (f + ig)(f - ig)(z)
= (f + ig)(q) = f (q) + ig(q) = sin q+ i cos q= i(cos q- isin q)
iz iz
= ie- iq = ie- i(- ie ) = ie- e
15. In the group (Z, *) of all integers, where a * b = a + b + 1 for a, b ŒZ, the inverse of – 2
is :
(a) – 2 (b) 0 (c) – 4 (d) 2
Ans. (b) Given a * b = a + b + 1
Clearly the identity element is –1
as (- 1)*b = b and a *(- 1) = a
Let a is the inverse of (–2), then
a *(- 2) = - 1
a - 2+ 1= - 1fi a = 0
16. Let A and B be two sets with a finite number of elements. Assume that there is injective
mapping from A to B and there is an injective mapping from B to A. Then
(a) there is a subjective mapping from B to A
(b) there is an identity mapping from A to B
(c) there is a bijective mapping from A to B
(d) none of these.
Ans. (c) Let f be an injective mapping from A to B. Since f is one-one, number of elements
in A is less than or equal to the number of elements in B, that is n (A) £ n (B). Similarly
since there exists an injective mapping g : B ® A, we have n (B) £ n (A)
Hence, n (A) = n (B).
Since the number or elements in A and B is the same, we can define a bijective
mapping from A to B.
For if A = {a1, a2, ....., an} and B = {b1, b2, ....., bn}then one such bijective
mapping is
h = {(a1,b1), (a2, b2),.........(an, bn)}
17. Let f be a function on R or R given by f (x) = x2 and let E = {x ŒR:- 1 £ x £ 0}and
F = {x ŒR :0 £ x £ 1}then which of the following is false?
(a) f (E) = f (F) (b) E Ç F Ì f(E) Ç f(F)
5
(c) E È F Ì f(E) È f(F) (d) f (E Ç F) = {0}
17. (c) We have –1 £ x £ 0 Þ0 £ x2 £1 ...(i)
and 0 £ x £ 1 Þ0 £x2 £1 ...(ii)
\ E = {x ŒR :–1 £ x £ 0}
fi f (E) = {x ŒR : 0 £ x £ 1} from(i)
Also F= {x ŒR : 0 £ x £ 1}
fi f (F) = {x ŒR : 0 £ x £ 1} from(ii)
Hence, f (E) = f (F)
Again E Ç F = {0} f (E) Ç f (F)
[Since f (E) = f (F)
\f(E) Ç f(F) = f(E) = f(F)]
Also E Ç F = {0} Þ f (E Ç F) = {0}
Next, E È F = {x ŒR : –1 £ x £ 1}
and f (E) È f (F) = {x ŒR : 0 £ x £ 1}
\ E » F Ã/ f (E) » f (F)
18. Let f (x) = ax + b , then fof (x) = x, provided that :
cx + d
(a) d = – a (b) d = a
(c) a = b = 1 (d) a = b = c = d = 1
ax + b
18. (a) f (x) =
cx + d
ÏÔax + b ¸Ô
aÌ ˝+ b
Ô
Ôcx + dÔ ˛Ô a 2 x + ab + bcx + bd
fof (x) = Ó fi = x
ÏÔax + b ¸Ô acx + bc + cdx + d 2
cÌ ˝+d
Ô
Ócx +
Ô dÔ Ô
˛
6
fi (ac + dc)x 2 + (bc + d 2 - bc - a 2 )x – ab – bd = 0, " x ŒR
fi (a + d)c = 0, d 2 - a 2 = 0and (a + d)b =0 fi a + d = 0
19. If f(x) = ax + b and g(x) = cx + d, then f[g(x)] – g[f(x)] is equivalent to
(a) f(a) – g(c) (b) f(c) + g(a) (c) f(b) – g(b) (d) f(d) – g(b)
19. (d) f(g(x)–g(f(x)) = a(cx + d) + b – {c(ax + b) + d}
= ad + b – bc – d = (ad + b) – (bc + d) = f(d) – g(b)
20. If f : R ® R, g : R ® R and h : R ® R is such that f(x) = x2, g(x) = tan x and h(x) = log x, then
p
the value of [ho(gof)], if x = will be
2
(a) 0 (b) 1 (c) – 1 (d) 10
20. (a) [ho(gof)](x) = (hof)(f(x))
= (hog)(x2) = (hof) (p / 4) = h(g(p / 4))
= h(tan p / 4) = h(1) = log1 = 0
21. Check the injectivity and surjectivity of the following functions:
(i) f : N → N given by f (x) = x2
(ii) f : Z → Z given by f (x) = x2
(iii) f : R → R given by f (x) = x2
(iv) f : N → N given by f (x) = x3
(v) f : Z → Z given by f (x) = x3
21. (i) It is given that f : N → N given by f (x) = x2
We can see that for x,y ϵ N,
f(x) = f(y)
x2 = y2
7
x=y
f is injective.
Now, let 2 ϵ N. But, we can see that there does not exists any x in N such that
f(x) = x2 = 2
ð f is not surjective.
Therefore, function f is injective but not surjective.
22. Prove that the Greatest Integer Function f : R → R, given by f (x) = [x], is neither one-one
nor onto, where [x] denotes the greatest integer less than or equal to x.
22. It is given f : R → R, given by f (x) = [x]
We can see that f(1.2) =[1.2] =1
f(1.9) = [1.9] =1
ð f(1.2) = f(1.9), but 1.2 ≠ 1.9.
ð f is not one- one.
Now, let us consider 0.6 ϵ R.
We know that f(x) =[x] is always an integer.
ð there does not exist any element x ϵ R such that f(x) = 0.6
ð f is not onto.
Therefore, the greatest integer function is neither one-one nor onto.
23. Show that the Modulus Function f : R → R, given by f (x) = | x|, is neither oneone nor
onto, where | x | is x, if x is positive or 0 and |x | is – x, if x is negative.
23. It is given that f : R → R, given by f (x) = | x|
We can see that f(-1) = |-1| = 1, f(1) =|1| =1
8
ð f(-1) = f(1), but -1 ≠ 1.
ð f is not one-one.
Now, we consider -1 ϵ R.
We know that f(x) = |x| is always negative.
Therefore, there exist any element x in domain R such that f(x) = |x| =-1
ð f is not onto.
Therefore, modulus function is neither one-one nor onto.
24. If f : R → R is defined by f(x) = x2 – 3x + 2, find f (f (x)).
24. It is given that f : R → R is defined by f(x) = x2 – 3x + 2.
f(f(x)) = f (x2 – 3x + 2)
= (x2 – 3x + 2)2 - 3(x2 – 3x + 2) + 2
= x4 + 9x2 + 4 – 6x3 -12x + 4x2 – 3x2 + 9x – 6 + 2
= x4 - 6x3 + 10x2 - 3x
25. Show that the function f : R → R given by f (x) = x3 is injective.
25. Let f : R → R given by f (x) = x3.
Suppose f(x) = f(y), where x,y ϵ R.
ð x3 = y3……………..(1)
Now, we need to show that x = y.
Suppose x ≠ y, their cubes will also not be equal.
ð x3 ≠ y3
However, this will be contraction to (1).
Thus, x = y
9
Therefore, f is injective.
10
