Question
Consider the binary operations *: R × R → R and o: R × R → R defined as $\text{a}∗\text{b} = |\text{a } – \text{ b}|\text{ and}\text{ a} o \text{b} = \text{a},\forall\text{a},\text{b}\in\text{R}.$ Show that * is commutative but not associative, o is associative but not commutative. Further, show that $\forall\text{a},\text{b},\text{c}\in\text{R},\text{a} *(\text{b}o\text{c}) = (\text{a} *\text{b})o(\text{a}*\text{b}).$ [If it is so, we say that the operation * distributes over the operation o]. Does o distribute over *? Justify your answer.

Answer

It is given that *: R × R → and o: R × R → R is defined as
a * b = |a - b| and aob = a, $\Box\text{a},\text{b}\in\text{R}.$
For $\text{a},\text{b}\in\text{R},$ we have:
a * b = |a - b|
b * a = |b - a| = |-(a - b)| = |a - b|
$\therefore$ The operation * is commutative.
It can be observed that,
(1 * 2) * 3 = (|1 - 2|) * 3 = 1 * 3 = |1 - 3| = 2
1 * (2 * 3) = 1 * (|2 - 3|) = 1 * 1 = |1 - 1| = 0
$\therefore(1*2) *3\neq1*(2*3)(\text{where }1, 2,3\in\text{R})$
$\therefore$ The operation * is not associative.
Now, consider the operation o:
It can be observed that 1o2 = 1 and 2o1 = 2.
$\therefore1o2\neq2o1\ (\text{where }1,2\in\text{R})$
$\therefore$ The operation o is not commutative.
Let $\text{a},\text{b},\text{c}\in\text{R}.$ Then, we have:
(aob)oc = aoc = a
ao(boc) = aob = a
⇒ (aob)oc = ao(boc)
$\therefore$ The operation o is associative.
Now, let $\text{a},\text{b},\text{c}\in\text{R},$ then we have:
a * (boc) = a * b = |a - b|
(a * b)o(a * c) = (|a - b|)o(|a - c|) = |a - b|
Hence, a * (boc) = (a * b)o(a * c).
Now,
1o(2 * 3) = 1o(|2 - 3|) = 1o1 = 1
(1o2) * (1o3) = 1 * 1 = |1 - 1| = 0
$\therefore1o(2 * 3)\neq(1o2)*(1o3)\ (\text{where }1,2,3\in\text{R})$
$\therefore$ The operation o does not distribute over *.

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free

Similar questions

A firm manufactures two products $A$ and $B$. Each product is processed on two machines $M_1$ and $M_2$. Product $A$ requires $4$ minutes of processing time on $M_1$ and $8$ min. on $M_2;$ product $B$ requires $4$ minutes on $M_1$ and $4$ min. on $M_2$. The machine $M_1$ is available for not more than $8$ hrs $20$ min. while machine $M_2$ is available for $10$ hrs. during any working day. The products $A$ and $B$ are sold at a profit of Rs. $3$ and Rs. $4$ respectively.
Formulate the problem as a linear programming problem and find how many products of each type should be produced by the firm each day in order to get maximum profit.
find the area of the region enclosed by the parbola $x^2 = y$ and the line $y = x + 2$.
Solve the following differential equations:
$\frac{\text{dy}}{\text{dx}}=2\text{e}^{\text{x}}\text{y}^3,\text{y}(0)=\frac{1}{2}$
For the differential equation $\text{xy}\frac{\text{dy}}{\text{dx}}=(\text{x}+2)(\text{y}+2),$ find the solution curve passing through the point (1, - 1).
Evaluate:
$\begin{vmatrix}\text{x}+\lambda&\text{x}&\text{x}\\\text{x}&\text{x}+\lambda&\text{x}\\\text{x}&\text{x}&\text{x}+\lambda\end{vmatrix}$
If $\vec{\text{a}},\ \vec{\text{b}},\ \vec{\text{c}}$ are non-coplanar vectors, prove that the point having the following position vectors is collinear:$\vec{\text{a}},\ \vec{\text{b}},\ 3\vec{\text{a}}-2\vec{\text{b}}$
Tangent to the circle $\text{x}^{2} + \text{y}^{2} = 4$ at any point on it in the first quadrant makes intercepts OA and OB on x and y axes respectively, O being the centre of the circle. Find the minimum value of (OA + OB).
Evaluate the following intregals:
$\int\frac{1}{5+7\cos\text{x}+\sin\text{x}}\ \text{dx}$
Find the vector equations of the coordinate planes.
A factory owner purchases two types of machines, A and B, for his factory. The requirements and limitations for the machines are as follows:
 
Area occupied by the
machine
Labour force for each
machine
Daliy outputin
units
Machines
1000 sp.m
12 mem
60
Machines
1200 sp.m
8 mem
40
He has an area of 7600 sq. m available and 72 skilled men who can operate the machines.
How many machines of each type should he buy to maximize the daily output?