Consider a binary operation * on the set {1,2,3,4,5} given by the following multiplication table.
(i) Compute (2 * 3)*4 and 2 *(3 * 4)
(ii)Is * commutative?
(iii)Compute (2 * 3)*(4 * 5).
(Hint: use the following table)
| * | 1 | 2 | 3 | 4 | 5 |
| 1 | 1 | 1 | 1 | 1 | 1 |
| 2 | 1 | 2 | 1 | 2 | 1 |
| 3 | 1 | 1 | 3 | 1 | 1 |
| 4 | 1 | 2 | 1 | 4 | 1 |
| 5 | 1 | 1 | 1 | 1 | 5 |
(i) (2 * 3) * 4 = 1 * 4 = 1 2 * (3 * 4) = 2 * 1 = 1
(ii) For every a, b ∈{1, 2, 3, 4, 5}, we have a * b = b * a. Therefore, the operation * is commutative.
(iii) (2 * 3) = 1 and (4 * 5) = 1
∴ (2 * 3) * (4 * 5) = 1 * 1 = 1
Determine whether each of the following relations are reflexive, symmetric, and transitive.
Show that the relation R in the set R of real numbers, defined as
R = {(a, b): a ≤ b2 } is neither reflexive nor symmetric nor transitive.
Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as
R = {(a, b): b = a + 1} is reflexive, symmetric or transitive.
Determine whether each of the following relations are reflexive, symmetric, and transitive.
Show that the relation R in the set R of real numbers, defined as
R = {(a, b): a ≤ b2 } is neither reflexive nor symmetric nor transitive.
Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as
R = {(a, b): b = a + 1} is reflexive, symmetric or transitive.
Show that the relation R in R defined as R = {(a, b): a ≤ b}, is reflexive and transitive
but not symmetric.
Check whether the relation R in R defined as R = {(a, b): a ≤ b3} is reflexive, symmetric or transitive
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: