A sequence u1,u2,u3,…u_1, u_2, u_3, \dots is such that u1=13u_1 = \frac{1}{3} and ur+1=ur−1(2r−1)(2r+3),for all r≥1.u_{r+1} = u_r - \frac{1}{(2r-1)(2r+3)}, \quad \text{for all } r \ge 1.

  1. (i)

    Use the method of mathematical induction to prove that un=n4n2−1u_n = \frac{n}{4n^2 - 1}.

  2. (ii)

    Hence prove that the sum of the first nn terms of the series

    15×9+17×11+19×13+…\frac{1}{5 \times 9} + \frac{1}{7 \times 11} + \frac{1}{9 \times 13} + \dots

    is 335−n+34(n+3)2−1\frac{3}{35} - \frac{n+3}{4(n+3)^2 - 1}.

  3. (iii)

    Give a reason why the series in part (ii) is convergent and state the sum to infinity.

Work through it with AI →

It won't just hand you the answer — it asks where you're stuck.How the checker works

Worked solution

2(i)

1. State the proposition and prove the base case for $n=1$.

Let PnP_n be the statement that un=n4n2−1u_n = \frac{n}{4n^2 - 1}, for n∈Z+n \in \mathbb{Z}^+.
When n=1n = 1:
LHS=u1=13\text{LHS} = u_1 = \frac{1}{3} (given)
RHS=14(1)2−1=14−1=13\text{RHS} = \frac{1}{4(1)^2 - 1} = \frac{1}{4 - 1} = \frac{1}{3}
Since LHS=RHS\text{LHS} = \text{RHS}, P1P_1 is true.

2. Assume the proposition holds for $n=k$ and substitute into the recurrence relation for $n=k+1$.

Assume PkP_k is true for some k∈Z+k \in \mathbb{Z}^+, i.e., uk=k4k2−1=k(2k−1)(2k+1)u_k = \frac{k}{4k^2 - 1} = \frac{k}{(2k-1)(2k+1)}.
We want to show Pk+1P_{k+1} is true, meaning uk+1=k+14(k+1)2−1u_{k+1} = \frac{k+1}{4(k+1)^2 - 1}.
Using the given recurrence relation ur+1=ur−1(2r−1)(2r+3)u_{r+1} = u_r - \frac{1}{(2r-1)(2r+3)} for r=kr = k:
uk+1=uk−1(2k−1)(2k+3)u_{k+1} = u_k - \frac{1}{(2k-1)(2k+3)}
uk+1=k(2k−1)(2k+1)−1(2k−1)(2k+3)u_{k+1} = \frac{k}{(2k-1)(2k+1)} - \frac{1}{(2k-1)(2k+3)}

3. Combine the expression into a single algebraic fraction over a common denominator.

uk+1=k(2k+3)−(2k+1)(2k−1)(2k+1)(2k+3)u_{k+1} = \frac{k(2k+3) - (2k+1)}{(2k-1)(2k+1)(2k+3)}
uk+1=2k2+3k−2k−1(2k−1)(2k+1)(2k+3)u_{k+1} = \frac{2k^2 + 3k - 2k - 1}{(2k-1)(2k+1)(2k+3)}
uk+1=2k2+k−1(2k−1)(2k+1)(2k+3)u_{k+1} = \frac{2k^2 + k - 1}{(2k-1)(2k+1)(2k+3)}

4. Factorise the numerator, simplify, and match it to the proposition $P_{k+1}$.

Factorising the quadratic numerator 2k2+k−1=(2k−1)(k+1)2k^2 + k - 1 = (2k-1)(k+1):
uk+1=(2k−1)(k+1)(2k−1)(2k+1)(2k+3)u_{k+1} = \frac{(2k-1)(k+1)}{(2k-1)(2k+1)(2k+3)}
uk+1=k+1(2k+1)(2k+3)u_{k+1} = \frac{k+1}{(2k+1)(2k+3)}
Expanding the denominator to show the required form:
uk+1=k+14k2+8k+3u_{k+1} = \frac{k+1}{4k^2 + 8k + 3}
uk+1=k+14(k2+2k+1)−1u_{k+1} = \frac{k+1}{4(k^2 + 2k + 1) - 1}
uk+1=k+14(k+1)2−1u_{k+1} = \frac{k+1}{4(k+1)^2 - 1}
Hence, Pk+1P_{k+1} is true if PkP_k is true.

5. State the final conclusion of the induction.

Since P1P_1 is true, and PkP_k being true implies Pk+1P_{k+1} is true, by the Principle of Mathematical Induction, PnP_n is true for all n∈Z+n \in \mathbb{Z}^+.

Answer

By the Principle of Mathematical Induction, un=n4n2−1u_n = \frac{n}{4n^2 - 1} for all n≥1n \ge 1.

2(ii)

1. Express the sum of the first $n$ terms using sigma notation by relating its terms to the given recurrence equation.

Let SnS_n be the sum of the first nn terms of the series.
The terms are of the form 1(2r−1)(2r+3)\frac{1}{(2r-1)(2r+3)}.
For the first term 15×9\frac{1}{5 \times 9}, we have 2r−1=5  ⟹  r=32r-1=5 \implies r=3.
Therefore, the nn terms correspond to r=3,4,…,n+2r = 3, 4, \dots, n+2.
Sn=∑r=3n+21(2r−1)(2r+3)S_n = \sum_{r=3}^{n+2} \frac{1}{(2r-1)(2r+3)}
Rearranging the given equation ur+1=ur−1(2r−1)(2r+3)u_{r+1} = u_r - \frac{1}{(2r-1)(2r+3)}, we obtain:
1(2r−1)(2r+3)=ur−ur+1\frac{1}{(2r-1)(2r+3)} = u_r - u_{r+1}

2. Apply the method of differences to simplify the sum.

Sn=∑r=3n+2(ur−ur+1)S_n = \sum_{r=3}^{n+2} (u_r - u_{r+1})
Expanding the sum:
Sn=(u3−u4)+(u4−u5)+⋯+(un+1−un+2)+(un+2−un+3)S_n = (u_3 - u_4) + (u_4 - u_5) + \dots + (u_{n+1} - u_{n+2}) + (u_{n+2} - u_{n+3})
By cancellation (telescoping sum), all intermediate terms cancel out:
Sn=u3−un+3S_n = u_3 - u_{n+3}

3. Substitute the formula for $u_n$ from part (i) to establish the final result.

From part (i), we know un=n4n2−1u_n = \frac{n}{4n^2 - 1}.
Evaluating u3u_3:
u3=34(3)2−1=336−1=335u_3 = \frac{3}{4(3)^2 - 1} = \frac{3}{36 - 1} = \frac{3}{35}
Evaluating un+3u_{n+3}:
un+3=n+34(n+3)2−1u_{n+3} = \frac{n+3}{4(n+3)^2 - 1}
Substituting these into our expression for SnS_n:
Sn=335−n+34(n+3)2−1S_n = \frac{3}{35} - \frac{n+3}{4(n+3)^2 - 1}
(Shown)

Answer

335−n+34(n+3)2−1\frac{3}{35} - \frac{n+3}{4(n+3)^2 - 1}

2(iii)

1. Show that the limit of the sequence of partial sums exists and is finite

For the sum to nn terms Sn=335−n+34(n+3)2−1S_n = \frac{3}{35} - \frac{n+3}{4(n+3)^2 - 1}, we evaluate the limit as n→∞n \to \infty.
As n→∞n \to \infty, the term n+34(n+3)2−1→0\frac{n+3}{4(n+3)^2 - 1} \to 0 because the degree of the denominator (quadratic in nn) is strictly greater than the degree of the numerator (linear in nn).
Thus, lim⁡n→∞Sn=335\lim_{n\to\infty} S_n = \frac{3}{35}.
Since the sequence of partial sums converges to a finite limit, the series is convergent.

2. State the sum to infinity

The sum to infinity is the limit of SnS_n as n→∞n \to \infty.
S∞=335S_\infty = \frac{3}{35}

Answer

The series converges because the sum to nn terms approaches a finite constant. The sum to infinity is 335\frac{3}{35}.

AI analysis — may contain mistakes.

Worked this one out on paper? Snap your steps and Gigle's AI math checker will circle the step where it went wrong.

More questions on this topic

  1. 1已知数列{an}\{a_{n}\}中,a1=76a_{1}=\dfrac{7}{6},an2−an+1=an+1(n∈N∗)a_{n}^{2}-a_{n}+1=a_{n+1}(n\in N^{*}),SnS_{n}是{1an}\{\dfrac{1}{a_{n}}\}的前…
  2. 2A sequence is such that u0=2u_{0}=2 and un=un−1+n3+(12)nu_{n}=u_{n-1}+n^{3}+\left(\dfrac{1}{2}\right)^{n} for n≥1n\ge 1. (a) It is given…
  3. 3An arithmetic sequence has first term aa and common difference 0.50.5, where aa is an integer. Find the smallest value…
  4. 4Anand writes a computer programme to simulate a population of organisms in a controlled environment. It is assumed that…
  5. 5On the first day of last month, the temperature of a machine in a manufacturing plant was found to be 90∘C90^\circ\text{C}…