Showing posts with label 4. Show all posts
Showing posts with label 4. Show all posts

Tuesday, 11 June 2013

Is ∗ defined on the set {1, 2, 3, 4, 5} by a ∗ b = L.C.M. of a and b a binary operation? Justify your answer.

Is ∗ defined on the set {1, 2, 3, 4, 5} by a ∗ b = L.C.M. of a and b a binary operation? Justify your answer.
Is ∗ defined on the set {1, 2, 3, 4, 5} by a ∗ b = L.C.M. of a and b a binary operation? Justify your answer.
Is ∗ defined on the set {1, 2, 3, 4, 5} by a ∗ b = L.C.M. of a and b a binary operation? Justify your answer.


Let ∗′ be the binary operation on the set {1, 2, 3, 4, 5} defined by a ∗′ b = H.C.F. of a and b. Is the operation ∗′ same as the operation ∗ defined in Exercise 4 above? Justify your answer.

Let ∗′ be the binary operation on the set {1, 2, 3, 4, 5} defined by a ∗′ b = H.C.F. of a and b. Is the operation ∗′ same as the operation ∗ defined in Exercise 4 above? Justify your answer.

Answer

Let ∗′ be the binary operation on the set {1, 2, 3, 4, 5} defined by a ∗′ b = H.C.F. of a and b
 


Consider a binary operation ∗ on the set {1, 2, 3, 4, 5} given by the following multiplication table (Table 1.2).

Consider a binary operation ∗ on the set {1, 2, 3, 4, 5} given by the following
multiplication table (Table 1.2).
(i) Compute (2 ∗ 3) ∗ 4 and 2 ∗ (3 ∗ 4)
(ii) Is ∗ commutative?
(iii) Compute (2 ∗ 3) ∗ (4 ∗ 5).
(Hint: use the following table)











Answer:
Consider a binary operation ∗ on the set {1, 2, 3, 4, 5} given by the following multiplication table (Table 1.2).

Consider the binary operation ∧ on the set {1, 2, 3, 4, 5} defined by a ∧ b = min {a, b}. Write the operation table of the operation ∧ .

Consider the binary operation ∧ on the set {1, 2, 3, 4, 5} defined by a ∧ b = min {a, b}. Write the operation table of the operation ∧ .
Answer
Consider the binary operation ∧ on the set {1, 2, 3, 4, 5} defined by a ∧ b = min {a, b}. Write the operation table of the operation ∧ .

Saturday, 8 June 2013

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.




Answer 
Method -1 
Let A = {1, 2, 3, 4, 5, 6}.
A relation R is defined on set A as: R = {(a, b): b = a + 1}
R = {(1, 2), (2, 3), (3, 4), (4, 5), (5, 6)} We can find (a, a) R, where a A.
For instance,
(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6) R
R is not reflexive.
It can be observed that (1, 2) R, but (2, 1) R.
R is not symmetric. Now, (1, 2), (2, 3) R
But,
(1, 3) R
R is not transitive
Hence, R is neither reflexive, nor symmetric, nor transitive.


Please share it or give us g+ if it is use full thanks 
Method- 2 
 
















Please Like us on Facebook or give us g+ 
Thanks
Do you know any other method of solving of this question ?

3. 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.
please type on comment box
  

Please g plus the post