Determine whether each of the following operations define a binary operation on the given set or not:
‘*’ on N defined by a * b = ab for all a,b N.
Given that ‘*’ is an operation that is valid in the Natural Numbers ‘N’ and it is defined as given:
⇒ a*b = ab, where a,b∈N
Since a∈N and b∈N,
According to the problem it is given that on applying the operation ‘*’ for two given natural numbers it gives a natural number as a result of the operation,
⇒ a*b∈N ...... (1)
We also know that pq>0 if p>0 and q>0.
So, we can state that,
⇒ ab>0
⇒ ab∈N ...... (2)
From (1) and (2) we can see that both L.H.S and R.H.S gave only Natural numbers as a result.
Thus we can clearly state that ‘*’ is a Binary Operation on ‘N’.
Determine whether each of the following operations define a binary operation on the given set or not:
‘O’ on Z defined by a O b = ab for all a,b Z.
Given that ‘Ο’ is an operation that is valid in the Integers ‘Z’ and it is defined as given:
⇒ aΟb = ab, where a,b∈Z
Since a∈Z and b∈Z,
According to the problem it is given that on applying the operation ‘*’ for two given integers it gives Integers as a result of the operation,
⇒ aΟb∈Z ...... (1)
Let us values of a = 2 and b = – 2 on substituting in the R.H.S side we get,
⇒ ab = 2 – 2
⇒
⇒ ab∉Z ...... (2)
From (2), we can see that ab doesn’t give only Integers as a result. So, this cannot be stated as a binary function.
∴ The operation ‘Ο’ does not define a binary function on Z.
Determine whether each of the following operations define a binary operation on the given set or not:
‘*’ on N defined by a * b = a + b – 2 for all a,b N.
Given that ‘*’ is an operation that is valid in the Natural Numbers ‘N’ and it is defined as given:
⇒ a*b = a + b – 2, where a,b∈N
Since a∈N and b∈N,
According to the problem it is given that on applying the operation ‘*’ for two given natural numbers it gives a natural number as a result of the operation,
⇒ a*b∈N ...... (1)
Let us take the values of a = 1 and b = 1, substituting in the R.H.S side we get,
⇒ a + b – 2 = 1 + 1 – 2
⇒ a + b – 2 = 0∉N ...... (2)
From (2), we can see that a + b – 2 doesn’t give only Natural numbers as a result. So, this cannot be stated as a binary function.
∴ The operation ‘*’ does not define a binary operation on N.
Determine whether each of the following operations define a binary operation on the given set or not:
‘x6’ on S={1,2,3,4,5} defined by a x6 b = Remainder when ab is divided by 6.
Given that ‘x6’ is an operation that is valid for the numbers in the Set S = {1,2,3,4,5} and it is defined as given:
⇒ ax6b = Remainder when ab is divided by 6, where a,b∈S
Since a∈S and b∈S,
According to the problem it is given that on applying the operation ‘*’ for two given numbers in the set ‘S’ it gives one of the numbers in the set ‘S’ as a result of the operation,
⇒ ax6b∈S ...... (1)
Let us take the values of a = 3, b = 4,
⇒ ab = 3×4
⇒ ab = 12
We know that 12 is a multiple of 6. So, on dividing 12 with 6 we get 0 as remainder which is not in the given set ‘S’.
The operation ‘x6’ does not define a binary operation on set S.
Determine whether each of the following operations define a binary operation on the given set or not:
‘+6’ on S = {0,1,2,3,4,5} defined by a +6 b=
Given that ‘*’ is an operation that is valid for the numbers in the set S = {0,1,2,3,4,5} and it is defined as given:
⇒ a +6 b = , where a,b∈S
Since a∈S and b∈S,
According to the problem it is given that on applying the operation ‘*’ for two given numbers in the set ‘S’ it gives the number that present in the set ‘S’ as a result of the operation,
⇒ a + 6b∈S ...... (1)
Since the addition of any two whole numbers must give a whole number, we can say that,
⇒ a + b≥0
For a + b<6, a + b∈S
⇒ a + b≥6 ⇒ a + b – 6≥0∈W
But according to the numbers given in the problem, the maximum value of the sum we can attain is 6.
So, we can say that a + b – 6∈S.
∴ The operation ‘ + 6’ defines a binary operation on S.
Determine whether each of the following operations define a binary operation on the given set or not:
‘O’ on N defined by a O b = ab + ba for all a,b N.
Given that ‘Ο’ is an operation that is valid in the Natural Numbers ‘N’ and it is defined as given:
⇒ aΟb = ab + ba, where a,b∈N
Since a∈N and b∈N,
According to the problem it is given that on applying the operation ‘Ο’ for two given natural numbers it gives a natural number as a result of the operation,
⇒ aΟb∈N ...... (1)
We know that pq>0 if p>0 and q>0.
⇒ ab>0 and ba>0.
We also know that the sum of two natural numbers is a natural number.
⇒ ab + ba∈N
∴ The operation ‘Ο’ defines the binary operation on N.
Determine whether each of the following operations define a binary operation on the given set or not:
‘*’ on Q defined by for all a,b Q.
Given that ‘*’ is an operation that is valid in the Rational Numbers ‘Q’ and it is defined as given:
⇒ , where a,b∈Q
Since a∈Q and b∈Q,
According to the problem it is given that on applying the operation ‘*’ for two given rational numbers it gives a rational number as a result of the operation,
⇒ a*b∈Q ...... (1)
Let the value of b = – 1 and a = 2
⇒
⇒
⇒
∴ the operation ‘*’ does not define a binary operation on Q.
Determine whether or not each definition * given below gives a binary operation. In the event that * is not a binary operation give justification of this.
On Z + , defined * by a*b = a – b
Here, Z + denotes the set of all non – negative integers.
Given that ‘*’ is an operation that is valid in the Positive integers ‘Z + ’ and it is defined as given:
⇒ a*b = a – b, where a,b∈Z +
Since a∈Z + and b∈Z + ,
According to the problem it is given that on applying the operation ‘*’ for two given positive integers it gives a positive integer as a result of the operation,
⇒ a*b∈Z + ...... (1)
Let us take the values a = 1 and b = 2
⇒ a – b = 1 – 2
⇒ a – b = – 1∉Z +
∴ The operation * does not define a binary operation on Z +
Determine whether or not each definition * given below gives a binary operation. In the event that * is not a binary operation give justification of this.
On Z + , defined * by a*b = ab
Here, Z + denotes the set of all non – negative integers.
Given that ‘*’ is an operation that is valid in the Positive integers ‘Z + ’ and it is defined as given:
⇒ a*b = ab, where a,b∈Z + ,
Since a∈Z + and b∈Z + ,
According to the problem it is given that on applying the operation ‘*’ for two given positive integers it gives a Positive integer as a result of the operation,
⇒ a*b∈Z + – ...... (1)
We know that p q>0 if p>0 and q>0.
⇒ ab>0∈N
⇒ ab∈Z +
∴ The operation * defines a binary operation on Z +.
Determine whether or not each definition * given below gives a binary operation. In the event that * is not a binary operation give justification of this.
On R, defined * by a*b = ab2
Here, Z + denotes the set of all non – negative integers.
Given that ‘*’ is an operation that is valid in the Real Numbers ‘R’ and it is defined as given:
⇒ a*b = ab2, where a,b∈R
Since a∈R and b∈R,
According to the problem it is given that on applying the operation ‘*’ for two given real numbers it gives a real number as a result of the operation,
⇒ a*b∈R ...... (1)
We know that ab∈R if a∈R and b∈R
∴ The operation * defines a binary operation on R.
Determine whether or not each definition * given below gives a binary operation. In the event that * is not a binary operation give justification of this.
On Z + , defined * by a*b = |a – b|
Here, Z + denotes the set of all non – negative integers.
Given that ‘*’ is an operation that is valid in the Positive integers ‘Z + ’ and it is defined as given:
⇒ a*b = |a – b|, where a,b∈Z + ,
Since a∈Z + and b∈Z + ,
According to the problem it is given that on applying the operation ‘*’ for two given positive integers it gives a Positive integer as a result of the operation,
⇒ a*b∈Z ...... (1)
Let us take a = 2 and b = 2,
⇒ |a – b| = |2 – 2|
⇒ |a – b| = |0|
⇒ |a – b| = 0∉Z +
∴ The operation * does not define a binary function on Z + .
Determine whether or not each definition * given below gives a binary operation. In the event that * is not a binary operation give justification of this.
On Z + , defined * by a*b = a
Here, Z + denotes the set of all non – negative integers.
Given that ‘*’ is an operation that is valid in the Positive integers ‘Z + ’ and it is defined as given:
⇒ a*b = a, where a,b∈Z + ,
Since a∈Z + and b∈Z + ,
According to the problem it is given that on applying the operation ‘*’ for two given positive integers it gives a Positive integer as a result of the operation,
⇒ a*b∈Z + – ...... (1)
It is told from the problem a∈Z + .
The operation ‘*’ defines a binary operation on Z +.
Determine whether or not each definition * given below gives a binary operation. In the event that * is not a binary operation give justification of this.
On R, defined * by a*b = a + 4b2
Here, Z + denotes the set of all non – negative integers.
Given that ‘*’ is an operation that is valid in the Real Numbers ‘R’ and it is defined as given:
⇒ a*b = a + 4b2, where a,b∈R,
Since a∈R and b∈R,
According to the problem it is given that on applying the operation ‘*’ for two given real numbers it gives a Real number as a result of the operation,
⇒ a*b∈R ...... (1)
Since b∈R then b2∈R,
We also know that the sum of two real numbers gives a real number. So,
⇒ a + 4b2∈R ...... (2)
From (1) and (2),
∴ The operation ‘*’ defines a binary operation on R.
Let * be a binary operation on the set I of integers, defined by a*b = 2a + b – 3. Find the value of 3*4.
Given that * is a binary operation on the set I of integers.
The operation is defined by a*b = 2a + b – 3.
We need to find the value of 3*4.
Since 3 and 4 belongs to the set of integers we can use the binary operation.
⇒ 3*4 = (2×3) + 4–3
⇒ 3*4 = 6 + 1
⇒ 3*4 = 7
∴ the value of 3*4 is 7.
Is * defined on the set {1,2,3,4,5} by a*b = LCM of a and b a binary operation? Justify your answer.
Given that * is an operation that is valid on the set S = {1,2,3,4,5} defined by a*b = LCM of a and b.
According to the problem it is given that on applying the operation * for two given numbers in the set ‘S’ it gives a number in the set ‘S’ as a result of the operation.
Let us take the values of a = 2 and b = 3.
We know that L.C.M of two prime numbers is given by the product of that two prime numbers.
⇒ L.C.M of a and b is 2×3 = 6.
⇒ 6∉S
∴ The operation * does not define a binary operation on ‘S’.
Let S = {a,b,c}. Find the total number of binary operations on S.
Given set S = {a,b,c}, we need to find the total number of binary operations possible for the set ‘S’.
We know that the total number of binary operations on a set ‘S’ with ‘n’ elements is given by .
Here n = 3,
⇒
⇒
∴ The total number of binary operations possible on set ‘S’ is 39.
Find the total number of binary operations on {a,b}
Given set S = {a,b}, we need to find the total number of binary operations possible for the set ‘S’.
We know that the total number of binary operations on a set ‘S’ with ‘n’ elements is given by .
Here n = 2,
⇒
⇒
⇒
∴ The total number of binary operations possible on set ‘S’ is 16.
Prove that the operation * on the set
defined by A*B=AB is a binary operation.
Given that * is an operation that is valid on the set and it is defined as given:A*B = A B.
According to the problem it is given that on applying the operation * for two given numbers in the set ‘M’ it gives a number in the set ‘M’ as a result of the operation.
⇒ A*B∈M ...... (1)
Let us take here a∈R, b∈R, c∈R and d∈R then,
⇒
⇒
⇒
⇒
Since a∈R and c∈R then ac∈R
And also b∈R and d∈R then bd∈R.
⇒ AB∈R
∴ The operation ‘*’ defines a binary operation on ‘M’.
Let S be the set of all rational numbers of the form m/n, where m∈Z and n = 1,2,3. Prove that * on S defined by a*b = ab is not a binary operation.
Given that * is an operation that is valid on the set S which consists of all rational numbers of the form , here m∈Z and n = 1,2,3 and is defined by a*b = ab.
According to the problem it is given that on applying the operation * for two given numbers in the set ‘S’ it gives a number in the set ‘S’ as a result of the operation.
⇒ a*b∈S ...... (1)
Since a∈S and b∈S,
Let us take the values of then,
⇒
⇒ as 9∉n.
∴ The operation ‘*’ does not define a binary operation on ‘S’.
The binary operation * defined on R×R → R is defined as a*b = 2a + b. Find (2*3)*4.
Given that * is an operation that is valid for the following Domain and Range R×R→R and is defined by a*b = 2ab.
We need to find the value of (2*3)*4
According to the problem the binary operation involving * is true for all real values of a and b.
⇒ (2*3)*4 = ((2×2) + 3)*4
⇒ (2*3)*4 = (4 + 3)*4
⇒ (2*3)*4 = 7*4
⇒ (2*3)*4 = (2×7) + 4
⇒ (2*3)*4 = 14 + 4
⇒ (2*3)*4 = 18
∴ The value of (2*3)*4 is 18.
Let * be a binary operation on N given by a*b = LCM(a,b) for all a,b∈N. Find 5*7.
Given that * is an operation that is valid for the natural numbers ‘N’ and is defined by a*b = LCM(a,b).
We need to find the value of 5*7.
According to the Problem, Binary operation is assumed to be true for the values of a and b to be natural.
⇒ 5*7 = LCM(5,7)
We know that LCM of two prime numbers is the product of that given two prime numbers.
⇒ 5*7 = 5×7
⇒ 5*7 = 35
∴ The value of 5*7 is 35.
Let ‘*’ be a binary operation on N defined by a*b = L.C.M(a,b) for all a,b∈N.
Find 2*4, 3*5, 1*6.
Given that * is an operation that is valid on all natural numbers ‘N’ and is defined by a*b = L.C.M(a,b)
According to the problem, binary operation given is assumed to be true.
Let us find the values of 2*4,3*5,1*6
⇒ 2*4 = L.C.M(2,4) = 4
⇒ 3*5 = L.C.m(3,5)
⇒ 3*5 = 3×5 = 15
⇒ 1*6 = L.C.M(1,6)
⇒ 1*6 = 1×6 = 6
The values of 2*4 is 4 , 3*5 is 15 and 1*6 is 6
Let ‘*’ be a binary operation on N defined by a*b = L.C.M(a,b) for all a,b∈N.
Check the commutativity and associativity of ‘*’ on N.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ a*b = L.C.M(a,b)
⇒ b*a = L.C.M(b,a) = L.C.M(a,b)
⇒ b*a = a*b
∴ Commutative property holds for given binary operation ‘*’ on ‘N’.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒ (a*b)*c = (L.C.M(a,b))*c
⇒ (a*b)*c = L.C.M(a,b)*c
⇒ (a*b)*c = L.C.M(L.C.M(a,b),c)
⇒ (a*b)*c = L.C.M(a,b,c) ...... (1)
⇒ a*(b*c) = a*(L.C.M(b,c))
⇒ a*(b*c) = a*L.C.M(b,c)
⇒ a*(b*c) = L.C.M(a,L.C.M(b,c))
⇒ a*(b*c) = L.C.M(a,b,c) ...... (2)
From(1) and (2) we can say that associative property holds for binary function ‘*’ on ‘N’.
Determine which of the following binary operations are associative and which are commutative:
* on N defined by a*b=1 for all a,b N
Given that * is a binary operation on N defined by a*b = 1 for all a,b∈N.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ a*b = 1
⇒ b*a = 1
⇒ b*a = a*b
∴ The commutative property holds for given binary operation ‘*’ on ‘N’.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒ (a*b)*c = (1)*c
⇒ (a*b)*c = 1*c
⇒ (a*b)*c = 1 ...... (1)
⇒ a*(b*c) = a*(1)
⇒ a*(b*c) = a*1
⇒ a*(b*c) = 1 ...... (2)
From (1) and (2) we can clearly say that,
Associative property holds for given binary operation ‘*’ on ‘N’.
Determine which of the following binary operations are associative and which are commutative:
*on Q defined by for all a,b Q.
Given that * is a binary operation on N defined by for all a,b∈N.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒
⇒
⇒ b*a = a*b
∴ The commutative property holds for given binary operation ‘*’ on ‘N’.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒
⇒
⇒ ...... (1)
⇒
⇒
⇒ ...... (2)
From (1) and (2) we can clearly say that associativity doesn’t hold for the binary operation ‘*’ on ‘N’.
Let A be any set containing more than one element. Let ‘*’ be a binary operation on A defined by a*b = b for all a,b∈A. Is ‘*’ commutative or associative on A?
Given that * is a binary operation on set A defined by a*b = b for all a,b∈A.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ a*b = b
⇒ b*a = a
⇒ b*a≠a*b
∴ The commutative property does not hold for given binary operation ‘*’ on ‘A’.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒ (a*b)*c = (b)*c
⇒ (a*b)*c = b*c
⇒ (a*b)*c = c ...... (1)
⇒ a*(b*c) = a*(c)
⇒ a*(b*c) = a*c
⇒ a*(b*c) = c ...... (2)
From (1) and (2) we can clearly say that associativity holds for the binary operation ‘*’ on ‘A’.
Check the commutativity and associativity of each of the following binary operations:
‘*’ on Z defined by a*b = a + b + ab for all a,b∈Z
Given that * is a binary operation on Z defined by a*b = a + b + ab for all a,b∈Z.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ a*b = a + b + ab
⇒ b*a = b + a + ba
⇒ b*a = a + b + ab
⇒ b*a = a*b
∴ Commutative property holds for given binary operation ‘*’ on ‘Z’.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒ (a*b)*c = (a + b + ab)*c
⇒ (a*b)*c = (a + b + ab + c + ((a + b + ab)×c))
⇒ (a*b)*c = a + b + c + ab + ac + ac + abc ...... (1)
⇒ a*(b*c) = a*(b + c + bc)
⇒ a*(b*c) = (a + b + c + bc + (a×(b + c + bc)))
⇒ a*(b*c) = a + b + c + ab + bc + ac + abc ...... (2)
From (1) and (2) we can clearly say that associativity holds for the binary operation ‘*’ on ‘Z’.
Check the commutativity and associativity of each of the following binary operations:
‘*’ on N defined by a*b = 2ab for all a,b∈N
Given that * is a binary operation on N defined by a*b = 2ab for all a,b∈N.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ a*b = 2ab
⇒ b*a = 2ba = 2ab
⇒ b*a = a*b
∴ The commutative property holds for given binary operation ‘*’ on ‘N’.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒ (a*b)*c = (2ab)*c
⇒ ...... (1)
⇒ a*(b*c) = a*(2bc)
⇒ ...... (2)
From (1) and (2) we can clearly say that associativity doesn’t hold for the binary operation ‘*’ on ‘N’.
Check the commutativity and associativity of each of the following binary operations:
‘*’ on Q defined by a*b = a – b for all a,b∈Q
Given that * is a binary operation on Q defined by a*b = a – b for all a,b∈Q.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ a*b = a – b
⇒ b*a = b = a
⇒ b*a≠a*b
∴ The commutative property doesn’t hold for given binary operation ‘*’ on ‘Q’.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒ (a*b)*c = (a – b)*c
⇒ (a*b)*c = a – b – c ...... (1)
⇒ a*(b*c) = a*(b – c)
⇒ a*(b*c) = a – (b – c)
⇒ a*(b*c) = a – b + c ...... (2)
From (1) and (2) we can clearly say that associativity doesn’t hold for the binary operation ‘*’ on ‘Q’.
Check the commutativity and associativity of each of the following binary operations:
‘Ο’ on Q defined by aΟb = a2 + b2 for all a,b∈Q
Given that Ο is a binary operation on Q defined by aΟb = a2 + b2 for all a,b∈Q.
We know that commutative property is pΟq = qΟp, where Ο is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ aΟb = a2 + b2
⇒ bΟa = b2 + a2 = a2 + b2
⇒ bΟa = aΟb
∴ Commutative property holds for given binary operation ‘Ο’ on ‘Q’.
We know that associative property is (pΟq)Οr = pΟ(qΟr)
Let’s check the associativity of given binary operation:
⇒ (aΟb)Οc = (a2 + b2)Οc
⇒
⇒ (aΟb)Οc = a4 + b4 + 2a2b2 + c2 ...... (1)
⇒ aΟ(bΟc) = aΟ(b2 + c2)
⇒
⇒ aΟ(bΟc) = a2 + b4 + c4 + 2b2c2 ...... (2)
From (1) and (2) we can clearly say that associativity doesn’t hold for the binary operation ‘*’ on ‘Q’.
Check the commutativity and associativity of each of the following binary operations:
‘o’ on Q defined by a o b = ab/2 for all a,b Q.
Given that ο is a binary operation on Q defined by for all a,b∈Q.
We know that commutative property is pοq = qοp, where ο is a binary operation.
Let’s check the commutativity of given binary operation:
⇒
⇒
⇒ b*a = a*b
∴ The commutative property holds for given binary operation ‘ο’ on ‘Q’.
We know that associative property is (pοq)οr = pο(qοr)
Let’s check the associativity of given binary operation:
⇒
⇒
⇒ ...... (1)
⇒
⇒
⇒ ...... (2)
From (1) and (2) we can clearly say that associativity hold for the binary operation ‘ο’ on ‘Q’.
Check the commutativity and associativity of each of the following binary operations:
‘*’ on Q defined by a*b = ab2 for all a,b∈Q
Given that * is a binary operation on Q defined by a*b = ab2 for all a,b∈Q.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ a*b = ab2
⇒ b*a = ba2
⇒ b*a≠a*b
∴ Commutative property doesn’t holds for given binary operation ‘*’ on ‘Q’.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒ (a*b)*c = (ab2)*c
⇒ (a*b)*c = ab2c2 ...... (1)
⇒ a*(b*c) = a*(bc2)
⇒
⇒ a*(b*c) = ab2c4 ...... (2)
From (1) and (2) we can clearly say that associativity doesn’t hold for the binary operation ‘*’ on ‘Q’.
Check the commutativity and associativity of each of the following binary operations:
‘*’ on Q defined by a*b = a + ab for all a,b∈Q
Given that * is a binary operation on Q defined by a*b = a + ab for all a,b∈Q.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ a*b = a + ab
⇒ b*a = b + ba = b + ab
⇒ b*a≠a*b
∴ Commutative property doesn’t holds for given binary operation ‘*’ on ‘Q’.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒ (a*b)*c = (a + ab)*c
⇒ (a*b)*c = a + ab + ((a + ab)×c)
⇒ (a*b)*c = a + ab + ac + abc ...... (1)
⇒ a*(b*c) = a*(b + bc)
⇒ a*(b*c) = a + (a×(b + bc))
⇒ a*(b*c) = a + ab + abc ...... (2)
From (1) and (2) we can clearly say that associativity doesn’t hold for the binary operation ‘*’ on ‘Q’.
Check the commutativity and associativity of each of the following binary operations:
‘*’ on R defined by a*b = a + b – 7 for all a,b∈Q
Given that * is a binary operation on R defined by a*b = a + b – 7 for all a,b∈R.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ a*b = a + b – 7
⇒ b*a = b + a – 7 = a + b – 7
⇒ b*a = a*b
∴ Commutative property holds for given binary operation ‘*’ on ‘R’.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒ (a*b)*c = (a + b – 7)*c
⇒ (a*b)*c = a + b – 7 + c – 7
⇒ (a*b)*c = a + b + c – 14 ...... (1)
⇒ a*(b*c) = a*(b + c – 7)
⇒ a*(b*c) = a + b + c – 7 – 7
⇒ a*(b*c) = a + b + c – 14 ...... (2)
From (1) and (2) we can clearly say that associativity holds for the binary operation ‘*’ on ‘R’.
Check the commutativity and associativity of each of the following binary operations:
‘*’ on Q defined by a*b = (a – b)2 for all a,b∈Q
Given that * is a binary operation on Q defined by a*b = (a – b)2 for all a,b∈Q.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ a*b = (a – b)2
⇒ b*a = (b – a)2 = (a – b)2
⇒ b*a = a*b
∴ Commutative property holds for given binary operation ‘*’ on ‘Q’.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒ (a*b)*c = ((a – b)2)*c
⇒
⇒ (a*b)*c = (a2 + b2 – 2ab – c)2 ...... (1)
⇒ a*(b*c) = a*((b – c)2)
⇒
⇒ a*(b*c) = (a2 – b2 – c2 + 2bc)2 ...... (2)
From (1) and (2) we can clearly say that associativity doesn’t hold for the binary operation ‘*’ on ‘Q’.
Check the commutativity and associativity of each of the following binary operations:
*’ on Q defined by a*b = ab + 1 for all a,b∈Q
Given that * is a binary operation on Q defined by a*b = ab + 1 for all a,b∈Q.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ a*b = ab + 1
⇒ b*a = ba + 1 = ab + 1
⇒ b*a = a*b
∴ Commutative property holds for given binary operation ‘*’ on ‘Q’.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒ (a*b)*c = (ab + 1)*c
⇒ (a*b)*c = ((ab + 1)×c) + 1
⇒ (a*b)*c = abc + c + 1 ...... (1)
⇒ a*(b*c) = a*(bc + 1)
⇒ a*(b*c) = (a×(bc + 1)) + 1
⇒ a*(b*c) = abc + a + 1 ...... (2)
From (1) and (2) we can clearly say that associativity doesn’t hold for the binary operation ‘*’ on ‘Q’.
Check the commutativity and associativity of each of the following binary operations:
‘*’ on N defined by a*b = ab for all a,b∈N
Given that * is a binary operation on N defined by a*b = ab for all a,b∈N.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ a*b = ab
⇒ b*a = ba
⇒ b*a≠a*b
∴ Commutative property doen’t holds for given binary operation ‘*’ on ‘N’.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒ (a*b)*c = (ab)*c
⇒ (a*b)*c = (ab)c
⇒ (a*b)*c = abc ...... (1)
⇒ a*(b*c) = a*(bc)
⇒ ...... (2)
From (1) and (2) we can clearly say that associativity doesn’t hold for the binary operation ‘*’ on ‘N’.
Check the commutativity and associativity of each of the following binary operations:
‘*’ on Z defined by a*b = a – b for all a,b∈Z
Given that * is a binary operation on Z defined by a*b = a – b for all a,b∈Z.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ a*b = a – b
⇒ b*a = b – a
⇒ b*a≠a*b
∴ Commutative property doesn’t holds for given binary operation ‘*’ on ‘Z’.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒ (a*b)*c = (a – b)*c
⇒ (a*b)*c = (a – b) – c
⇒ (a*b)*c = a – b – c ...... (1)
⇒ a*(b*c) = a*(b – c)
⇒ a*(b*c) = a – (b – c)
⇒ a*(b*c) = a – b + c ...... (2)
From (1) and (2) we can clearly say that associativity doesn’t hold for the binary operation ‘*’ on ‘Z’.
Check the commutativity and associativity of each of the following binary operations:
‘*’ on Q defined by a*b = ab/4 for all a,b∈Q
Given that * is a binary operation on Q defined by for all a,b∈Q.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒
⇒
⇒ b*a = a*b
∴ Commutative property holds for given binary operation ‘*’ on ‘Q’.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒
⇒
⇒ ...... (1)
⇒
⇒
⇒ ...... (2)
From (1) and (2) we can clearly say that associativity hold for the binary operation ‘*’ on ‘Q’.
Check the commutativity and associativity of each of the following binary operations:
‘*’ on Z defined by a*b = a + b – ab for all a,b∈Z
Given that * is a binary operation on Z defined by a*b = a + b – ab for all a,b∈Z.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ a*b = a + b – ab
⇒ b*a = b + a – ba = a + b – ab
⇒ b*a = a*b
∴ Commutative property holds for given binary operation ‘*’ on ‘Z’.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒ (a*b)*c = (a + b – ab)*c
⇒ (a*b)*c = a + b – ab + c – ((a + b – ab)×c)
⇒ (a*b)*c = a + b + c – ab – ac – bc + abc ...... (1)
⇒ a*(b*c) = a*(b + c – bc)
⇒ a*(b*c) = a + b + c – bc – (a×(b + c – bc))
⇒ a*(b*c) = a + b + c – ab – ac – bc + abc ...... (2)
From (1) and (2) we can clearly say that associativity hold for the binary operation ‘*’ on ‘Z’.
Check the commutativity and associativity of each of the following binary operations:
‘*’ on Q defined by a*b = gcd(a,b) for all a,b∈Q
Given that * is a binary operation on Q defined by a*b = g.c.d(a,b) for all a,b∈Q.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ a*b = g.c.d(a,b)
⇒ b*a = g.c.d(b,a) = g.c.d(a,b)
⇒ b*a = a*b
∴ Commutative property holds for given binary operation ‘*’ on ‘Q’.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒ (a*b)*c = (g.c.d(a,b))*c
⇒ (a*b)*c = g.c.d(g.c.d(a,b),c)
⇒ (a*b)*c = g.c.d(a,b,c) ...... (1)
⇒ a*(b*c) = a*(g.c.d(b,c))
⇒ a*(b*c) = g.c.d(a,g.c.d(b,c))
⇒ a*(b*c) = g.c.d(a,b,c) ...... (2)
From (1) and (2) we can clearly say that associativity hold for the binary operation ‘*’ on ‘Q’.
If the binary operation ο is defined by aοb = a + b – ab on the set Q – { – 1} of all rational numbers other than – 1. Show that ο is commutative on Q – { – 1}.
Given that ο is a binary operation on Q – { – 1} defined by aοb = a + b – ab for all a,b∈Q – { – 1}.
We know that commutative property is pοq = qοp, where ο is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ aοb = a + b – ab
⇒ bοa = b + a – ba = a + b – ab
⇒ b*a = a*b
∴ Commutative property holds for given binary operation ‘ο’ on ‘Q – { – 1}’.
We know that associative property is (pοq)οr = pο(qοr)
Let’s check the associativity of given binary operation:
⇒ (aοb)οc = (a + b – ab)οc
⇒ (aοb)οc = a + b – ab + c – ((a + b – ab)×c)
⇒ (aοb)οc = a + b + c – ab – ac – ab + abc ...... (1)
⇒ aο(bοc) = aο(b + c – bc)
⇒ aο(bοc) = a + b + c – bc – (a×(b + c – bc))
⇒ a*(b*c) = a + b + c – ab – bc – ac + abc ...... (2)
From (1) and (2) we can clearly say that associativity hold for the binary operation ‘*’ on ‘Q – { – 1}’.
Show that the binary operation * on Z defined by a*b = 3a + 7b is not commutative.
Given that * is a binary operation on Z defined by a*b = 3a + 7b for all a,b∈Z.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ a*b = 3a + 7b
⇒ b*a = 3b + 7a
⇒ b*a≠a*b
∴ Commutative property doesn’t holds for given binary operation ‘*’ on ‘Z’.
On the set Z of integers a binary operation * is defined by a*b = ab + 1 for all a,b∈Z. Prove that * is not associative on Z.
Given that * is a binary operation on Z defined by a*b = ab + 1 for all a,b∈Z.
We know that associative property is (p*q)*r = p*(q*r), where x is a binary operation.
Let’s check the associativity of given binary operation:
⇒ (a*b)*c = (ab + 1)*c
⇒ (a*b)*c = ((ab + 1)×c) + 1
⇒ (a*b)*c = 1 + c + abc ...... (1)
⇒ a*(b*c) = a*(bc + 1)
⇒ a*(b*c) = (a×(bc + 1)) + 1
⇒ a*(b*c) = abc + a + 1 ...... (2)
From (1) and (2) we can clearly say that associativity doesn’t hold for the binary operation ‘*’ on ‘Z’.
Let S be the set of all real numbers except – 1 and let ‘*’ be an operation defined by a*b = a + b + ab for all ab∈S. Determine whether ‘*’ is a binary operation on ‘S’. if yes, Check its commutativity and associativity. Also, solve the equation (2*x)*3 = 7.
Given that ‘*’ is an operation that is valid on the set S which consists of all real numbers except – 1 i.e., R – { – 1} defined as a*b = a + b + ab
Let us assume a + b + ab = – 1
⇒ a + ab + b + 1 = 0
⇒ a(1 + b) + (1 + b) = 0
⇒ (a + 1)(b + 1) = 0
⇒ a = – 1 or b = – 1
But according to the problem, it is given that a≠ – 1 and b≠ – 1 so,
a + b + ab≠ – 1, so we can say that the operation ‘*’ defines a binary operation on set ‘S’.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ a*b = a + b + ab
⇒ b*a = b + a + ba = a + b + ab
⇒ b*a = a*b
∴ Commutative property holds for given binary operation ‘*’ on ‘S’.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒ (a*b)*c = (a + b + ab)*c
⇒ (a*b)*c = a + b + ab + c + ((a + b + ab)×c)
⇒ (a*b)*c = a + b + c + ab + ac + bc + abc ...... (1)
⇒ a*(b*c) = a*(b + c + bc)
⇒ a*(b*c) = a + b + c + bc + (a×(b + c + bc))
⇒ a*(b*c) = a + b + c + ab + bc + ac + abc ...... (2)
From (1) and (2) we can clearly say that associativity holds for the binary operation ‘*’ on ‘N’.
We need to also solve for x in the given expression:
⇒ (2*x)*3 = 7
⇒ (2 + x + 2x)*3 = 7
⇒ (2 + 3x)*3 = 7
⇒ 2 + 3x + 3 + ((2 + 3x)×3) = 7
⇒ 5 + 3x + 6 + 9x = 7
⇒ 11 + 12x = 7
⇒ 12x = – 4
⇒
⇒
∴ the value of x is .
On Q, the set of all rational numbers, * is defined by , show that * is not associative.
Given that * is a binary operation on Q defined by for all a,b∈Q.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒
⇒
⇒
⇒ ...... (1)
⇒
⇒
⇒
⇒ ...... (2)
From (1) and (2) we can clearly say that associativity doesn’t hold for the binary operation ‘*’ on ‘Q’.
On Z, the set of all integers, a binary operation * is defined by a*b = a + 3b – 4. Prove that * is neither commutative nor associative on Z.
Given that * is a binary operation on Z defined by a*b = a + 3b – 4 for all a,b∈Z.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ a*b = a + 3b – 4
⇒ b*a = b + 3a – 4
⇒ b*a ≠ a*b
∴ The commutative property doesn’t hold for given binary operation ‘*’ on ‘Z’.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒ (a*b)*c = (a + 3b – 4)*c
⇒ (a*b)*c = a + 3b – 4 + 3c – 4
⇒ (a*b)*c = a + 3b + 3c – 8 ...... (1)
⇒ a*(b*c) = a*(b + 3c – 4)
⇒ a*(b*c) = a + (3×(b + 3c – 4)) – 4
⇒ a*(b*c) = a + 3b + 9c – 12 – 4
⇒ a*(b*c) = a + 3b + 9c – 16 ...... (2)
From (1) and (2) we can clearly say that associativity doesn’t hold for the binary operation ‘*’ on ‘Z’.
On the set Q of all rational numbers if a binary operation * is defined by , prove that * is associative on Q.
Given that * is a binary operation on Q defined by for all a,b∈Q.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒
⇒
⇒ ...... (1)
⇒
⇒
⇒ ...... (2)
From (1) and (2) we can clearly say that associativity hold for the binary operation ‘*’ on ‘Q’.
The binary operation * is defined by on the set Q if all rational numbers. Show that * is associative.
Given that * is a binary operation on Q defined by for all a,b∈Q.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒
⇒
⇒ ...... (1)
⇒
⇒
⇒ ...... (2)
From (1) and (2) we can clearly say that associativity hold for the binary operation ‘*’ on ‘Q’.
On Q, the set of all rational numbers a binary operation * is defined by . Show that * is not associative on Q.
Given that * is a binary operation on Q defined by for all a,b∈Q.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒
⇒
⇒ ...... (1)
⇒
⇒
⇒
⇒ ...... (2)
From (1) and (2) we can clearly say that associativity doesn’t hold for the binary operation ‘*’ on ‘N’.
Let S be the set of all rational numbers except 1 and * be defined on S by a*b = a + b – ab, for all a,b∈S.
Prove that:
i. * is a binary operation on S
ii. * is commutative as well as associative.
Given that ‘*’ is an operation that is valid on the set S which consists of all real numbers except 1 i.e., R – {1} defined as a*b = a + b – ab
Let us assume a + b – ab = 1
⇒ a – ab + b – 1 = 0
⇒ a(1 – b) – 1(1 – b) = 0
⇒ (1 – a)(1 – b) = 0
⇒ a = 1 or b = 1
But according to the problem, it is given that a≠1 and b≠1 so,
a + b + ab≠1, so we can say that the operation ‘*’ defines a binary operation on set ‘S’.
We know that commutative property is p*q = q*p, where * is a binary operation.
Let’s check the commutativity of given binary operation:
⇒ a*b = a + b – ab
⇒ b*a = b + a – ba = a + b – ab
⇒ b*a = a*b
∴ Commutative property holds for given binary operation ‘*’ on ‘S’.
We know that associative property is (p*q)*r = p*(q*r)
Let’s check the associativity of given binary operation:
⇒ (a*b)*c = (a + b – ab)*c
⇒ (a*b)*c = a + b – ab + c – ((a + b – ab)×c)
⇒ (a*b)*c = a + b + c – ab – ac – bc + abc ...... (1)
⇒ a*(b*c) = a*(b + c – bc)
⇒ a*(b*c) = a + b + c – bc – (a×(b + c + bc))
⇒ a*(b*c) = a + b + c – ab – bc – ac + abc ...... (2)
From (1) and (2) we can clearly say that associativity holds for the binary operation ‘*’ on ‘S’.
Find the identity element in the set I + of all positive integers defined by a*b = a + b for all a,b∈I +.
Given that binary operation ‘*’ is valid for set ‘I + ’ of all positive integers defined by a*b = a + b for all a,b∈I +.
Let us assume a∈I + and the identity element that we need to compute be e∈I +.
We know that he Identity property is defined as follows:
⇒ a*e = e*a = a
⇒ a + e = a
⇒ e = a – a
⇒ e = 0
∴ The required Identity element w.r.t * is 0.
Find the identity element in the set of all rational numbers except – 1 with respect to * defined by a*b = a + b + ab
Given that binary operation ‘*’ is valid for set of all rational numbers Q defined by a*b = a + b + ab for all a,b∈R.
Let us assume a∈R and the identity element that we need to compute be e∈R.
We know that he Identity property is defined as follows:
⇒ a*e = e*a = a
⇒ a + e + ea = a
⇒ e + ae = a – a
⇒ e(1 + a) = 0
⇒ e = 0
∴ The required Identity element w.r.t * is 0.
If the binary operation * on the set Z is defined by a*b = a + b – 5, then find the identity element with respect to *.
Given that binary operation ‘*’ is valid for set ‘Z’ defined by a*b = a + b – 5 for all a,b∈Z.
Let us assume a∈Z and the identity element that we need to compute be e∈Z.
We know that he Identity property is defined as follows:
⇒ a*e = e*a = a
⇒ a + e – 5 = a
⇒ e – 5 = a – a
⇒ e = 5
∴ The required Identity element w.r.t * is 5.
On the set Z of integers, if the binary operation * is defined by a*b = a + b + 2, then find the identity element.
Given that binary operation ‘*’ is valid for set ‘Z’ of integers defined by a*b = a + b for all a,b∈Z.
Let us assume a∈Z and the identity element that we need to compute be e∈Z.
We know that he Identity property is defined as follows:
⇒ a*e = e*a = a
⇒ a + e + 2 = a
⇒ e + 2 = a – a
⇒ e = – 2
∴ The required Identity element w.r.t * is – 2.
Let * be a binary operation on Z defined by a * b = a + b – 4 for all a, b ∈ Z.
i. Show that ‘ * ’ is both commutative and associative.
ii. Find the identity element in Z.
iii. Find the invertible elements in Z
i. We are given with the set Z which is the set of integers.
A general binary operation is nothing but association of any pair of elements a, b from an arbitrary set X to another element of X. This gives rise to a general definition as follows:
A binary operation * on a set is a function * : A X A → A. We denote * (a, b) as a * b.
Here the function *: Z X Z → Z is given by a * b = a + b – 4
For the ‘ * ’ to be commutative, a * b = b * a must be true for all a, b belong to Z. Let’s check.
1. a * b = a + b – 4
2. b * a = b + a – 4
a * b = b * a (as shown by 1 and 2)
Hence ‘ * ’ is commutative.
For the ‘ * ’ to be associative, a * (b * c) = (a * b) * c must hold for every a, b, c ∈ Z.
3. a * (b * c) = a * (b + c – 4) = a + (b + c – 4) – 4 = a + b + c – 8
4. (a * b) * c = (a + b – 4) * c = (a + b – 4) + c – 4 = a + b + c – 8
a * (b * c) = (a * b) * c
Hence ‘ * ’ is associative.
ii. Identity Element: Given a binary operation *: Z X Z → Z, an element e ∈Z, if it exists, is called an identity of the operation * , if a * e = a = e * a ∀ a ∈Z.
Let e be the identity element of Z.
Therefore, a * e = a
⇒ a + e – 4 = a
⇒ e – 4 = 0
⇒ e = 4
iii. Given a binary operation with the identity element e in A, an element a Z is said to be invertible with respect to the operation, if there exists an element b in Z such that a * b = e = b * a and b is called the inverse of a and is denoted by a–1.
Let us proceed with the solution.
Let b Z be the invertible elements in Z of a, here a Z.
a * b = e (We know the identity element from previous)
⇒ a + b – 4 = 4
⇒ b = 8 – a
Let * be a binary operation on Q0 (Set of non – zero rational numbers) defined by a * b = 3ab/5 for all a, b ∈ Q0.
Show that * is commutative as well as associative. Also, find its identity element, if it exists.
We are given with the set Q0 which is the set of non - zero rational numbers.
A general binary operation is nothing but association of any pair of elements a, b from an arbitrary set X to another element of X. This gives rise to a general definition as follows:
A binary operation * on a set is a function * : A X A → A. We denote * (a, b) as a * b.
Here the function*:
For the ‘ * ’ to be commutative, a * b = b * a must be true for all a, b Q0. Let’s check.
⇒ a * b = b * a (as shown by 1 and 2)
Hence ‘ * ’ is commutative on Q0
For the ‘ * ’ to be associative, a * (b * c) = (a * b) * c must hold for every a, b, c ∈ Q0.
⇒ 3. = 4.
Hence ‘ * ’ is associative on Q0
Identity Element: Given a binary operation*: A X A → A, an element e ∈A, if it exists, is called an identity of the operation*, if a*e = a = e*a ∀ a ∈A.
Let e be the identity element of Q0.
Therefore, a * e = a (a ∈Q0)
iii. Given a binary operation with the identity element e in A, an element a A is said to be invertible with respect to the operation, if there exists an element b in A such that a * b = e = b * a and b is called the inverse of a and is denoted by a–1.
Let us proceed with the solution.
Here the function*
Let b Q0 be the invertible elements in Q0 of a, where a Q0.
∴a * b = e (We know the identity element from previous)
Let * be a binary operation on Q – {– 1} defined by a * b = a + b + ab for all, a, b ∈ Q – {– 1}. Then,
i. Show that ‘ * ’ is both commutative and associative on Q – {– 1}.
ii. Find the identity element in Q – {– 1}.
iii. Show that every element of Q – {– 1}. Is invertible. Also, find the inverse of an arbitrary element.
i. We are given with the set Q – {– 1}.
A general binary operation is nothing but association of any pair of elements a, b from an arbitrary set X to another element of X. This gives rise to a general definition as follows:
A binary operation * on a set is a function * : A X A → A. We denote * (a, b) as a * b.
Here the function *: Q – {– 1}X Q – {– 1} → Q – {– 1} is given by a * b = a + b + ab
For the ‘ * ’ to be commutative, a * b = b * a must be true for all a, b belong to Q – {– 1}. Let’s check.
1. a * b = a + b + ab
2. b * a = b + a + ab = a + b + ab
⇒ a * b = b * a (as shown by 1 and 2)
Hence ‘ * ’ is commutative on Q – {– 1}
For the ‘ * ’ to be associative, a * (b * c) = (a * b) * c must hold for every a, b, c ∈ Q – {– 1}.
3. a * (b * c) = a * (b + c + bc)
= a + (b + c + bc) + a(b + c + bc)
= a + b + c + ab + bc + ac + abc
4. (a * b) * c = (a + b + ab) * c
= a + b + ab + c + (a + b + ab)c
= a + b + c + ab + bc + ac + abc
⇒ 3. = 4.
Hence ‘ * ’ is associative on Q – {– 1}
ii. Identity Element: Given a binary operation*: A X A → A, an element e ∈A, if it exists, is called an identity of the operation*, if a*e = a = e*a ∀ a ∈A.
Let e be the identity element of Q – {– 1}, and a be an element of Q – {– 1}.
Therefore, a * e = a
⇒ a + e + ae = a
⇒ e + ea = 0
⇒ e(1 + a) = 0
⇒ e = 0.
(1 + a≠0 as the a is not equal to 1 as given in the question)
iii. Given a binary operation with the identity element e in A, an element a A is said to be invertible with respect to the operation, if there exists an element b in A such that a * b = e = b * a and b is called the inverse of a and is denoted by a–1.
Let us proceed with the solution.
Let b Q – {– 1} be the invertible element/s in Q – {– 1} of a, here a Q – {– 1}.
∴a * b = e (We know the identity element from previous)
⇒ a + b + ab = 0
⇒ b + ab = – a
⇒ b(1 + a) = – a
(Required invertible elements, a≠ – 1, b≠ – 1)
Let A = R0 x R, where R0 denote the set of all non – zero real numbers. A binary operation ‘O’ is defined on A as follows: (a, b) O (c, d) = (ac, bc + d) for all (a, b), (c, d) ∈ R0 x R.
i. Show that ‘O’ is commutative and associative on A
ii. Find the identity element in A
iii. Find the invertible elements in A.
In this question, we do not have individuals as elements but ordered pairs as the elements of the Cartesian product R0 x R. Hence this is the same problem as the above problems but in the form of ordered pairs belonging to the Cartesian product.
A = R0 x R
i. We are given with the set A which is the Cartesian product of R0 and R.
Here the function *: A X A → A is given by (a, b)°(c, d) = (ac, bc + d)
So here the operation on two ordered pairs gives us a ordered pair. So the first element of the first ordered pair (a) multiplies with the first element of the second ordered pair (c) to make (ac) in the resulting pair. To make the second element of the final pair, second element of the first ordered pair (b) multiplies with the first element of the second ordered pair (c) to form (bc) and then this is added to the second element of the second ordered pair (d) to make (bc + d). Hence the final ordered pair is (ac, bc + d). So this is the operation basically.
For the ‘0’ to be commutative, a * b = b * a must be true for all a, b belong to A. Let’s check.
Note: Here a, b represent the ordered pairs (a, b) and (c, d) respectively.
1. (a, b)°(c, d) = (ac, bc + d)
2. (c, d)°(a, b) = (ca, da + b)
⇒ a * b≠b * a (as shown by 1 and 2)
Hence ‘0’ is not commutative on A.
For the ‘ * ’ to be associative, a * (b * c) = (a * b) * c must hold for every a, b, c ∈ A. Here c = (e, f)
3. (a, b)°[(c, d)°(e, f)] = (a, b)°(ce, de + f)
= (ace, bce + de + f)
4. [(a, b)°(c, d)]°(e, f) = (ac, bc + d)°(e, f)
= (ace, [bc + d]e + f)
= (ace, bce + de + f)
⇒ 3. = 4.
Hence ‘0’ is associative on A.
ii. Identity Element: Given a binary operation *: A X A → A, an element e ∈A, if it exists, is called an identity of the operation * , if p * e = p = e * p ∀ p ∈A.
Here in this case, p and e are an ordered pairs.
Let e = (a, b) be the identity element of A and p = (x, y) where p A.
∴, (x, y)°(a, b) = (a, b)
⇒ (xa, ya + b) = (a, b)
⇒ ∴xa = a, ya + b = b
(Since, ordered pairs are only equal when both the first and second terms are equal)
⇒ x = 1 (x gets cancelled out)
⇒ y(1) + b = b
⇒ b = 0
The ordered pair (1, 0) is the identity of the operation ‘0’ on A.
iii. Given a binary operation with the identity element e in A, an element a A is said to be invertible with respect to the operation, if there exists an element b in A such that a * b = e = b * a and b is called the inverse of a and is denoted by a–1.
For this example, a, b, e are ordered pairs.
Let us proceed with the solution.
Let (c, d) A be the invertible elements in A of (a, b) here (a, b) A.
∴(a, b)°(c, d) = (1, 0) (We know the identity element from previous)
⇒ (ac, bc + d) = (1, 0)
⇒ ac = 1, bc + d = 0
(Since, ordered pairs are only equal when both the first and second terms are equal)
(Required invertible element)
Let ‘o’ be a binary operation on the set Q0 if all non - zero rational numbers defined by a o b = ab/2, for all a, b ∈ Q0.
i. Show that ‘o’ is both commutative and associate.
ii. Find the identity element in Q0.
iii. Find the invertible elements of Q0.
We are given with the set Q0 which is the set of non - zero rational numbers.
A general binary operation is nothing but association of any pair of elements a, b from an arbitrary set X to another element of X. This gives rise to a general definition as follows:
i. A binary operation * on a set is a function*:
Here the function o:
For the ‘o’ to be commutative, aob = boa must be true for all a, b Q0. Let’s check.
⇒ a * b = b * a (as shown by 1 and 2)
Hence ‘o’ is commutative on Q0
For the ‘o’ to be associative, ao(boc) = (aob)oc must hold for every a, b, c ∈ Q0.
Hence ‘o’ is associative on Q0
ii. Identity Element: Given a binary operation*: A X A → A, an element e ∈A, if it exists, is called an identity of the operation*, if a*e = a = e*a ∀ a ∈A.
Let e be the identity element of Q0.
Therefore, aoe = a (a ∈Q_0)
iii. Given a binary operation with the identity element e in A, an element a A is said to be invertible with respect to the operation, if there exists an element b in A such that a * b = e = b * a and b is called the inverse of a and is denoted by a–1.
Let us proceed with the solution.
Let b Q0 be the invertible elements in Q0 of a, where a Q0.
∴a * b = e (We know the identity element from previous)
On R – {1}, a binary operation * is defined by a * b = a + b – ab. Prove that * is commutative and associative. Find the identity element for * on R – {1}. Also, prove that every element of R – {1} is invertible.
i. We are given with the set R – {– 1}.
A general binary operation is nothing but an association of any pair of elements a, b from an arbitrary set X to another element of X. This gives rise to a general definition as follows:
A binary operation * on a set is a function * : A X A → A. We denote * (a, b) as a * b.
Here the function *: R – {1}X R – {1} → R – {1} is given by a * b = a + b – ab
For the ‘ * ’ to be commutative, a * b = b * a must be true for all a, b belong to R – {1}. Let’s check.
1. a * b = a + b – ab
2. b * a = b + a – ba = a + b – ab
⇒ a * b = b * a (as shown by 1 and 2)
Hence ‘ * ’ is commutative on R – {1}
For the ‘ * ’ to be associative, a * (b * c) = (a * b) * c must hold for every a, b, c ∈ R – {1}.
3. a * (b * c) = a * (b + c – bc)
= a + (b + c – bc) – a(b + c + bc)
= a + b + c – ab – bc – ac + abc
4. (a * b) * c = (a + b – ab) * c
= a + b – ab + c – (a + b – ab)c
= a + b + c – ab – bc – ac + abc
⇒ 3. = 4.
Hence ‘ * ’ is associative on R – {1}
ii. Identity Element: Given a binary operation*: A X A → A, an element e ∈A, if it exists, is called an identity of the operation*, if a*e = a = e*a ∀ a ∈A.
Let e be the identity element of R – {1} and a be an element of R – {1}.
Therefore, a * e = a
⇒ a + e – ae = a
⇒ e + ea = 0
⇒ e(1 – a) = 0
⇒ e = 0.
(1 – a≠0 as the a cannot be equal to 1 as the operation is valid in R – {1})
iii. Given a binary operation with the identity element e in A, an element a A is said to be invertible with respect to the operation, if there exists an element b in A such that a * b = e = b * a and b is called the inverse of a and is denoted by a–1.
Let us proceed with the solution.
Let b R – {1} be the invertible element/s in R – {1} of a, here a R – {1}.
∴a * b = e (We know the identity element from previous)
⇒ a + b – ab = 0
⇒ b – ab = – a
⇒ b(1 – a) = – a
Let R0 denote the set of all non - zero real numbers and let A = R0 x R0. If ‘0’ is a binary operation on A defined by (a, b)0(c, d) = (ac, bd), (c, d)∈A.
i. Show that ‘0’ is both commutative and associative on A
ii. Find the identity element in A
iii. Find the invertible element in A.
In this question, we do not have individuals as elements but ordered pairs as the elements of the Cartesian product R0 x R. Hence this is the same problem as the above problems but in the form of ordered pairs belonging to the Cartesian product.
A = R0 x R0
i. We are given with the set A which is the Cartesian product of R0 and R0.
Here the function *: A X A → A is given by (a, b)°(c, d) = (ac, bd)
So here the operation on two ordered pairs gives us a ordered pair. So the first element of the first ordered pair (a) multiplies with the first element of the second ordered pair (c) to make (ac) in the resulting pair. To make the second element of the final pair, second element of the first ordered pair (b) multiplies with the second element of the second ordered pair (c) to form (bd). Hence the final ordered pair is (ac, bd). So this is the operation basically.
For the ‘0’ to be commutative, p * q = p * q must be true for all p, q belong to A. Let’s check.
Note: Here p, q represent the ordered pairs (a, b) and (c, d) respectively.
1. (a, b)°(c, d) = (ac, bd)
2. (c, d)°(a, b) = (ca, db) = (ac, bd)
⇒ p * q = q * p (as shown by 1 and 2)
Hence ‘0’ is commutative on A.
For the ‘ * ’ to be associative, a * (b * c) = (a * b) * c must hold for every a, b, c ∈ A. Here r = (e, f)
3. (a, b)°[(c, d)°(e, f)] = (a, b)°(ce, df)
= (ace, bdf)
4. [(a, b)°(c, d)]°(e, f) = (ac, bd)°(e, f)
= (ace, bdf)
⇒ 3. = 4.
Hence ‘0’ is associative on A.
ii. Identity Element: Given a binary operation *: A X A → A, an element e ∈A, if it exists, is called an identity of the operation * , if p * e = p = e * p ∀ p ∈A.
Here in this case, p and e are an ordered pairs.
Let e = (a, b) be the identity element of A and p = (x, y) where p A.
∴, (x, y)°(a, b) = (x, y)
⇒ (xa, yb) = (x, y)
(Since, ordered pairs are only equal when both the first and second terms are equal)
⇒ ∴xa = x, yb = y
⇒ x(a – 1) = 0;y(b – 1) = 0
Since x, y≠0, we have, a – 1 = 0 and b – 1 = 0.
a = 1, b = 1
The ordered pair (1, 1) is the identity of the operation ‘0’ on A.
iii. Given a binary operation with the identity element e in A, an element a A is said to be invertible with respect to the operation, if there exists an element b in A such that a * b = e = b * a and b is called the inverse of a and is denoted by a–1.
For this example, a, b, e are ordered pairs.
Let us proceed with the solution.
Let (c, d) A be the invertible elements in A of (a, b). Here (a, b) A.
∴(a, b)°(c, d) = (1, 1) (We know the identity element from previous)
⇒ (ac, bd) = (1, 1)
⇒ ac = 1, bd = 1
(Since, ordered pairs are only equal when both the first and second terms are equal)
Let * be the binary operation on N defined by a * b = HCF of a and b. Does there exist identity for this binary operation on N?
The binary operation * on N defined as:
a * b = H.C.F. of a and b, a, b N.
Therefore,
b * a = H.C.F. of b and a = H.C.F
Hence, * is commutative on N.
Let a, b, c N.
a * (b * c) = a * (HCF of b and c) = HCF of a, b and c
(a * b) * c = (HCF of a and b) * c = HCF of a, b and c
For example, take the numbers 2, 4, 7 N.
Here, if the operation is applied to the above numbers as follows:
(2 * 4) * 7 = 1 * 7 = 1 (1 is the HCF of 2, 4 and HCF of 1, 7 is 1). Also,
2 * (4 * 7) = 2 * 1 = 1 (Similar as the above reason)
Therefore, * is associative.
Now, Identity Element:
Given a binary operation *: N X N → N, an element e ∈A, if it exists, is called an identity of the operation * , if a * e = a = e * a ∀ a ∈A.
But there does not exist any value of e ∈N such that a * e = a = e * a
Therefore, this operation does not have any identity.
Let A = RxR and * be a binary operation on A defined by (a, b) * (c, d) = (a + c, b + d). Show that * is commutative and associative. Find the binary element for * on A, if any.
A = R X R
For the ‘ * ’ to be commutative, p * q = p * q must be true for all p, q belong to A. Let’s check.
Note: Here p, q A represent the ordered pairs (a, b) and (c, d) respectively.
p * q = (a, b) * (c, d) = (a + c, b + d)
q * p = (c, d) * (a, b) = (c + a, d + b) = (a + c, b + d)
⇒ p * q = q * p (binary operation * is commutative)
For the ‘ * ’ to be associative, a * (b * c) = (a * b) * c must hold for every a, b, c ∈ A. Here r = (e, f)
p * (q * r) = (a, b) * ((c, d) * (e, f)) = (a, b) * (c + e, d + f) = (a + c + e, b + d + f)
(p * q) * r = ((a, b) * (c, d)) * (e, f) = (a + c, b + d) * (e, f) = (a + c + e, b + d + f)
⇒ p * (q * r) = (p * q) * r (Associative)
Binary elements:
Identity Element: Given a binary operation*: A X A → A, an element e ∈A, if it exists, is called an identity of the operation*, if p*e = p = e*p ∀ p ∈A.
Here p = (a, b) and e = (x, y). For the element e to exist,
(a, b) * (x, y) = (a, b)
⇒ (a + x, b + y) = (a, b)
⇒ a + x = a, b + y = b
Since, ordered pairs are only equal when both the first and second terms are equal
⇒ x = 0, y = 0
Hence the identity element e = (x, y) = (0, 0)
Given a binary operation with the identity element e in A, an element a A is said to be invertible with respect to the operation, if there exists an element b in A such that a * b = e = b * a and b is called the inverse of a and is denoted by a–1.
Let i = (r, s) be the inverse of p = (a, b) in A.
Therefore, (r, s) * (a, b) = e = (0, 0)
⇒ (r + a, s + b) = (0, 0)
∴r + a = 0, r + b = 0
r = – a, s = – b
Therefore, (r, s) = ( – a, – b) is the inverse pair.
Construct the composition table for x4 on set S = {0, 1, 2, 3}.
A composition table consists of elements which are a result of operation on the set elements.
Here we have the operation, a x4b = remainder of ab divided by 4 where a, b S.
This is the composition table of x4 on S = {0, 1, 2, 3}
For example, take 3 x4 2 = remainder of (3 x 2) divided by 4
We also see that the operation x4 is valid because all the output elements belong to the set S.
Construct the composition table for + 5 on set S = {0, 1, 2, 3, 4}
A composition table consists of elements which are a result of operation on the set elements.
Here we have the operation, a + 5 b = remainder of a + b divided by 5 where a, b S.
This is the composition table of x4 on S = {0, 1, 2, 3, 4}
For example, take 3 + 5 2 = remainder of (3 + 2) divided by 5
We also see that the operation + 5 is valid because all the output elements belong to the set S.
Construct the composition table for x6 on set S = {0, 1, 2, 3, 4, 5}.
A composition table consists of elements which are a result of operation on the set elements.
Here we have the operation, a x6 b = remainder of ab divided by 6 where a, b S.
This is the composition table of x4 on S = {0, 1, 2, 3, 4, 5}
For example, take 3 x6 2 = remainder of (3 x 2) divided by 6
Construct the composition table for x5 on Z5 = {0, 1, 2, 3, 4}
A composition table consists of elements which are a result of operation on the set elements.
Here we have the operation, a x5b = remainder of ab divided by 5 where a, b S. Similar as problem 1.
For the binary operation x10 on set S = {1, 3, 7, 9}, find the inverse of e3.
A composition table consists of elements which are a result of operation on the set elements.
Here we have the operation, a x10b = remainder of ab divided by 10 where a, b S.
For bS to be an inverse of aS, a x10b = e, where e is the identity element.
We know for multiplication operation we have the identity element as 1.
So e = 1.
For a = 3,
3 x10 (inverse of 3) = 1
From the table above, 3 x10 7 = 1
Hence we can conclude that ‘inverse of 3’ must be 7.
For the binary operation x7 on the set of S = {1, 2, 3, 4, 5, 6} compute 3 – 1x74.
A composition table consists of elements which are a result of an operation on the set elements.
Here we have the operation, a x7b = remainder of ab divided by 7 where a, b S.
For bS to be an inverse of aS, a x7b = e, where e is the identity element.
We know for multiplication operation we have the identity element as 1.
So e = 1.
For a = 3,
3 x7 (inverse of 3) = 1
From the table above, 3 x7 5 = 1
Hence we can conclude that ‘inverse of 3’ must be 5.
Therefore the expression:
3 – 1 x7 4 = 5 x7 4 = 6. (From the table above)
Find the inverse of 5 under multiplication modulo 11 on Z11
A composition table consists of elements which are a result of an operation on the set elements.
Here we have the operation, a x11 b = remainder of ab divided by 11 where a, b S
Example, 4 x11 9 = Remainder of (4 x 9) divided by 11
For bS to be an inverse of aS, a x7b = e, where e is the identity element.
We know for multiplication operation we have the identity element as 1.
So e = 1.
For a = 5,
5 x11 (inverse of 3) = 1
From the table above, 5 x11 9 = 1.
Hence, i = 9.
Write the multiplication table for the set of integers modulo 5.
A composition table consists of elements which are a result of operation on the set elements.
Here we have the operation, a x5b = remainder of ab divided by 5 where a, b S.
This is the composition table of x4 on S = {0, 1, 2, 3, 5}
For example, take 3 x4 2 = remainder of (3 x 2) divided by 4
We also see that the operation x4 is valid because all the output elements belong to the set S.
Consider the binary operation * and 0 defined by the following tables on set S = {a, b, c, d}.
We observe the following:
a * b = b * a = b
c * a = a * c = c
a * d = d * a = d
b * c = c * b = d
b * d = d * b = c
c * d = d * c = b
There ‘ * ’ is commutative.
Also,
a * (b * c) = a * (d) = d (From above)
(a * b) * c = (b) * c = d (Also from above)
Hence, ‘ * ’ is associative too.
Therefore, to find the identity element, e for e belong to S, we need:
a * e = e * a = a, a belong to S.
Therefore, a * e = a
e = a (since, a * a = a, from the given table)
To find out the inverse, a * x = e = b * x, x belongs to S
a * x = e
x = a (From the given table)
Therefore, the inverse of a is a, b is b, c is c and d is d.
Consider the binary operation * and 0 defined by the following tables on set S = {a, b, c, d}.
We observe the following:
a * b = b * a = a a * a = a
c * a = a * c = a b * b = b
a * d = d * a = a c * c = d
b * c = c * b = c d * d = c
b * d = d * b = d
c * d = d * c = b
There ‘ * ’ is commutative.
Also,
a * (b * c) = a * (c) = a (From above)
(a * b) * c = (a) * c = a (Also from above)
Hence, ‘ * ’ is associative too.
Therefore, to find the identity element, e for e belong to S, we need:
a * e = e * a = a, a belong to S.
Therefore, a * e = a
We find that there is no unique element e which satisfies the condition.
e = a or b or c or d for a.
Since the identity is not unique, the inverse will also be not unique.
Write the identity element for the binary operation * on the set R0 of all non-zero real numbers by the rule for all a, b ∈ R0.
The given binary operation is a*b =
And from the definition of identity element e,
a*e = a ........(i)
We have,
a*e = ……….(ii)
Thus from (i) & (ii) ,
= a
or, = 1
∴ e = 2
Hence the identity element for this binary operation is 2.
On the set Z of all integers a binary operation * is defined by a * b = a + b + 2 for all a, b ∈ Z. Write the inverse of 4.
The given binary operation is a*b = a+b+2
In order to find the inverse of the relation, we have to find the identity element first.
Let that identity element be e then
a*e = a
From que.
a*e = a+e+2
So, from the above two relations we have
a+e+2 = a
or, e+2 = 0
∴ e = -2
Hence the identity element is -2 for this binary operation.
Now let a’ be the inverse of this relation
Then as per the definition of the inverse element
a*a’ = e
∴ a+a’+2 = -2
∴ a’ = -4 -a
And for 4 ,i.e. a = 4
a’ = -4 – 4
∴ a’ = -8
Thus the inverse element of 4 is -8 for the given binary operation.
Define a binary operation on a set.
Binary operations on a set are calculations that combine two elements of the set (called operands) to produce another element of the same set.
The binary operations * on a non-empty set A are functions from A × A to A. The binary operation, *: A × A → A. It is an operation of two elements of the set whose domains and co-domain are in the same set.
Define a commutative binary operation on a set.
A binary operation * on a set A is commutative if a * b = b * a, for all (a, b) ∈ A (non-empty set).
Let addition be the operating binary operation for a = 8 and b = 9, a + b = 17 = b + a.
Define an associative binary operation on a set.
The associative property of binary operations hold if, for a non-empty set A, we can write (a * b) *c = a*(b * c).
Suppose N be the set of natural numbers and multiplication be the binary operation. Let a = 4, b = 5 c = 6. We can write (a × b) × c = 120 = a × (b × c).
Write the total number of binary operations on a set consisting of two elements.
Let A be a non-empty set having n elements. Then, the total number of binary operations on this set, i.e., from A×A is .
Here n = 2
Thus, total number of possible binary operations are = 16.
Write the identity element for the binary operation * defined on the set R of all real numbers by the rule for all a, b ∈ R.
The given binary operation is a*b =
Let e be the identity element
Thus, as per the definition of an identity element a*e = a
Applying this in the relation given we have
= a
Or, =1
∴ e =
Thus, the identity element for the given binary operation is .
Let * be a binary operation, on the set of all non-zero real numbers, given by for all a, b ∈ R – {0}. Write the value of x given by 2 * (x * 5) = 10.
The given binary operation is a*b =
We have to find the value of x so that 2*(x*5) = 10
Firstly, x*5 = = x
Now 2*(x*5) = 2*x =
As per the question, it is equal to 10
∴ = 10
∴ x = 25
Write the inverse of 5 under multiplication modulo 11 on the set {1, 2, …, 10}.
From the definition of multiplication modulo
a*b = (m is the base of the modulo)
Here the base is 11 and the set is {1,2,…,10}
So, we can make the composition table as :-
Thus, the identity element is 1.
So, the inverse of 5 is 9.
Define identity element for a binary operation defined on a set.
If A be the non-empty set and * be the binary operation on A. An element e is the identity element of a ∈ A, if a * e = a = e * a.
If the binary operation is addition(+), e = 0 and for * is multiplication(×), e = 1.
Write the composition table for the binary operation multiplication modulo 10(×10) on the set S = {2, 4, 6, 8}.
From the definition of multiplication modulo
a*b = (m is the base of the modulo)
And here the base is 3 and the set is S = {2,4,6,8}.
So, the composition table can be formed as :-
For the binary operation multiplication modulo 10(×10) defined on the set S = {1, 3, 7, 9}, write the inverse of 3.
From the definition of multiplication modulo
a*b = (m is the base of the modulo)
Here the base is 10 and the set is S = {1,3,7,9}
So, We can make the composition table as :-
The identity element is 1.
So, the inverse element of 3 is 7.
For the binary operation multiplication modulo 5(×5) defined on the set S = {1, 2, 3, 4}. Write the value of (3 ×5 4–1)–1.
From the definition of multiplication modulo
a*b = (m is the base of the modulo)
Here the base is 5 and the set is S = {1,2,3,4}
So, we can make a composition table as :-
The identity element is 1.
The inverse element of 4 is 4 itself.
∴ (3 4-1)-1 = (3 1) -1 = 3-1 = 2.
Write the composition table for the binary operation ×5 (multiplication modulo 5) on the set S = {0, 1, 2, 3, 4}.
From the definition of multiplication modulo
a*b = (m is the base of the modulo)
Here the base is 5 and the set is S = {0,1,2,3,4}
As the multiplication of 0 with any number will yield zero so we don’t consider it in the composition table.
So, we can make a composition table as :-
A binary operation * is defined on the set R of all real numbers by the rule for all a, b ∈ R. Write the identity element for * on R.
The given binary operation is a*b =
We have to find the identity element for the above relation.
Let that element be e.
∴ From the definition of identity element ,
a*e = a
∴ = a
Squaring both sides, we get,
=
∴ e = 0
Thus, the identity element for this operation is 0.
Let +6 (addition modulo 6) be a binary operation on S = {0, 1, 2, 3, 4, 5}. Write the value of 2 +6 4–1 +6 3–1.
From the definition of addition modulo :-
a*b = (m is the base of the modulo)
Here the base is 6 and the set is S = {0,1,2,3,4,5}
So, we can make the composition table as :-
It is clear that 1 is the identity element of this binary operation.
The inverse of 4 is 3 while the inverse of 3 is 4.
∴ 2 4-13-1= 2 3 4 = 3
Let * be a binary operation defined by a * b = 3a + 4b – 2. Find 4 * 5.
The given binary operation is a*b = 3a + 4b – 2
We have to find the value of 4*5
Applying the above relation we have
4*5 = 3(4) + 4(5) -2 = 12 + 20 – 2 = 30.
Thus the required solution is 30.
If the binary operation * on the set Z of integers is defined by a * b = a + 3b2, find the value of 2 * 4.
The given binary operation is a*b = a + 3
We have to find the value of 2*4
Applying the relation, we have
2*4 = 2 + 3() = 2 + 3(16) = 2 + 48 = 50.
Thus, the required solution is 50.
Let * be a binary operation on N given by a * b = HCF (a, b), a, b ∈ N. Write the value of 22 * 4.
The given binary operation is a*b = HCF(a,b)
We have to find the value of 22*4
Applying the relation we have
22*4 = HCF(22,4) = 2
Hence the required solution is 2.
Let * be a binary operation on set of integers I, defined by a * b = 2a + b –3. Find the value of 3 * 4.
The given binary operation is a*b = 2a+b-3
We have to find the value of 3*4
∴ 3*4 = 2(3) + 4 -3
= 6+ 1
= 7
Thus, the required value is 7.
Mark the correct alternative in each of the following:
If a * b = a2 + b2, then the value of (4 * 5) * 3 is
A. (42 + 52) + 32
B. (4 + 5)2 + 32
C. 412 + 32
D. (4 + 5 + 3)2
Given a * b = a2 + b2
⇒ (4 * 5) * 3 = [(42 + 52)]*3
= 41 * 3
= 412 + 32
Mark the correct alternative in each of the following:
If a * b denote the bigger among a and b and if a ⋅ b = (a * b) + 3, then 4.7 =
A. 14
B. 31
C. 10
D. 8
Given that a * b denote the bigger among a and b
and a ⋅ b = (a * b) + 3
⇒ 4 ⋅ 7 = (4 * 7) + 3
Now as 7 > 4
⇒ (4 * 7) + 3 = 7 + 3
= 10
Mark the correct alternative in each of the following:
On the power set p of a non-empty set A, we define an operation Δ by
Then which are of the following statements is true about Δ
A. commutative and associative without an identity
B. commutative but not associative with an identity
C. associative but not commutative without an identity
D. associative and commutative with an identity
∵
⇒
⇒
Mark the correct alternative in each of the following:
If the binary operation * on Z is defined by a * b = a2 – b2 + ab + 4, then value of (2 * 3) * 4 is
A. 233
B. 33
C. 55
D.–55
Given that a * b = a2 – b2 + ab + 4
To calculate (2 * 3) * 4
⇒ 2 * 3 = 22 – 32 + 2.3 + 4 = 5
⇒ (2 * 3) * 4 = 5 * 4
⇒ 5 * 4 = 52 – 42 + 5.4 + 4
= 33
Mark the correct alternative in each of the following:
For the binary operation * on Z defined by a * b = a + b + 1 the identity element is
A. 0
B. –1
C. 1
D. 2
For Identity element a * e = a = e * a , with ‘e’ being the identity element.
Given a * b = a + b + 1
⇒ a * e = a + e + 1 = a ….(1)
⇒ e * a = e + a + 1 = a …. (2)
⇒ e = -1 is the required identity element.
Mark the correct alternative in each of the following:
If a binary operation * is defined on the set Z of integers as a * b = 3a – b, then the value of (2 * 3) *4 is
A. 2
B. 3
C. 4
D. 5
Given that a * b = 3a – b
To calculate (2 * 3) * 4
⇒ 2 * 3 = 3.2 – 3 = 3
⇒ (2 * 3) * 4 = 3 * 4
⇒ 3 * 4 = 3.3 – 4
= 5
Mark the correct alternative in each of the following:
Q+ denote the set of all positive rational numbers. If the binary operation on Q+ is defined as a , then the inverse of 3 is
A.
B. 2
C.
D.
For Identity element a * e = a = e * a, with ‘e’ being the identity element.
Given
⇒
⇒
For Inverse element a * b = e = b * a , with ‘b’ being the inverse element ‘a’.
Given
Now for a = 3
⇒ ….(1)
⇒ ….(2)
⇒ is the required inverse element of a=3.
Mark the correct alternative in each of the following:
If G is the set of all matrices of the form , where x ∈ R – {0}, then the identity element with respect to the multiplication of matrices as binary operation, is
A.
B.
C.
D.
For Identity element a * e = a = e * a, with ‘e’ being the identity element.
Given
⇒
⇒
⇒ 2ae=a
⇒
Mark the correct alternative in each of the following:
Q+ is the set of all positive rational numbers with the binary operation * defined by for all a, b, ∈ Q+. The inverse of an element a ∈ Q+ is
A. a
B.
C.
D.
For Identity element a * e = a = e * a , with ‘e’ being the identity element.
Given
⇒
⇒ e=2
For Inverse element a * b = e = b * a , with ‘b’ being the inverse element ‘a’.
Given
….(1)
….(2)
is the required inverse element of a.
Mark the correct alternative in each of the following:
If the binary operation is defined on the set Q+ of all positive rational numbers by . Then, is equal to
A.
B.
C.
D.
Given that
To calculate
Mark the correct alternative in each of the following:
Let * be a binary operation defined on set Q – {1} by the rule a * b = a + b – ab. Then, the identity element for * is
A. 1
B.
C.
D. 0
For Identity element a * e = a = e * a , with ‘e’ being the identity element.
Given
⇒ a * e =a + e – ae
=a
⇒ a + e - ae=a
⇒ e(1-a) =0
⇒ e=0
Mark the correct alternative in each of the following:
Which of the following is true?
A. * defined by is a binary operation on Z
B. * defined by is a binary operation on Q
C. all binary commutative operations are associative
D. subtraction is a binary operation on N
Option C and D are self-explanatory and option A is false because The o/p will result in a rational quantity whereas according to the definition it belongs to an integer value.
The binary operation * defined on N by a * b = a + b + ab for all a, b ∈ N is
A. commutative only
B. associative only
C. commutative and associative both
D. none of these
1) Commutative:
⇒ a * b = a + b + ab …(1)
⇒ b * a = b + a + ba …(2)
⇒ a * b= b * a
2) Associative:
⇒ (a * b)* c = (a + b + ab) * c
(a + b + ab) * c = a + b + ab + c +(a + b + ab)c
(a + b + ab) * c = a + b + c + ab +ac + bc + abc
⇒ a * (b * c) = a * (b + c + bc)
a * (b + c + bc) = a + b + c + bc +( b + c + bc)a
a * (b + c + bc) = a + b + c + ab +ac + bc + abc
⇒ (a * b)* c = a * (b * c)
Mark the correct alternative in each of the following:
If a binary operation * is defined by a * b = a2 + b2 + ab + 1, then (2 * 3) * 2 is equal to
A. 20
B. 40
C. 400
D. 445
Given a * b = a2 + b2 + ab + 1
⇒ (2 * 3) * 2 = [(22 + 32 + 2.3 + 1)]*2
⇒ [(22 + 32 + 2.3 + 1)]*2 = 20 * 2
⇒ 20 * 2 = 202 + 22 + 20.2 + 1 = 445
Mark the correct alternative in each of the following:
Let * be a binary operation on R defined by a * b = ab + 1. Then, * is
A. commutative but not associative
B. associative but not commutative
C. neither commutative nor associative
D. both commutative and associative
1) Commutative:
⇒ a * b = ab + 1 …(1)
⇒ b * a = ba + 1 …(2)
⇒ a * b= b * a
2) NOT Associative:
⇒ (a * b)* c = (ab + 1) * c
(ab + 1) * c = (ab + 1)c + 1
(ab + 1) * c = abc + c + 1
⇒ a * (b * c) = a * (bc + 1)
a * (bc + 1) = a(bc + 1) + 1
a * (bc + 1) = abc + a
⇒ (a * b)* c ≠ a * (b * c)
Mark the correct alternative in each of the following:
Subtraction of integers is
A. commutative but not associative
B. commutative and associative
C. associative but not commutative
D. neither commutative nor associative
1) NOT Commutative:
⇒ a * b = a - b …(1)
⇒ b * a = b - a …(2)
⇒ a * b ≠ b * a
2) NOT Associative:
⇒ (a * b)* c = (a - b) * c
(a - b) * c = (a - b) - c
(a - b) * c = a – b - c
⇒ a * (b * c) = a * (b - c)
a * (b - c) = a – (b - c)
a * (b - c) = a – b + c
⇒ (a * b)* c ≠ a * (b * c)
Mark the correct alternative in each of the following:
The law a + b = b + a is called
A. closure law
B. associative law
C. commutative law
D. distributive law
The law a + b = b + a is called is called commutative law.
Eg. 2+3=3+2
Mark the correct alternative in each of the following:
An operation * is defined on the set Z of non-zero integers by for all a, b ∈ Z. Then the property satisfied is
A. closure
B. commutative
C. associative
D. none of these
1) NOT Commutative:
2) NOT Associative:
Mark the correct alternative in each of the following:
On Z an operation * is defined by a * b = a2 + b2 for all a, b ∈ Z. The operation * on Z is
A. commutative and associative
B. associative but not commutative
C. not associative
D. not a binary operation
1) Commutative:
⇒ a * b = a2 + b2 …(1)
⇒ b * a = b2 + a2 …(2)
⇒ a * b= b * a
2) NOT Associative:
⇒ (a * b)* c = (a2 + b2) * c
= (a2 + b2)2 + c2
⇒ a * (b * c) = a * (b2 + a2)
= a2 + (b2 + c2)2
⇒ (a * b)* c ≠ a * (b * c)
Mark the correct alternative in each of the following:
A binary operation * on Z defined by a * b = 3a + b for all a, b ∈ Z, is
A. commutative
B. associative
C. not commutative
D. commutative and associative
Commutative:
⇒ a * b = 3a + b …(1)
⇒ b * a = 3b + a …(2)
⇒ a * b ≠ b * a
Mark the correct alternative in each of the following:
Let * be a binary operation on Q+ defined by for all a, b ∈ Q+. The inverse of 0.1 is
A. 105
B. 104
C. 106
D. none of these
For Identity element a * e = a = e * a , with ‘e’ being the identity element.
Given
For Inverse element a * b = e = b * a , with ‘b’ being the inverse element ‘a’.
Given
Now for a = 0.1
⇒ b =105 is the required inverse element of a=0.1.
Mark the correct alternative in each of the following:
Let * be a binary operation on N defined by a * b = a + b + 10 for all a, b ∈ N. The identity element for * in N is
A. -10
B. 0
C. 10
D. non-existent
For Identity element a * e = a = e * a, with ‘e’ being the identity element.
Given a * b = a + b + 10
⇒ a * e =a+e+10=a
⇒ e=-10 (Not a Natural number)
Mark the correct alternative in each of the following:
Consider the binary operation * defined on Q - {1} by the rule a * b = a + b – ab for all a, b ∈ Q – {1}. The identity element in Q – {1} is
A. 0
B. 1
C.
D. -1
For Identity element a * e = a = e * a, with ‘e’ being the identity element.
Given a * b =a + b - ab
⇒ a * e =a + e – ae
=a
⇒ e(1-a) =0
⇒ e=0
Mark the correct alternative in each of the following:
For the binary operation * defined on R – {1} by the rule a * b = a + b + ab for all a, b ∈ R – {1}, the inverse of a is
A. -a
B.
C.
D. a2
For Identity element a * e = a = e * a , with ‘e’ being the identity element.
Given a * b =a + b + ab
⇒ a * e =a + e + ea
=a
⇒ e=0
For Inverse element a * b = e = b * a , with ‘b’ being the inverse element ‘a’.
Given a * b =a + b + ab
Now for a = 0.1
⇒ a * b =a + b + ab
=0 ….(1)
⇒ b * a =a + b + ab
=0 ….(2)
⇒ is the required inverse element of a .
Mark the correct alternative in each of the following:
For the multiplication of matrices as a binary operation on the set of all matrices of the form , a, b ∈ R the inverse of is
A.
B.
C.
D.
For Identity element a * e = a = e * a , with ‘e’ being the identity element.
The identity element of matrix multiplication is the identity matrix.
The identity element e
Therefore, the inverse element of is the inverse of the matrix.
Given: A
A-1
A-1
A-1 =
Hence, C is the correct answer.
Mark the correct alternative in each of the following:
On the set Q+ of all positive rational numbers a binary operation * is defined by for all a, b ∈ Q+. The inverse of 8 is
A.
B.
C. 2
D. 4
For Identity element a * e = a = e * a , with ‘e’ being the identity element.
Given
⇒
⇒ e=2
For Inverse element a * b = e = b * a , with ‘b’ being the inverse element a=8 .
Given
….(1)
….(2)
⇒ is the required inverse element of a=8.
Mark the correct alternative in each of the following:
Let * be a binary operation defined on Q+ by the rule for all a, b ∈ Q+. The inverse of 4 * 6 is
A.
B.
C.
D. none of these
As
=8
For Identity element a * e = a = e * a , with ‘e’ being the identity element.
Given
⇒
⇒ e=3
For Inverse element a * b = e = b * a , with ‘b’ being the inverse element a=8 .
Given
⇒ ….(1)
⇒ ….(2)
⇒ is the required inverse element of .
Mark the correct alternative in each of the following:
The number of binary operation that can be defined on a set of 2 elements is
A. 8
B. 4
C. 16
D. 64
As Total number of binary operations that can be defined on a set on N elements are
⇒ For N=2 ⇒
Hence the number of binary operations that can be defined on a set of 2 elements are 16.
Mark the correct alternative in each of the following:
The number of commutative binary operations that can be defined on a set of 2 elements is
A. 8
B. 6
C. 4
D. 2
As Total number of commutative binary operations that can be defined on a set on N elements are
⇒ For N=2
=2
Hence the number of binary operations that can be defined on a set of 2 elements are 16.