State whether the following statements are true or false. Justify.
(i) For an arbitrary binary operation * on a set N, a*a = a ∀ a ∈N.
(ii) If * is a commutative binary operation on N, then a * (b * c) = (c * b) * a.
Consider a binary operation * on N defined as a * b = a3 + b3 . Choose the correct answer.
(A) Is * both associative and commutative ?
(B) Is * commutative but not associative?
(C) Is * associative but not commutative?
(D) Is * neither commutative nor associative?
Let A = Q x Q. Let be a binary operation on A defined by (a, b) * (c, d) = (ac, ad + b).
Then
(i) Find the identify element of (A, *)
(ii) Find the invertible elements of (A, *)
Define binary operation ‘*’ on Q as follows : a * b = a + b – ab, a, b∈ Q
(i) Find the identity element of (Q, *).
(ii) Which elements in (Q. *) are invertible?
Let x, m be any two odd natural numbers.
Then f(x) = f (m) ⇒ x + 1 = m + 1 ⇒ x = m Let x, m be any two even natural numbers.
Then f (x) = f (m) ⇒ x – 1 = m – 1 ⇒ x = m
is both the cases, f (x) = f(m) ⇒ x = m If x is even and m is odd, then x ≠ m Also f (x) is odd and f (m) is even. So, f (x) ≠ f(m) ∴ x ≠ m ⇒ f (x) ≠ f (m) ∴ f is one-to-one.
Now, let x be an arbitrary natural number. If x is an odd number, then there exists an even natural number (x + 1) such that f(x + 1) = x + 1–1 = x. If x is an even number, then there exists an odd natural number (x – 1) such that
Let x, m be any two odd natural numbers.
Then f(x) = f (m) ⇒ x + 1 = m + 1 ⇒ x = m Let x, m be any two even natural numbers.
Then f (x) = f (m) ⇒ x – 1 = m – 1 ⇒ x = m
is both the cases, f (x) = f(m) ⇒ x = m If x is even and m is odd, then x ≠ m Also f (x) is odd and f (m) is even. So, f (x) ≠ f(m) ∴ x ≠ m ⇒ f (x) ≠ f (m) ∴ f is one-to-one.
Now, let x be an arbitrary natural number. If x is an odd number, then there exists an even natural number (x + 1) such that f(x + 1) = x + 1–1 = x. If x is an even number, then there exists an odd natural number (x – 1) such that
f (x – 1) = (x – 1) + 1 = x
∴ every x ∈ N has its pre-image in N
∴ f : N → N is onto.
∴ f is one-to-one and onto.