Ex 1.2 , 9 - Chapter 1 Class 12 Relation and Functions
Last updated at April 16, 2024 by Teachoo
To prove one-one & onto (injective, surjective, bijective)
One One function
You are here
You are here
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.2, 9 Let f: N → N be defined by f (n) = {█((𝑛 + 1)/2 ", if n is odd" @𝑛/2 ", if n is even" )┤ for all n ∈ N. State whether the function f is bijective. Justify your answer. f (n) = {█((𝑛 + 1)/2 ", if n is odd" @𝑛/2 ", if n is even" )┤ for all n ∈ N. Check one-one f(1) = (1 + 1)/2 = 2/2 = 1 f(2) = 2/2 = 1 Since, f(1) = f(2) but 1 ≠ 2 Both f(1) & f(2) have same image 1 ∴ f is not one-one Check onto f (n) = {█((𝑛 + 1)/2 ", if n is odd" @𝑛/2 ", if n is even" )┤ for all n ∈ N Let f(x) = y , such that y ∈ N When n is odd y = (𝑛 + 1)/2 2y = n + 1 2y – 1 = n n = 2y – 1 Hence, for y is a natural number , n = 2y – 1 is also a natural number When n is even y = 𝑛/2 2y = n n = 2y Hence for y is a natural number , n = 2y is also a natural number Thus, for every y ∈ N, there exists x ∈ N such that f(n) = y Hence, f is onto
