You are here
Ex 1.4, 8 - Chapter 1 Class 12 Relation and Functions
Last updated at April 16, 2024 by Teachoo
Whether binary commutative/associative or not
Chapter 1 Class 12 Relation and Functions
Concept wise
- Relations - Definition
- Empty and Universal Relation
- To prove relation reflexive, transitive, symmetric and equivalent
- Finding number of relations
- Function - Definition
- To prove one-one & onto (injective, surjective, bijective)
- Composite functions
- Composite functions and one-one onto
- Finding Inverse
- Inverse of function: Proof questions
- Binary Operations - Definition
-
Whether binary commutative/associative or not
- Binary operations: Identity element
- Binary operations: Inverse
Transcript
Ex 1.4, 8 Let * be the binary operation on N defined by a * b = H.C.F. of a and b. Is * commutative? Is *associative? Does there exist identity for this binary operation on N? Check commutative * is commutative if a * b = b * a Since a * b = b * a ∀ a, b ∈ N * is commutative Check associative * is associative if (a * b) * c = a * (b * c) Since (a * b) * c = a * (b * c) ∀ a, b ∈ N * is associative Identity Element e is the identity of * if a * e = e * a = a i.e. HCF of a & e = HCF of e & a = a There is no value of e which satisfies the given condition Example: Let e = 1 HCF of a & 1 = 1 ≠ a HCF of 1 & a = 1 ≠ a Thus, there is no identity of * in N.
