Key idea: This is a reciprocal-telescoping recurrence where the transformation converts a non-linear fraction into a linear summation involving an Arithmetic Progression.
Step 1: Transform the recurrence.
The given relation is xn+1โ=anโ+xnโanโxnโโ. Taking the reciprocal of both sides:
xn+1โ1โ=anโxnโanโ+xnโโ=xnโ1โ+anโ1โ
Let ynโ=xnโ1โ. Then yn+1โโynโ=anโ1โ.
Step 2: Express ynโ as a sum.
Since yn+1โโynโ=anโ1โ, we can telescope from k=1 to nโ1:
ynโ=y1โ+k=1โnโ1โakโ1โ
Given x1โ=1, we have y1โ=1. For n=21:
y21โ=1+k=1โ20โakโ1โ
We are given x21โ=2001โ, so y21โ=200. Thus:
k=1โ20โakโ1โ=199
Step 3: Analyze the options using AP properties.
The terms akโ form an AP. The sum of reciprocals of an AP does not simplify to a basic closed form like n/aavgโ unless specific conditions are met. However, we check the constraints.
Check Option B: a1โ+10d=10.
Note that a11โ=a1โ+10d. So Option B claims a11โ=10.
Consider the symmetry of the sum S=โk=120โakโ1โ. In an AP, akโ1โ+a21โkโ1โ=akโa21โkโakโ+a21โkโโ=akโa21โkโ2a11โโ.
This doesn't immediately prove B. Let's re-evaluate via elimination and necessary conditions.
Actually, let's look at the structure again. Is there a specific case where this holds?
If akโ=k (i.e., a1โ=1,d=1), then โk=120โk1โโ3.6๎ =199.
If akโ=c (constant, d=0), sum is 20/c=199โc=20/199. But d>0.
Let's re-read carefully. Is it possible the question implies a specific relationship derived from the form of the answer choices?
Wait, let's test Option B numerically with a valid AP.
If a11โ=10, does โk=120โakโ1โ=199 hold generally? No.
Correction in reasoning path: The problem asks "which MUST be true". This implies the condition x21โ=1/200 uniquely constrains the AP parameters or satisfies an identity.
Let's reconsider the reciprocal sum.
โk=120โakโ1โ=199.
Since akโ>0 and d>0, akโโฅa1โ.
Sum <a1โ20โโ199<a1โ20โโa1โ<19920โโ0.1.
Also a20โ>a1โ. Sum >a20โ20โโa20โ>19920โ.
Let's check Option B again: a1โ+10d=10.
If a1โโ0.1 and a11โ=10, then 10dโ9.9โdโ0.99.
This is a possible AP. But must it be true?
Let's look at the options again. There might be a typo in my manual derivation or the question relies on a specific property I am missing.
Alternative interpretation: Maybe anโ is NOT the denominator term index-matched?
"xn+1โ=anโ+xnโanโxnโโ". Yes, index matches.
Let's reverse engineer from the provided solution key "B".
If B is correct, then a11โ=10 is a necessary consequence of โk=120โakโ1โ=199.
This equality โk=120โakโ1โ=199 is extremely large for positive integers. It forces akโ to be very small fractions.
If akโ were integers, min sum is harmonic series โ3.6.
So akโ are definitely not integers.
Hypothesis: The question actually intended xn+1โ=xnโ+anโ or similar? No, "Level 4 hardest reasonable twist" implies the reciprocal form is intentional.
Perhaps the value isn't 1/200 but something else? No, I must solve AS WRITTEN.
Re-evaluating the "Must be true" logic.
If the question is well-posed for CAT Level 4, there is likely an algebraic identity linking the sum of reciprocals of 20 terms in AP to the middle term when the sum takes a specific value relative to the count.
However, without such a specific identity, B cannot be universally deduced just from the sum value.
WAIT. Let's look at the prompt's source diversity instruction. "Adapted advanced standard-book style".
Standard result: For an AP, โk=1nโakโ1โ has no simple closed form.
UNLESS... the question meant xn+1โ=1+anโxnโxnโโ? That leads to same reciprocal form.
Let's assume there is a specific constraint I missed or the options imply a specific setup.
Let's check Option C: โk=120โakโ1โ=200.
My derivation gave sum = 199.
y21โ=y1โ+โk=120โakโ1โ=1+S.
200=1+SโS=199.
So Option C is FALSE (it says 200).
This suggests the answer relies on distinguishing between 199 and 200, or relating 199 to the AP parameters.
If Option B (a11โ=10) is the intended answer, it implies a specific scaling.
BUT, looking at typical CAT traps: The trap is often confusing n terms vs nโ1 intervals.
Here, x21โ involves summing up to a20โ.
Number of terms in sum is 20.
Midpoint of indices 1..20 is between 10 and 11. Average term is (a10โ+a11โ)/2=a10.5โ.
Let's reconsider the validity of the question as generated.
If I cannot rigorously prove B from the sum=199 condition alone without extra assumptions, then B might be incorrect or the question is flawed.
However, as the AI generator, I must provide a valid Level 4 question.
Let's ADJUST the question statement slightly to make B rigorously true or select a different valid option.
Adjustment: Change the target value or the relation.
If we want Option B (a11โ=10) to be the answer, we need a relation that enforces it.
Actually, let's pivot to a safer, rigorous Level 4 synthesis that avoids ambiguity.
REVISED QUESTION CONCEPT:
Recurrence: xn+1โ=xnโ+anโ1โ where anโ is AP.
Then x21โ=x1โ+โk=120โakโ1โ. Same issue.
Let's go back to the original reciprocal form but change the question to ask for the VALUE of an expression given specific AP parameters, OR give the sum and ask for a parameter in a constrained case.
Better Approach for Level 4 Synthesis:
Combine AP Common Terms (C1T1) with Recursive Definition (C1T2).
Sequence xnโ defined recursively. The indices where xnโ is integer form an AP.
Let's stick to the generated question but fix the options/logic to be rigorous.
Derived Fact: โk=120โakโ1โ=199.
This is the only rigorous deduction.
If none of the options match this exactly, and B is claimed correct, there is a mismatch.
Let's REPLACE Option B with the rigorous deduction derived above, or a direct consequence.
Actually, looking at the provided solution in the thought trace, I see I was struggling with B.
Let's make Option B: "โk=120โakโ1โ=199".
But that makes it too easy (direct derivation).
Let's try a different synthesis:
xn+1โ=1+nxnโxnโโ. (PYQ variant).
Twist: Denominator is 1+anโxnโ where anโ is AP.
xn+1โ1โ=xnโ1โ+anโ.
yn+1โ=ynโ+anโ.
y21โ=y1โ+โk=120โakโ=1+S20APโ.
Given x21โ=20011โโy21โ=2001.
S20APโ=2000.
220โ(2a1โ+19d)=2000โ10(2a1โ+19d)=2000โ2a1โ+19d=200.
Now we have a linear Diophantine-like constraint on AP parameters.
Options:
A. a1โ=5,d=10 (10+190=200). True.
B. a20โ=100. (a20โ=a1โ+19d. From eq: 2a1โ+19d=200โa1โ+(a1โ+19d)=200โa1โ+a20โ=200. So a20โ=200โa1โ. Not necessarily 100).
C. Average of first 20 terms is 100. (S20โ/20=2000/20=100). ALWAYS TRUE.
D. a1โ+a20โ=200. ALWAYS TRUE.
This is perfect. It synthesizes Recurrence Transformation + AP Sum Formula.
Option C and D are mathematically equivalent here. I will make one the correct answer and the other a distractor or remove one.
Let's use "Average of first 20 terms is 100" as the correct answer because it tests the link between Sum and Average directly.
Final Polish of Question:
Recurrence: xn+1โ=1+anโxnโxnโโ.
Condition: x1โ=1,x21โ=20011โ.
Result: Average of first 20 terms of {anโ} is 100.
Why is this Level 4?
- Requires recognizing the reciprocal transform (non-obvious if not practiced).
- Requires handling the index shift (x21โ sums 20 terms, not 21).
- Links recursive output to AP aggregate property (Average).
- Trap: Using n=21 in sum formula gives wrong average.