We are given the function f0(x)=1−x1 for x∈R, x=0, x=1, and the recursive definition fn+1(x)=f0(fn(x)) for n=0,1,2,…. We need to find the value of f100(3)+f1(32)+f2(23).
First, we compute the first few functions to identify a pattern. Start with f0(x):
f0(x)=1−x1
Now, compute f1(x)=f0(f0(x)):
f1(x)=f0(1−x1)=1−1−x11
Simplify the denominator:
1−1−x1=1−x1−x−1−x1=1−x(1−x)−1=1−x−x
So,
f1(x)=1−x−x1=−x1−x=−x1−x=xx−1
Next, compute f2(x)=f0(f1(x)):
f2(x)=f0(xx−1)=1−xx−11
Simplify the denominator:
1−xx−1=xx−xx−1=xx−(x−1)=x1
So,
f2(x)=x11=x
Now, compute f3(x)=f0(f2(x)):
f3(x)=f0(f2(x))=f0(x)=1−x1
This is the same as f0(x). Similarly,
f4(x)=f0(f3(x))=f0(1−x1)=f1(x)=xx−1
f5(x)=f0(f4(x))=f0(xx−1)=f2(x)=x
We observe that the functions repeat every 3 steps: f3=f0, f4=f1, f5=f2, and so on. Thus, the sequence is periodic with period 3, meaning:
fn(x)=fnmod3(x)
where:
- If n≡0(mod3), then fn(x)=f0(x)=1−x1
- If n≡1(mod3), then fn(x)=f1(x)=xx−1
- If n≡2(mod3), then fn(x)=f2(x)=x
Now, we compute each term in the expression f100(3)+f1(32)+f2(23).
First, for f100(3):
Find 100mod3: 100÷3=33×3=99, remainder 100−99=1, so 100≡1(mod3). Thus, f100(3)=f1(3).
Using f1(x)=xx−1:
f1(3)=33−1=32
So, f100(3)=32.
Second, for f1(32):
Using f1(x)=xx−1:
f1(32)=3232−1=32−31=−31×23=−21
Third, for f2(23):
Since f2(x)=x:
f2(23)=23
Now, sum the terms:
f100(3)+f1(32)+f2(23)=32+(−21)+23
Combine the terms step by step. First, combine the fractions with denominator 2:
−21+23=2−1+3=22=1
Then add to 32:
32+1=32+33=35
Hence, the value is 35. Comparing with the options:
A. 38
B. 34
C. 35
D. 31
So, the correct answer is Option C.