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.
A school is organizing a debate competition with participants as speakers and judges. $ S = \{S_1, S_2, S_3, S_4\} $ where $ S = \{S_1, S_2, S_3, S_4\} $ represents the set of speakers. The judges are represented by the set: $ J = \{J_1, J_2, J_3\} $ where $ J = \{J_1, J_2, J_3\} $ represents the set of judges. Each speaker can be assigned only one judge. Let $ R $ be a relation from set $ S $ to $ J $ defined as: $ R = \{(x, y) : \text{speaker } x \text{ is judged by judge } y, x \in S, y \in J\} $.
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: