RankRizz
JEE MAIN 2016 · 09 APR ONLINE+4 / −1MEDIUMTRANSCRIBED

JEE Main 2016 Mathematics question — Composite functions

For x∈Rx \in R, x≠0x \neq 0, x≠1x \neq 1, let f0(x)=11−xf_0(x) = \frac{1}{1-x} and fn+1(x)=f0(fn(x))f_{n+1}(x) = f_0(f_n(x)), n=0,1,2,…n = 0, 1, 2, \ldots. Then the value of f100(3)+f1(23)+f2(32)f_{100}(3) + f_1\left(\frac{2}{3}\right) + f_2\left(\frac{3}{2}\right) is equal to:

SOLUTION

We are given the function f0(x)=11−xf_0(x) = \frac{1}{1-x} for x∈Rx \in \mathbb{R}, x≠0x \neq 0, x≠1x \neq 1, and the recursive definition fn+1(x)=f0(fn(x))f_{n+1}(x) = f_0(f_n(x)) for n=0,1,2,…n = 0, 1, 2, \ldots. We need to find the value of f100(3)+f1(23)+f2(32)f_{100}(3) + f_1\left(\frac{2}{3}\right) + f_2\left(\frac{3}{2}\right).

First, we compute the first few functions to identify a pattern. Start with f0(x)f_0(x):

f0(x)=11−xf_0(x) = \frac{1}{1-x}

Now, compute f1(x)=f0(f0(x))f_1(x) = f_0(f_0(x)):

f1(x)=f0(11−x)=11−11−xf_1(x) = f_0\left( \frac{1}{1-x} \right) = \frac{1}{1 - \frac{1}{1-x}}

Simplify the denominator:

1−11−x=1−x1−x−11−x=(1−x)−11−x=−x1−x1 - \frac{1}{1-x} = \frac{1-x}{1-x} - \frac{1}{1-x} = \frac{(1-x) - 1}{1-x} = \frac{-x}{1-x}

So,

f1(x)=1−x1−x=1−x−x=−1−xx=x−1xf_1(x) = \frac{1}{\frac{-x}{1-x}} = \frac{1-x}{-x} = -\frac{1-x}{x} = \frac{x-1}{x}

Next, compute f2(x)=f0(f1(x))f_2(x) = f_0(f_1(x)):

f2(x)=f0(x−1x)=11−x−1xf_2(x) = f_0\left( \frac{x-1}{x} \right) = \frac{1}{1 - \frac{x-1}{x}}

Simplify the denominator:

1−x−1x=xx−x−1x=x−(x−1)x=1x1 - \frac{x-1}{x} = \frac{x}{x} - \frac{x-1}{x} = \frac{x - (x-1)}{x} = \frac{1}{x}

So,

f2(x)=11x=xf_2(x) = \frac{1}{\frac{1}{x}} = x

Now, compute f3(x)=f0(f2(x))f_3(x) = f_0(f_2(x)):

f3(x)=f0(f2(x))=f0(x)=11−xf_3(x) = f_0(f_2(x)) = f_0(x) = \frac{1}{1-x}

This is the same as f0(x)f_0(x). Similarly,

f4(x)=f0(f3(x))=f0(11−x)=f1(x)=x−1xf_4(x) = f_0(f_3(x)) = f_0\left( \frac{1}{1-x} \right) = f_1(x) = \frac{x-1}{x}

f5(x)=f0(f4(x))=f0(x−1x)=f2(x)=xf_5(x) = f_0(f_4(x)) = f_0\left( \frac{x-1}{x} \right) = f_2(x) = x

We observe that the functions repeat every 3 steps: f3=f0f_3 = f_0, f4=f1f_4 = f_1, f5=f2f_5 = f_2, and so on. Thus, the sequence is periodic with period 3, meaning:

fn(x)=fnmod  3(x)f_n(x) = f_{n \mod 3}(x)

where:

  • If n≡0(mod3)n \equiv 0 \pmod{3}, then fn(x)=f0(x)=11−xf_n(x) = f_0(x) = \frac{1}{1-x}
  • If n≡1(mod3)n \equiv 1 \pmod{3}, then fn(x)=f1(x)=x−1xf_n(x) = f_1(x) = \frac{x-1}{x}
  • If n≡2(mod3)n \equiv 2 \pmod{3}, then fn(x)=f2(x)=xf_n(x) = f_2(x) = x

Now, we compute each term in the expression f100(3)+f1(23)+f2(32)f_{100}(3) + f_1\left(\frac{2}{3}\right) + f_2\left(\frac{3}{2}\right).

First, for f100(3)f_{100}(3):

Find 100mod  3100 \mod 3: 100÷3=33×3=99100 \div 3 = 33 \times 3 = 99, remainder 100−99=1100 - 99 = 1, so 100≡1(mod3)100 \equiv 1 \pmod{3}. Thus, f100(3)=f1(3)f_{100}(3) = f_1(3).

Using f1(x)=x−1xf_1(x) = \frac{x-1}{x}:

f1(3)=3−13=23f_1(3) = \frac{3-1}{3} = \frac{2}{3}

So, f100(3)=23f_{100}(3) = \frac{2}{3}.

Second, for f1(23)f_1\left(\frac{2}{3}\right):

Using f1(x)=x−1xf_1(x) = \frac{x-1}{x}:

f1(23)=23−123=−1323=−13×32=−12f_1\left(\frac{2}{3}\right) = \frac{\frac{2}{3} - 1}{\frac{2}{3}} = \frac{-\frac{1}{3}}{\frac{2}{3}} = -\frac{1}{3} \times \frac{3}{2} = -\frac{1}{2}

Third, for f2(32)f_2\left(\frac{3}{2}\right):

Since f2(x)=xf_2(x) = x:

f2(32)=32f_2\left(\frac{3}{2}\right) = \frac{3}{2}

Now, sum the terms:

f100(3)+f1(23)+f2(32)=23+(−12)+32f_{100}(3) + f_1\left(\frac{2}{3}\right) + f_2\left(\frac{3}{2}\right) = \frac{2}{3} + \left(-\frac{1}{2}\right) + \frac{3}{2}

Combine the terms step by step. First, combine the fractions with denominator 2:

−12+32=−1+32=22=1-\frac{1}{2} + \frac{3}{2} = \frac{-1 + 3}{2} = \frac{2}{2} = 1

Then add to 23\frac{2}{3}:

23+1=23+33=53\frac{2}{3} + 1 = \frac{2}{3} + \frac{3}{3} = \frac{5}{3}

Hence, the value is 53\frac{5}{3}. Comparing with the options:

A. 83\frac{8}{3}

B. 43\frac{4}{3}

C. 53\frac{5}{3}

D. 13\frac{1}{3}

So, the correct answer is Option C.

Tagged Composite functions. Machine-assigned, so read it as a strong shortlist rather than a verdict.

ChapterFunctions
TopicComposite functions
TypeMultiple choice