INPS Computer Fundamental Study Material
INPS Computer Fundamental Study Material
(4) If each row except the topmost row or each column except the left most column contains the identity
element then every element of S is invertible with respect to *. To find the inverse of an element say aj, we consider
row (or column) headed by ai. Then we determine the position of identity element e in this row (or column). If e
appears in the column (or row) headed by aj, then ai and aj are inverse of each other.
It should be noted that the composition table is helpless to determine associativity of the binary operation.
This has to be verified for each possible trial.
Example: 1 Let S be a finite set containing n elements. Then the total number of binary operations on S is
2 2
(a) nn (b) 2n (c) nn (d) n2
Solution: (c) Since a binary operation on S is a function from S × S to S, therefore the total number of binary operations on S is the
2
total number of functions from S × S to S, which is nn .
ab
Example: 2 The identity element for the binary operation * defined by a * b = , a, b Q0 (the set of all non-zero rational numbers) is
2
(a) 1 (b) 0 (c) 2 (d) None of these
ab
Solution: (c) Let e be the identity element for the binary operation * on Q0 defined by a * b
2
Then, a * e a e * a for all a Q0
ae
a for all a Q0 e 2 .
2
Example: 3 Let z be the set of integers and o be a binary operation on z defined as a o b a b ab for all a, b z . The inverse of an
element a ( 1) z is
a a a 1
(a) (b) (c) (d) None of these
a 1 1 a a
Solution: (a) Let e be the identity element for the binary operation o defined on z given by a o b a b ab
Then a o e a e o a for all a z
a e ae a for all a z e(1 a) 0 for all a z e 0 .
So, 0 is the identity element for the binary operation o and z.
Let x be the inverse of a z . Then, a o x x o a 0
a
a x ax 0 x(1 a) a x ( a 1)
a 1
a
Thus, is the inverse of a ( 1) z .
a 1
Example: 4 * is defined on the set of real numbers by a * b 1 ab . Then the operation * is
(a) Commutative but not associative (b) Associative but not commutative
(c) Neither commutative nor associative (d) Both commutative and associative
Solution: (a) We have a * b 1 ab 1 ba b * a
So, * is commutative on R.
For any, a, b, c R, we have (a * b) * c (1 ab) * c 1 (1 ba)c 1 c abc
and a * (b * c) a * (1 bc) 1 a(1 bc) 1 a abc
(a * b) * c a * (b * c)
So, * is not associative on R.
***
Master of Computer Application