CBSE
Class–12 Mathematics
NCERT Exemplar
Chapter - 1
Relations and Functions
Solved Examples
Short Answer Questions
1. Let A = {0, 1, 2, 3} and define a relation R on A as follows:
R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}.
Is R reflexive? symmetric? transitive?
Sol. R is reflexive and symmetric, but not transitive since for (1, 0) ∈ R and (0, 3) ∈ R
whereas (1, 3) ∉ R.
2. For the set A = {1, 2, 3}, define a relation R in the set A as follows:
R = {(1, 1), (2, 2), (3, 3), (1, 3)}.
Write the ordered pairs to be added to R to make it the smallest equivalence relation.
Sol. (3, 1) is the single ordered pair which needs to be added to R to make it the smallest
equivalence relation.
3. Let R be the equivalence relation in the set Z of integers given by R = {(a, b) : 2 divides
a– b}. Write the equivalence class [0].
4. Let the function R → R be defined by Then, show that
is one-one.
Sol. [0] = {0, ± 2, ± 4, ± 6, ...}
Sol. For any two elements ∈ R such that , we have
Hence is one-one.
5. If = {(5, 2), (6, 3)}, = {(2, 5), (3, 6)}, write o .
Sol. o = {(2, 2), (3, 3)}
6. Let R → R be the function defined by Then write
Sol. Given that then
Hence
7. Is the binary operation * defined on Z (set of integer) by
commutative?
Sol. No. Since for while
so that 1*2 ≠2 *1.
8. If = {(5, 2), (6, 3)} and = {(2, 5), (3, 6)}, write the range of and .
Sol. The range of = {2, 3} and the range of = {5, 6}.
9. If A = {1, 2, 3} and , are relations corresponding to the subset of indicated
against them, which of , is a function? Why?
= {(1, 3), (2, 3), (3, 2)}
= {(1, 2), (1, 3), (3, 1)}
Sol. is a function since each element of A in the first place in the ordered pairs is related
to only one element of A in the second place while g is not a function because 1 is related to
more than one element of A, namely, 2 and 3.
10. If A = {a, b, c, d} and = {a, b), (b, d), (c, a), (d, c)}, show that is one-one from A
onto A. Find
Sol. is one-one since each element of A is assigned to distinct element of the set A. Also,
is onto since (A) = A. Moreover, = {(b, a), (d, b), (a, c), (c, d)}.
11. In the set N of natural numbers, define the binary operation *by
. Is the operation * commutative and associative?
Sol. The operation is clearly commutative since
m*n= g.c.d (m, n) = g.c.d(n, m) = n * m m, n N.
It is also associative because for l, m, n N, we have
l *(m*n) = g. c. d (l, g.c.d (m, n))
= g.c.d. (g. c. d(l, m), n)
= (l*m) *n.
Long Answer Questions
12. In the set of natural numbers N, define a relation R as follows:
n, m N, nRm if on division by 5 each of the integers n and m leaves the remainder
less than 5, i.e. one of the numbers 0, 1, 2, 3 and 4. Show that R is equivalence relation.
Also, obtain the pairwise disjoint subsets determined by R.
Sol. R is reflexive since for each a N, aRa. R is symmetric since if aRb, then bRa for a, b
N. Also, R is transitive since for a, b, c N, if aRb and bRc, then aRc.
Hence R is an equivalence relation in N which will partition the set N into the pairwise
disjoint subsets. The equivalent classes are as mentioned below:
A0= {5, 10, 15, 20 ...}
A1= {1, 6, 11, 16, 21 ...}
A2= {2, 7, 12, 17, 22, ...}
A3= {3, 8, 13, 18, 23, ...}
A4= {4, 9, 14, 19, 24, ...}
It is evident that the above five sets are pairwise disjoint and
13. Show that the function R → R defined by , is neither one-
one nor onto.
Sol. For x1, x2 R, consider
(x1) = (x2)
We note that there are point, with and for instance, if
we take and then we have and but . Hence
is not one-one. Also, is not onto for if so then for such that (x) = 1 which
gives . But there is no such x in the domain R, since the equation
does not give any real value of x.
14. Let , : R → R be two functions defined as and
x R. Then, find and .
Sol. Here which can be redefined as
Similarly, the function defined by may be redefined as
Therefore, gets defined as:
For x ≥0, ( ) (x) = ( (x) = (2x) = 0
and for x <0, ( ) (x) = ( (x) = (0) = 0.
Consequently, we have ( ) (x) = 0, x R.
Similarly, gets defined as:
For x ≥0, ( ) (x) = ( (x) = (0) = 0,
and for x <0, ( ) (x) = ( (x)) = (–2 x) = – 4x.
i.e.
15. Let R be the set of real numbers and be the function defined by (x) =
4x+ 5. Show that is invertible and find .
Sol. Here the function is defined as (say). Then
or
This leads to a function defined as
Therefore, =
Similarly, ( ) (y) = ( (y))
or .
Hence is invertible and which is given by
16. Let * be a binary operation defined on Q. Find which of the following binary
operations are associative.
(i) a *b= a– b for a, b Q.
(ii)
(iii) a *b= a– b+ ab for a, b Q.
(iv) for a, b Q.
Sol. (i) * is not associative for if we take a= 1, b= 2 and c= 3, then
(a*b) *c= (1 *2) * 3 = (1 – 2) * 3 = – 1 – 3 = – 4 and
a *(b*c) = 1 *(2 *3) = 1 *(2 – 3) = 1 – (– 1) = 2.
Thus (a*b) *c ≠ a*(b*c) and hence * is not associative.
(ii) * is associative since Q is associative with respect to multiplication.
(iii) * is not associative for if we take a= 2, b= 3 and c = 4, then
(a*b) *c= (2 *3) * 4 = (2 – 3 + 6) *4 = 5*4 = 5 – 4 + 20 = 21, and
a*(b*c) = 2 *(3*4) = 2*(3 – 4 + 12) = 2 *11 = 2 – 11 + 22 = 13
Thus (a*b) * c ≠ a*(b*c) and hence * is not associative.
(iv) * is not associative for if we take a= 1, b= 2 and c= 3, then (a*b) * c=(1 * 2) * 3 = 4 * 3 = 4 × 9
= 36 and a*(b*c) = 1 * (2 * 3) = 1*18 =
Thus (a * b) * c ≠ a * (b * c) and hence*is not associative.
Objective Questions
Choose the correct answer from the given four options in each of the Examples 17 to 25.
17. Let R be a relation on the set N of natural numbers defined by nRm if n divides m.
Then R is
(A) Reflexive and symmetric
(B) Transitive and symmetric
(C) Equivalence
(D) Reflexive, transitive but not symmetric
Sol. The correct choice is (D).
Since n divides n, n N, R is reflexive. R is not symmetric since for 3, 6 N, 3 R 6 ≠6 R 3. R
is transitive since for n, m, r whenever n/m and m/r ⇒ n/r, i.e., n divides m and m divides r,
then n will divide r.
18. Let L denote the set of all straight lines in a plane. Let a relation R be defined by lRm
if and only if l is perpendicular to m l, m L. Then R is
(A) reflexive
(B) symmetric
(C) transitive
(D) none of these
Sol. The correct choice is (B).
19. Let N be the set of natural numbers and the function : N → N be defined by (n) =
2n+ 3 n N. Then is
(A) surjective
(B) injective
(C) bijective
(D) none of these
Sol. (B) is the correct option.
20. Set A has 3 elements and the set B has 4 elements. Then the number of injective
mappings that can be defined from A to B is
(A) 144
(B) 12
(C) 24
(D) 64
Sol. The correct choice is (C). The total number of injective mappings from the set containing
3 elements into the set containing 4 elements is
21. Let : R → R be defined by (x) = sin x and : R → R be defined by ,
then is
(A)
(B) (sin x)2
(C)
(D)
Sol. (C) is the correct choice.
–1(x) is given by
22. Let : R → R be defined by . Then
(A)
(B)
(C)
(D) None of these
Sol. (A) is the correct choice.
23. Let : R → R be defined by (x) = x2 + 1. Then, pre-images of 17 and – 3,
respectively, are
(A)
(B)
(C)
(D) {4, – 4, {2, – 2}
Sol. (C) is the correct choice since for or ⇒
x= ± 4 or f –1( 17) = {4, – 4} and for
and hence .
24. For real numbers x and y, define xRy if and only if is an irrational
number. Then the relation R is
(A) reflexive
(B) symmetric
(C) transitive
(D) none of these
Sol. (A) is the correct choice.
Fill in the blanks in each of the Examples 25 to 30.
25. Consider the set A = {1, 2, 3} and R be the smallest equivalence relation on A, then R
= ________
Sol. R = {(1, 1), (2, 2), (3, 3)}.
26. The domain of the function : R → R defined by is
________.
Sol. Here x2– 3x+ 2 ≥0
⇒ (x– 1) (x– 2) ≥0
⇒ x≤1 or x ≥2
Hence the domain of
27. Consider the set A containing n elements. Then, the total number of injective
functions from A onto itself is ________.
Sol. n!
28. Let Z be the set of integers and R be the relation defined in Z such that aRb if a– b is
divisible by 3. Then R partitions the set Z into ________ pairwise disjoint subsets.
Sol. Three.
29. Let R be the set of real numbers and *be the binary operation defined on R as a * b=
a + b– ab a, b R. Then, the identity element with respect to the binary operation * is
_______.
Sol. 0 is the identity element with respect to the binary operation *.
State True or False for the statements in each of the Examples 30 to 34.
30. Consider the set A = {1, 2, 3} and the relation R = {(1, 2), (1, 3)}. R is a transitive
relation.
Sol. True.
31. Let A be a finite set. Then, each injective function from A into itself is not surjective.
Sol. False.
32. For sets A, B and C, let : A →B, : B →C be functions such that is injective.
Then both and are injective functions.
Sol. False.
33. For sets A, B and C, let : A →B, : B →C be functions such that is surjective.
Then is surjective.
Sol. True.
34. Let N be the set of natural numbers. Then, the binary operation * in N defined as
has identity element.
Sol. False.
Exercise
Short Answer Questions
1. Let A = {a, b, c} and the relation R be defined on A as follows:
R = {(a, a), (b, c), (a, b)}.
Then, write minimum number of ordered pairs to be added in R to make R reflexive
and transitive.
Sol. Given relation, R = {(a, a), (b, c), (a, b)}.
To make R reflexive we must add (b, b) and (c, c) to R. Also, to make R transitive we must
add (a, c) to R.
So, minimum number of ordered pairs to be added is 3.
2. Let D be the domain of the real valued function defined by
Then, write D.
Sol.
3. Let , : R → R be defined by and respectively.
Then, find .
Sol. Given that, and , x R
Then (gof)x=g{f(x)}=g(2x+1)=(2x+1)2 -2
–1.
4. Let : R → R be the function defined by write
5. If and the function , write
6. If : R → R is defined by write
Sol. Given that
=
7. Is a function? If is described by
, then what value should be assigned to and .
8. Are the following set of ordered pairs functions? If so, examine whether the mapping
is injective or surjective.
(i) .
(ii)
Sol. (i) Given set of ordered pair is
It represents a function. Here, the image of distinct elements of under are not distinct,
so it is not injective but it is surjective.
(ii) Set of ordered pairs =
Here, each element of domain does not have a unique image. So, it does not represent
function.
9. If the mappings and are given by and
write .
Sol. Given that,
And
10. Let C be the set of complex numbers. Prove that the mapping : C → R given by
, is neither one-one nor onto.
Sol. The mapping
Given,
So, is not one-one. Also, is not onto as there is no pre-image for any negative
element of R under the mapping .
11. Let the function be defined by . Show that is
neither one-one nor onto.
Sol. Given function,
Now,
But
So, (x) is not one-one
Now, is not onto as there is no pre-image for any real number.
Which does not belong to the intervals [-1, 1], the range of cos x.
12. Let X = {1, 2, 3}and Y = {4, 5}. Find whether the following subsets of are
functions from X to Y or not.
(i) f = {(1, 4), (1, 5), (2, 4), (3, 5)}
(ii) g = {(1, 4), (2, 4), (3, 4)}
(iii) h = {(1,4), (2, 5), (3, 5)}
(iv) k = {(1,4), (2, 5)}.
Sol. Given that
X = {1, 2, 3} and Y = {4, 5}.
(i) f = {(1, 4), (1, 5), (2, 4), (3, 5)}
f is not a function because f has not unique image.
(ii) g = {(1, 4), (2, 4), (3, 4)}
g is a function as each element of the domain has unique image.
(iii) h = {(1,4), (2, 5), (3, 5)}
It is clear that h is a function.
(iv) k = {(1,4), (2, 5)}.
k is not a function as 3 has does not have any image under the mapping.
13. If functions satisfy , then show that f is one-
one and g is onto.
Sol. Given that, satisfy ,
Hence, is one-one and g is onto.
14. Let : R → R be the function defined by . Then, find the
range of .
Sol. Given function,
Let
So, Range of y, that is f(x) is
15. Let n be a fixed positive integer. Define a relation R in Z as follows aRb
if and only if a– b is divisible by n. Show that R is an equivalence relation.
Sol. Given that, aRb if and only a-b is divisible by n
Now
I. Reflexive
is divisible by n, which is true for any integer 'a' as ‘0’ is divisible by n.
Hence, R is reflexive.
II. Symmetric
Hence, R is symmetric.
III. Transitive
Let aRb and bRc
(a-b) is divisible by n and (b-c) is divisible by n
(a-b) +(b-c) is divisible by n
(a-c) is divisible by n
aRc
Hence, R is transitive.
So, R is an equivalence relation.
Objective Questions
28. Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be
defined as aRb if a is congruent to Then R is
(A) reflexive but not transitive
(B) transitive but not symmetric
(C) equivalence
(D) none of these
Sol. (C) Consider that aRb, if a is congruent to b,
Then,
Which is true for all
So, R is reflexive, ....(i)
Let
So, R is symmetric. ...(ii)
Let aRb and bRc
So, R is transitive. .....(iii)
Hence, R is equivalence relation.
29. Consider the non-empty set consisting of children in a family and a relation R
defined as aRb if a is brother of b. Then R is
(A) symmetric but not transitive
(B) transitive but not symmetric
(C) neither symmetric nor transitive
(D) both symmetric and transitive
Sol. (b)
Given,
a is brother of a, which is not true.
So, R is not reflexive.
This does not mean b is also a brother of a as b can be a sister of a.
Hence, R is not symmetric
And
So, a is brother of c.
Hence, R is transitive.
30. The maximum number of equivalence relations on the set A = {1, 2, 3} are
(A) 1
(B) 2
(C) 3
(D) 5
Sol. (d)
Given that, A = {1,2,3}
Now, number of equivalence relations are as follows:
Maximum number of equivalence relation on the set
31. If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, then R is
(A) reflexive
(B) transitive
(C) symmetric
(D) none of these
Sol. (b)
R on the set {1, 2, 3} be defined by
It is clear that R is transitive.
32. Let us define a relation R in R as aRb if a ≥ b. Then R is
(A) an equivalence relation
(B) reflexive, transitive but not symmetric
(C) symmetric, transitive but
(D) neither transitive nor reflexive but symmetric.
Sol. (b)
Given that,
But
Hence, R is transitive.
33. Let A = {1, 2, 3} and consider the relation R = {1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1,3)}.
Then R is
(A) reflexive but not symmetric
(B) reflexive but not transitive
(C) symmetric and transitive
(D) neither symmetric, nor transitive
Sol. (a) Given that A = {1, 2, 3}
And R = {1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1,3)}.
Hence, R is reflexive.
Hence, R is not symmetric.
Hence, R is transitive.
34. The identity element for the binary operation * defined on Q - {0}
(A) 1
(B) 0
(C) 2
(D) none of these
Sol. (c)
Given that,
Let e be the identity element for *
35. 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
Sol. (c) We know that, if A and B are two non-empty finite set containing m and n elements
respectively, then the number of one-one and onto mapping from A to B is
Given that, m=5 and n=6
Number of mapping=0
36. Let A = {1, 2, 3, ...n} and B = {a, b}. Then the number of surjections from A into B is
(A)
(B)
(C)
(D) None of these
Sol. (A)
Given that A = {1, 2, 3, ...n} and B = {a, b}
We know that, if A and B are two non-empty finite sets containing m and n elements
respectively, then the number of surjection from A into B is
Here, m=2
37. Let : R → R be defined by Then f is
(A) one-one
(B) onto
(C) bijective
(D) is not defined
Sol. (D)
Given that,
For x=0, is not defined.
Hence, is a not defined function.
38. Let : R → R be defined by and : R → R by Then
is
(A)
(B)
(C)
(D)
Sol. (A)
Given that and
39. Which of the following functions from Z into Z are bijections?
(A)
(B)
(C)
(D)
Sol. (B)
Here,
Let
Hence, is one-one and onto.
40. Let : R → R be the functions defined by . Then is
(A)
(B)
(C)
(D) 5 – x
Sol. (B)
Given that,
Let
41. Let : A → B and : B →C be the bijective functions. Then is
(A)
(B)
(C)
(D)
Sol. (A)
Given that, be the bijective functions.
42. Let be defined by , Then
(A)
(B)
(C)
(D)
Sol. (A) Given that,
Let
43. Let : [0, 1] → [0, 1] be defined by then
is
(A) constant
(B) 1 + x
(C) x
(D) none of these
Sol. (c) Given that be defined by
44. Let be the function defined by then the range
of is
(A) R
(B)
(C)
(D)
Sol. (B) Given that,
Let
Range=
45. Let : N →R be the function defined by and be another
function defined by . Then, is
(A) 1
(B) 1
(C)
(D) none of these
Sol. (D) Given that and
46. Let : R → R be defined by Then is
(A) 9
(B) 14
(C) 5
(D) none of these
Sol. (A) Given that
47. Let : R → R be given by . Then is
(A)
(B)
(C) does not exist
(D) none of these
Sol. (A) Given that,
Let
Fill in the blanks in each of the Exercises 48 to 52.
48. Let the relation R be defined in N by aRb if 2a+ 3b= 30. Then R =....
Sol. Given that, 2a+ 3b= 30
3b=30-2a
For a=3, b=8
a=6, b=6
a=9, b=4
a= 12, b=2
49. Let the relation R be defined on the set by
. Then R is given by _______.
Sol. Given
50. Let = {(1, 2), (3, 5), (4, 1) and = {(2, 3), (5, 1), (1, 3)}. Then and
Sol. Given that, = {(1, 2), (3, 5), (4, 1) and = {(2, 3), (5, 1), (1, 3)}
Now
51. Let : R → R be defined by , then
Sol. Given that,
52. If then
Sol. Given that,
Let
True/ False
53. Let be a relation defined on the set A = {1, 2, 3}. Then
R is symmetric, transitive but not reflexive.
Sol. False
Given that, be defined on the set
So, R is not reflexive.
Hence, R is symmetric.
Since,
But
Hence, R is not transitive.
54. Let be the function defined by. Then Then,
is invertible.
Sol. False
Given is not one-one function for all
So, is not invertible.
55. Every relation which is symmetric and transitive is also reflexive.
Sol. False
Let R be a relation defined by
on the set .
It is clear that . So, it is not reflexive.
56. An integer m is said to be related to another integer n, if m is a integral multiple of
n. This relation in Z is reflexive, symmetric and transitive.
Sol. False
The given relation is reflexive and transitive but not symmetric.
57. Let and N be the set of natural numbers. Then, the mapping
defined by , , , is onto.
Sol. True
Given, A={0, 1}
So, the mapping is onto.
58. The relation R on the set A={1,2,3} defined as is
reflexive, symmetric and transitive.
Sol. False
Given that,
So, R is not reflexive.
59. The composition of functions is commutative.
Sol. False
Let
And
60. The composition of functions is associative.
Sol. True
Let
And
Then,
=
61. Every function is invertible.
Sol. False
Only bijective functions are invertible.
62. A binary operation on a set has always the identity element.
Sol. False
‘+’ is a binary operation on the set N but it has no identity element.
Long Answer Questions
16. If define relations on A which have properties of being:
(a) reflexive, transitive but not symmetric
(b) symmetric but neither reflexive nor transitive
(c) reflexive, symmetric and transitive.
Sol. Given that
(i) Let
is reflexive, since, (1,1) (2,2) (3,3) lie is
Now,
Hence, is also transitive but
So, it is not symmetric.
(ii) Let
Now,
So, it is symmetric.
(iii) Let
Hence, is reflexive, symmetric and transitive.
17. Let R be relation defined on the set of natural number N as follows:
Find the domain and range of the
relation R. Also verify whether R is reflexive, symmetric and transitive.
Sol. Given that,
Domain = {1,2,3....20}
Range = {1,3,5,7.......39}
R is not reflexive as (2, 2)
So, R is not symmetric
As
So, R is not transitive
As
But
Hence, R is neither reflexive, nor symmetric and nor transitive.
18. Given, A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of each of the following:
(a) an injective mapping from A to B
(b) a mapping from A to B which is not injective
(c) a mapping from B to A.
Sol. Given that A = {2, 3, 4}, B = {2, 5, 6, 7}
(i) Let denote a mapping
i.e. Which is an injective mapping.
(ii) Let denote a mapping such that which is not an
injective mapping.
(iii) Let denote a mapping such that which is a
mapping from B to A.
19. Give an example of a map
(i) which is one-one but not onto
(ii) which is not one-one but onto
(iii) which is neither one-one nor onto.
Sol. (i) Let be a mapping defined by
Which is one-one
For
Further is not onto, as for there does not exist any in N such that
(ii) Let given by for every is onto
but not one-one. is not one-one as . But is onto.
(iii) The mapping defined as , is neither one-one not onto.
20. Let If be defined by .
Then, show that is bijective.
Sol. Given that,
is defined by
For injectivity
Let
So, (x) is an injective function
For surjectivity
[codomain]
So, is surjective function.
Hence, is a bijective function.
21. Let A = [–1, 1]. Then, discuss whether the following functions defined on A are one-
one, onto or bijective:
(i)
(ii)
(iii)
(iv)
Sol. Given that
(i)
Let
So, is one-one.
Now, let
As for
So, is not onto.
Also, is not bijective as it is not onto.
(ii)
Let
So, is not one-one.
Now,
So, is not onto, also, is not bijective.
(iii)
So, is one-one
Now, let
So, is onto also, is a bijective.
(iv)
Let
Thus, is not one-one.
Now, let
As for
Hence, is neither one-one nor onto.
22. Each of the following defines a relation on N:
(i) x is greater than
(ii)
(iii) xy is square of an integer
(iv)
Determine which of the above relations are reflexive, symmetric and transitive.
Sol. (i) x is greater than
For xRx
Therefore, R is not reflexive.
Let
x>y
but y>x is not true for any
Thus, R is not symmetric.
Thus, R is not symmetric.
Let
x>y and
So, R is transitive.
(ii)
So, R is not reflexive.
Therefore, R is symmetric.
Hence, R is not transitive.
(iii) Given xy, is square of an integer
As is square of an integer for any
Hence, R is reflexive.
If
Therefore, R is symmetric.
If
So, xy is square of an integer and yz is square of an integer.
Let xy=m2 and yz=n2for some
, Which is square of an integer.
So, R is transitive.
(iv)
Thus, R is not reflexive.
Hence, R is not symmetric.
So, R is transitive.
23. Let and R be the relation in defined by
if for in . Prove that R is an
equivalence relation and also obtain the equivalent class [(2, 5)].
Sol. Given that for
and
Let
Which is true for any
Hence, R is reflexive.
Let (a, b) R (c, d)
a+d = b+c
So, R is symmetric.
Let
Now, equivalence class containing
24. Using the definition, prove that the function is invertible if and only if
is both one-one and onto.
Sol. A function is defined to be invertible, if there exist a function
such that and . The function is called the inverse of and is denoted by
A function is invertible if is bijective function.
25. Functions are defined, respectively, by ,
find
(i)
(ii)
(iii)
(iv)
Sol. Given that ,
(i)
(ii)
(iii)
(iv)
26. Let * be the binary operation defined on Q. Find which of the following binary
operations are commutative
(i)
(ii)
(iii)
(iv)
Sol. Given that * be the binary operation defined on Q.
(i) and b * a = b - a
So,
Hence, * is not commutative.
(ii)
So, * is commutative. [since, ‘+’ is on rational is commutative]
(iii)
Clearly,
So, * is not commutative.
(iv)
Hence, * is commutative.
27. If * be binary operation defined on R by Then, the operation
* is
(i) commutative but not associative
(ii) associative but not commutative
(iii) neither commutative nor associative
(iv) both commutative and associative
Sol. (i) Given that
So, * is a commutative binary operation.
Also
From Eqs. (i) and (ii)
So, * is not associative
Hence, * is commutative but not associative.
