Commutative Law of Binary Operation
Trending Questions
If A is a subset of B , then prove that A union B is B .
If every element of a group is its own inverse, then
If then find the value of
The relation a∗b=(a−b)2 , is commutative -
True
False
Let ∗ be the binary operation on N given by a∗b=LCM of a and b.
(i) Find 5∗7, 20∗16
(ii)Is ∗ commutative?
(iii)Is ∗ associative?
(iv) Find the identity of ∗ in N
(v)Which elements of N are invertible for the operation ∗ ?
The default parameter passing mechanism
call by value
call by reference
call by value result
none of these
Why managing devops via chat is called chatops?
Which of the following binary operation is not commutative?
None of these
Multiplication
Addition
Subtraction
- f′(x)=2x−5, if x>3 or x<2
- f′(x)=2x−5 for all x
- f′(x)=5−2x, if 2<x<3
- f′(x)=2x−5, if x≥3 or x≤2
Let ∗ be a binary operation on the set Q of rational number as follows:
(i)a∗b=a−b
(ii)a∗b=a2+b2
(iii)a∗b=a+ab
(iv)a∗b=(a−b)2
(v)a∗b=ab4
(vi)a∗b=ab2
Find which of the binary operation are commutative and which are associative?
(i) a∗b=1∀a, b∈R
(a) commutative but no associative
(b) commutative and associative
(c) associative but not commutative
(d) neither commutative nor associative
We can say that composition of functions is commutative since fog (x) = gof (x).
True
False
Let for every real number . Then :
is increasing whenever is increasing
is increasing whenever is decreasing
is decreasing whenever is increasing
nothing can be said in general
Consider the binary operations*: R ×R → and o: R × R → R defined as and a o b = a, &mnForE;a, b ∈ R. Show that * is commutative but not associative, o is associative but not commutative. Further, show that &mnForE;a, b, c ∈ R, a*(b o c) = (a * b) o (a * c). [If it is so, we say that the operation * distributes over the operation o]. Does o distribute over *? Justify your answer.