(a) let, a = p/q and b = r/s belong to Q+
Then, a*b = a/b = ps/qr > 0
Hence, a/b belongs to Q+ for all a, b in Q+
So, Q+ is closed under the operation *
Also, a*b = a/b = ps/qr
&, b*a = b/a = qr/ps
So, a*b is not equal to b*a, in general. So, * is not commutative.
Take, a = 2 & b = 6. Then, a*b = 2/6 = 1/3 while, b*a = b/a = 6/2 = 3
So, a*b is not equal to b*a. Hence not commutative.
Similarly, * is not associative.
Take, c = 12
Then, b*c = b/c = 6/12 = 1/2
and, a*(b*c) = 2/(1/2) = 4
And, a*b = 1/3 then,
(a*b)*c = (1/3)/12 = 1/36
So, a*(b*c) (a*b)*c
So, * is not associative.
(b).take, a = 6 & b = 12
Then, a*b = 6/12 = 1/2 which does not belong to N
So, N is not closed under *
Hence, * is not a binary operation on N.
1. Determine whether * is a binary operation on the given set. If it is a...
5. Determine whether the binary operation is commutative and whether it is associative. Justify your answers. (a) the operation on R defined by ab- a b+ab (b) the operation on Q-(0) defined by ab
Consider the following examples of a set S and a binary operation on S. Show with proof that the binary operation is indeed a binary operation, whether the binary operation has an identity, whether each element has an inverse, and whether the binary operation is associative. Hence, determine whether the set S is a group under the given binary operation. (f) S quadratic residues in Z101 under multiplication modulo 101 Consider the following examples of a set S and a...
5, b) Determine whether the definition of * does give a binary operation on the set and give reason why a-b On R define * by letting a * b a k IV
5) Determine whether the given definition does give a binary operation on the indicated set. In other words determine whether the given ser is closed under the given operation. • If so, prove that it satisfies closure. . If not, find a counter-example and show how it fails closure. e. On K = { : a, b e m}, under usual matrix multiplication X.
Modern Algebra True or False and Justification. Any binary operation defined on a set containing a single element is commutative and associative.
Modern Algebra 5) Consider the ollowing sets, S, together with the defined binary operation. In each case, determine if the set is closed under the given operation, if the operation is associative and if the operation is commutative: ii) S R a -a b 6) Define the binary operation, multiplication modulo 3 in much the same way as we did addition modulo 3. That is, perform ordinary multiplication and then reduce the result modulo 3. Let S-(0, 1,2. Create two...
. Define a binary operation on Q by a Ab : 90 6) Determine a*b for a=5 and b= 4 (6) Prove the associative property co) Verify the identity is e= 2, then prove the inverse property
Only 8 plz is In Exercises 7 through 11, determine whether the binary operacion * defined is commutative and whether associative. 7. * defined on Z by letting a *b = a - b 8. * defined on Q by letting a + b = ab + 1 9. * defined on Q by letting a b = ab/2 10. * defined on Z by letting a +b = 20 11. defined on 7+ hy letting a bea
Let G be a finite set with an associative, binary operation given by a table in which each element of the set G appears exactly once in each row and column. Prove that G is a group. How do you recognize the identity element? How do you recognize the inverse of an element? (abstract algebra)
Assume associative and commutative law and C to be a set. Q = {c ∈ C | c * c = c}, prove it is closed under the binary operation *