Question
Let be the sum of the first terms of the sequence . Suppose and .
(1) Find the general formula of .
(2) If find , the sum of the first terms of .
Step-by-step solution
(1) When , Rearranging gives Since , we have , hence .
(2) Therefore So
Final answer
(1) The sequence satisfies . This follows from the recurrence obtained by subtracting from , which yields the invariant ratio .
(2) After substituting , we get , which is telescoping after decomposition. Thus This gives the exact partial-sum formula for .
Marking scheme
1. Checkpoints (max 7 pts total)
Part (1): derive (3 pts)
- Derive recurrence from correctly. (1.5 pts)
- Transform to invariant ratio . (1 pt)
- Use initial condition to conclude . (0.5 pt)
Part (2): compute (4 pts)
- Substitute into correctly. (1 pt)
- Perform partial-fraction decomposition correctly. (1.5 pts)
- Execute telescoping sum and simplify. (1.5 pts)
Total (max 7)
2. Zero-credit items
- Guessing directly from first few terms without recurrence proof.
- Writing telescoping form without final simplification.
3. Deductions
- Recurrence rearrangement error (-1): incorrect coefficients when moving terms.
- Telescoping endpoint error (-1): wrong retained terms in the final sum.