Example 22 - Chapter 1 Class 12 Relation and Functions
Last updated at April 17, 2024 by Teachoo
To prove one-one & onto (injective, surjective, bijective)
One One function
Onto function
One One and Onto functions (Bijective functions)
Example 7
Example 8 Important
Example 9
Example 11 Important
Misc 2
Ex 1.2, 5 Important
Ex 1.2 , 6 Important
Example 10
Ex 1.2, 1
Ex 1.2, 12 (MCQ)
Ex 1.2, 2 (i) Important
Ex 1.2, 7 (i)
Ex 1.2 , 11 (MCQ) Important
Example 12 Important
Ex 1.2 , 9
Ex 1.2 , 3
Ex 1.2 , 4
Example 25
Example 26 Important
Ex 1.2 , 10 Important
Misc 1 Important
Example 13 Important
Example 14 Important
Ex 1.2 , 8 Important
Example 22 Important You are here
Misc 4 Important
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
Example 22 (Method 1) Find the number of all one-one functions from set A = {1, 2, 3} to itself. Since f is one-one Hence every element 1, 2, 3 has either of image 1, 2, 3 and that image is unique Total number of one-one function = 6 Example 22 (Method 2) Find the number of all one-one functions from set A = {1, 2, 3} to itself. Since f is one-one Hence every element 1, 2, 3 has either of image 1, 2, 3 and that image is unique Total number of one-one function = 3 × 2 × 1 = 6
