You are here
Ex 1.4, 5 - Chapter 1 Class 12 Relation and Functions
Last updated at Dec. 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, 5 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. * is defined on set {1, 2, 3, 4, 5} and a * b = H.C.F of a and b. The operation table is: Note that the operation tables for * and * are the same. Thus, the operation * is same as the operation*.
