Question:

For $x \, \in \, R , x \neq 0, x \neq 1,$ let $f_0(x) = \frac{1}{1-x}$ and $f_{n+1} (x) | = f_0 (f_n(x)), n = 0 , 1 , 2 , ...$ Then the value of $f_{100}(3) + f_1 \left(\frac{2}{3} \right) + f_2 \left( \frac{3}{2} \right)$ is equal to :

Updated On: Feb 14, 2025
  • $\frac{8}{3}$
  • $\frac{5}{3}$
  • $\frac{4}{3}$
  • $\frac{1}{3}$
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is B

Solution and Explanation

The correct answer is B:\(\frac{5}{3}\)
\(f_0(x)=\frac{1}{1-x}\) for \(x∈R\),\(x≠0,x≠1\)
\(f_{n+1}(x)=f_0(f_n(x)),n=0,1,2......\)
 Then, \(f_{1} \left(x\right)=f_{0+1}\left(x\right)=f_{0}\left(f_{0}\left(x\right)\right)=\frac{1}{1-\frac{1}{1+-x}}=\frac{x-1}{x}\)
\(f_{2}\left(x\right)=f_{1+1}\left(x\right)=f_{0}\left(f_{1}\left(x\right)\right)=\frac{1}{1-\frac{x-1}{x}}=x\)
\(f_{3}\left(x\right)=f_{2+1}\left(x\right)=f_{0}\left(f_{2}\left(x\right)\right)=f_{0}\left(x\right)=\frac{1}{1-x}\)
\(f_{4}\left(x\right)=f_{3+1}\left(x\right)=f_{0}\left(f_{0}\left(x\right)\right)=\frac{x-1}{x}\)
\(\therefore f_{0}=f_{3}=f_{6}=.........=\frac{1}{1-x}\)
\(f_{1}=f_{4}=f_{7}=f_{10}=......=\frac{x-1}{x}\)
\(f_{2}=f_{5}=f_{8}=.......=x\)
\(f_{100}\left(3\right)=\frac{3-1}{3}=\frac{2}{3}f_{1}\left(\frac{2}{3}\right)=\frac{\frac{2}{3}-1}{\frac{2}{3}}=-\frac{1}{2}\)
\(f_{2}\left(\frac{3}{2}\right)=\frac{3}{2}\)
\(\therefore f_{100}\left(3\right)+f_{1}\left(\frac{2}{3}\right)+f_{2}\left(\frac{3}{2}\right)=\frac{5}{3}\)
element of
Was this answer helpful?
0
0

Concepts Used:

Functions

A function is a relation between a set of inputs and a set of permissible outputs with the property that each input is related to exactly one output. Let A & B be any two non-empty sets, mapping from A to B will be a function only when every element in set A has one end only one image in set B.

Kinds of Functions

The different types of functions are - 

One to One Function: When elements of set A have a separate component of set B, we can determine that it is a one-to-one function. Besides, you can also call it injective.

Many to One Function: As the name suggests, here more than two elements in set A are mapped with one element in set B.

Moreover, if it happens that all the elements in set B have pre-images in set A, it is called an onto function or surjective function.

Also, if a function is both one-to-one and onto function, it is known as a bijective. This means, that all the elements of A are mapped with separate elements in B, and A holds a pre-image of elements of B.

Read More: Relations and Functions