Let * be the binary operation on N defined by a * b=H.C.F. of a and b. Is * commutative? Is * associative? Does there exist identity for this binary operation on N?
The binary operation * on N is defined as:
a * b = H.C.F. of a and b
It is known that:
H.C.F. of a and b = H.C.F. of b and a ∀ a, b ∈ N.
∴ a * b = b * a
Thus, the operation * is commutative.
For a, b, c ∈ N, we have: (a * b)* c = (H.C.F. of a and b) * c = H.C.F. of a, b, and c a *(b * c)= a *(H.C.F. of b and c) = H.C.F. of a, b, and c
∴(a * b) * c = a * (b * c)
Thus, the operation * is associative.
Now, an element e ∈ N will be the identity for the operation * if a * e = a = e* a a ∈ N.
But this relation is not true for any a ∈ N.
Thus, the operation * does not have any identity in N.
LIST I | LIST II | ||
A. | Range of y=cosec-1x | I. | R-(-1, 1) |
B. | Domain of sec-1x | II. | (0, π) |
C. | Domain of sin-1x | III. | [-1, 1] |
D. | Range of y=cot-1x | IV. | \([\frac{-π}{2},\frac{π}{2}]\)-{0} |
What is the Planning Process?
A binary operation can be understood as a function f (x, y) that applies to two elements of the same set S, such that the result will also be an element of the set S. Examples of binary operations are the addition of integers, multiplication of whole numbers, etc. A binary operation is a rule that is applied on two elements of a set and the resultant element also belongs to the same set.
Read More: Truth Table
There are four main types of binary operations which are: