MathIsimple

Sequences & Series – Problem 6: Find the general formula of

Question

Let SnS_n be the sum of the first nn terms of the sequence {an}\{a_n\}. Suppose Sn=n+12an,S_n=\frac{n+1}{2}a_n, and a1=1a_1=1.

(1) Find the general formula of {an}\{a_n\}.

(2) If bn=1anan+2,b_n=\frac{1}{a_na_{n+2}}, find TnT_n, the sum of the first nn terms of {bn}\{b_n\}.

Step-by-step solution

(1) When n2n\ge2, an=SnSn1=n+12ann2an1.a_n=S_n-S_{n-1}=\frac{n+1}{2}a_n-\frac{n}{2}a_{n-1}. Rearranging gives nan1=(n1)anan1n1=ann (n2).na_{n-1}=(n-1)a_n\Rightarrow \frac{a_{n-1}}{n-1}=\frac{a_n}{n}\ (n\ge2). Since a1=1a_1=1, we have ann=1\dfrac{a_n}{n}=1, hence an=na_n=n.

(2) bn=1n(n+2)=12(1n1n+2).b_n=\frac1{n(n+2)}=\frac12\left(\frac1n-\frac1{n+2}\right). Therefore Tn=k=1nbk=12k=1n(1k1k+2)=12(1+121n+11n+2).T_n=\sum_{k=1}^n b_k =\frac12\sum_{k=1}^n\left(\frac1k-\frac1{k+2}\right) =\frac12\left(1+\frac12-\frac1{n+1}-\frac1{n+2}\right). So Tn=3412(1n+1+1n+2).T_n=\frac34-\frac12\left(\frac1{n+1}+\frac1{n+2}\right).

Final answer

(1) The sequence satisfies an=na_n=n. This follows from the recurrence obtained by subtracting Sn1S_{n-1} from SnS_n, which yields the invariant ratio ann=1\dfrac{a_n}{n}=1.

(2) After substituting an=na_n=n, we get bn=1n(n+2)b_n=\dfrac1{n(n+2)}, which is telescoping after decomposition. Thus Tn=3412(1n+1+1n+2).T_n=\frac34-\frac12\left(\frac1{n+1}+\frac1{n+2}\right). This gives the exact partial-sum formula for {bn}\{b_n\}.

Marking scheme

1. Checkpoints (max 7 pts total)

Part (1): derive ana_n (3 pts)

  • Derive recurrence from an=SnSn1a_n=S_n-S_{n-1} correctly. (1.5 pts)
  • Transform to invariant ratio ann=an1n1\frac{a_n}{n}=\frac{a_{n-1}}{n-1}. (1 pt)
  • Use initial condition to conclude an=na_n=n. (0.5 pt)

Part (2): compute TnT_n (4 pts)

  • Substitute an=na_n=n into bnb_n 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 an=na_n=n 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.
Ask AI ✨