# Let f : W → W be defined as f (n) = n – 1, if n 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.

It is given that f : W W be defined as

f(n) =

Let f(n) = f(m)

We can see that if n is odd and m is even, then we will have n -1 = m +1.

n – m = 2

this is impossible

Similarly, the possibility of n being even and m being odd can also be ignored under a similar argument.

Therefore, both n and m must be either odd or even.

Now, if both n and m are odd, then we get:

f(n) = f(m)

n -1 = m -1

n = m

Again, if both n and m are even, the we get:

f(n) = f(m)

n +1 = m + 1

n = m

f is one – one.

Now, it is clear that any odd number 2r + 1 in co-domain N is the image of 2r in domain N and any even number 2r in co – domain N is the image of 2r +1 in domain N.

f is onto.

f is an invertible function.

Now, let us define g : W W be defined as

Now, when n is odd:

gof(n) = g(f(n)) = g (n-1) = n -1 +1 = n (when n is odd, then n-1 is even)

And when n is even:

gof(n) = g(f(n)) = g (n+1) = n +1 -1 = n (when n is even, then n+1 is odd)

Similarly, when m is odd:

fog(m) = f(g(m)) = f (m-1) = m -1 +1 = m

And when n is even:

fog(m) = f(g(m)) = f (m+1) = m +1 -1 = m

Therefore, gof = IW and fog = IW

Therefore, f is invertible and the inverse of f is given by f-1 = g, which is the same as f.

Thus, the inverse of f is f itself.

Rate this question :

How useful is this solution?
We strive to provide quality solutions. Please rate us to serve you better.
Related Videos
Functions - 0152 mins
Different kind of mappings58 mins
Some standard real functions61 mins
Quick Revision of Types of Relations59 mins
Range of Functions58 mins
Battle of Graphs | various functions & their Graphs48 mins
Functions - 0947 mins
Quick Recap lecture of important graphs & functions58 mins
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://goprep.co/misc-1-q2-let-f-w-w-be-defined-as-f-n-n-1-if-n-is-odd-and-f-i-1nk02n", "fetch_time": 1606701655000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2020-50/segments/1606141204453.65/warc/CC-MAIN-20201130004748-20201130034748-00493.warc.gz", "warc_record_offset": 300285493, "warc_record_length": 44675, "token_count": 603, "char_count": 1870, "score": 4.15625, "int_score": 4, "crawl": "CC-MAIN-2020-50", "snapshot_type": "longest", "language": "en", "language_score": 0.930182695388794, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00057-of-00064.parquet"}