![Misc 2 - Chapter 1 Class 12 Relation and Functions - Part 2](https://d1avenlh0i1xmr.cloudfront.net/7b716d8f-215f-4280-b9a8-089a8e16b4eb/slide2.jpg)
![Misc 2 - Chapter 1 Class 12 Relation and Functions - Part 3](https://d1avenlh0i1xmr.cloudfront.net/a91ed19d-3928-49bd-8087-09a776bf50ad/slide3.jpg)
![Misc 2 - Chapter 1 Class 12 Relation and Functions - Part 4](https://d1avenlh0i1xmr.cloudfront.net/f2ccf505-483d-44ef-b9fa-97e5d1aa6d0d/slide4.jpg)
![Misc 2 - Chapter 1 Class 12 Relation and Functions - Part 5](https://d1avenlh0i1xmr.cloudfront.net/0fca6f57-0383-464a-a9f9-9239c8e91426/slide5.jpg)
![Misc 2 - Chapter 1 Class 12 Relation and Functions - Part 6](https://d1avenlh0i1xmr.cloudfront.net/fb497ec6-28af-48d9-bb53-9568b0ccc08b/slide6.jpg)
![Misc 2 - Chapter 1 Class 12 Relation and Functions - Part 7](https://d1avenlh0i1xmr.cloudfront.net/b20ec138-4a10-46b9-9615-40fd816be576/slide7.jpg)
![Misc 2 - Chapter 1 Class 12 Relation and Functions - Part 8](https://d1avenlh0i1xmr.cloudfront.net/8ed1e58b-0dac-49d4-bd53-77c8c2cc443c/slide8.jpg)
![Misc 2 - Chapter 1 Class 12 Relation and Functions - Part 9](https://d1avenlh0i1xmr.cloudfront.net/5ecf87e1-f42b-4407-a444-3fabb161c734/slide9.jpg)
Miscellaneous
Last updated at April 16, 2024 by Teachoo
Question 2(Method 1) Let f: W → W be defined as f(n) = n − 1, if is odd and f(n) = n + 1, if n is even. Show that f is invertible. Find the inverse of f. Here, W is the set of all whole numbers. f(n) = 𝑛−1 , 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑𝑛+1, 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛 Step 1 Let f(n) = y , such that y ∈ W n = 𝑦−1, 𝑖𝑓 𝑦 𝑖𝑠 𝑜𝑑𝑑𝑦+1 , 𝑖𝑓 𝑦 𝑖𝑠 𝑒𝑣𝑒𝑛 Let g(y) = 𝑦−1, 𝑖𝑓 𝑦 𝑖𝑠 𝑜𝑑𝑑𝑦+1 , 𝑖𝑓 𝑦 𝑖𝑠 𝑒𝑣𝑒𝑛 where g: W → W Step 2: gof = g(f(n)) ∴ gof = n = IW Now, f(n) = 𝑛−1 , 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑𝑛+1, 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛 & g(y) = 𝑦−1, 𝑖𝑓 𝑦 𝑖𝑠 𝑜𝑑𝑑𝑦+1 , 𝑖𝑓 𝑦 𝑖𝑠 𝑒𝑣𝑒𝑛 Step 3: fog = f(g(y)) ∴ fog = y = IW Since gof = IW and fog =IW f is invertible and inverse of f = g(y) = 𝑦−1, 𝑖𝑓 𝑦 𝑖𝑠 𝑜𝑑𝑑𝑦+1 , 𝑖𝑓 𝑦 𝑖𝑠 𝑒𝑣𝑒𝑛 Now g(y) = 𝑦−1, 𝑖𝑓 𝑦 𝑖𝑠 𝑜𝑑𝑑𝑦+1 , 𝑖𝑓 𝑦 𝑖𝑠 𝑒𝑣𝑒𝑛 Replacing y with n g(n) = 𝑛−1 , 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑𝑛+1, 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛 = f(n) ∴ Inverse of f is f itself Misc 2 (Method 2) Let f: W → W be defined as f(n) = n − 1, if is odd and f(n) = n + 1, if n is even. Show that f is invertible. Find the inverse of f. Here, W is the set of all whole numbers. f(n) = 𝑛−1 , 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑𝑛+1, 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛 f is invertible if f is one-one and onto Check one-one There can be 3 cases • x1 & x2 both are odd • x1 & x2 both are even • x1 is odd & x2 is even If x1 & x2 are both odd f(x1) = x1 + 1 f(x2) = x2 + 1 Putting f(x1) = f(x2) x1 + 1 = x2 + 1 x1 = x2 If x1 & x2 are both are even f(x1) = x1 – 1 f(x2) = x2 – 1 If f(x1) = f(x2) x1 – 1 = x2 – 1 x1 = x2 If x1 is odd and x2 is even f(x1) = x1 + 1 f(x2) = x2 – 1 If f(x1) = f(x2) x1 + 1 = x2 – 1 x2 – x1 = 2 which is impossible as difference between even and odd number can never be even Hence, if f(x1) = f(x2) , x1 = x2 ∴ function f is one-one Check onto f(n) = 𝑛−1 , 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑𝑛+1, 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛 Let f(n) = y , such that y ∈ W n = 𝑦−1, 𝑖𝑓 𝑦 𝑖𝑠 𝑜𝑑𝑑𝑦+1 , 𝑖𝑓 𝑦 𝑖𝑠 𝑒𝑣𝑒𝑛 Hence, if y is a whole number, n will also be a whole number i.e. n ∈ W Thus, f is onto. Finding inverse f(n) = 𝑛−1 , 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑𝑛+1, 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛 For finding inverse, we put f(n) = y and find n in terms of y We have done that while proving onto n = 𝑦−1, 𝑖𝑓 𝑦 𝑖𝑠 𝑜𝑑𝑑𝑦+1 , 𝑖𝑓 𝑦 𝑖𝑠 𝑒𝑣𝑒𝑛 ∴ Inverse of f = g(y) = 𝑦−1, 𝑖𝑓 𝑦 𝑖𝑠 𝑜𝑑𝑑𝑦+1 , 𝑖𝑓 𝑦 𝑖𝑠 𝑒𝑣𝑒𝑛 where g: W → W Now g(y) = 𝑦−1, 𝑖𝑓 𝑦 𝑖𝑠 𝑜𝑑𝑑𝑦+1 , 𝑖𝑓 𝑦 𝑖𝑠 𝑒𝑣𝑒𝑛 Replacing y with n g(n) = 𝑛−1 , 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑𝑛+1, 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛 = f(n) ∴ Inverse of f is f itself