已知数列 u1,u2,u3,…u_1, u_2, u_3, \dots 满足 u1=13u_1 = \frac{1}{3} 且 ur+1=ur−1(2r−1)(2r+3),对于所有 r≥1.u_{r+1} = u_r - \frac{1}{(2r-1)(2r+3)}, \quad \text{对于所有 } r \ge 1.

  1. (i)

    利用数学归纳法证明 un=n4n2−1u_n = \frac{n}{4n^2 - 1}。

  2. (ii)

    由此证明级数

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

    的前 nn 项和为 335−n+34(n+3)2−1\frac{3}{35} - \frac{n+3}{4(n+3)^2 - 1}。

  3. (iii)

    给出第 (ii) 部分中级数收敛的理由,并写出其无穷项和。

先不看答案,让 AI 诊断你卡在哪里?

它不会直接告诉你答案,而是问你卡在哪一步看看 AI 是怎么陪你一步步弄懂这道题的

完整解法

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}^+.

答案

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)

答案

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}

答案

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

AI 分析,可能出错

用 AI 批改,圈出写错的那一步,并自动将你的薄弱点存入错题本,形成你的错因库。

同一知识点的其他题

  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. 2已知一个数列满足 u0=2u_{0}=2 且对于 n≥1n\ge 1,有 un=un−1+n3+(12)nu_{n}=u_{n-1}+n^{3}+\left(\dfrac{1}{2}\right)^{n}。 (a) 已知 ∑r=1nr3=n2(n+1)24\displaystyle \sum_{r=1}^{n} r^{3} = \dfrac{n^{2}(n+1)^{2}}{4}…
  3. 3等差数列的首项为 aa,公差为 0.50.5,其中 aa 是一个整数。求 aa 的最小值,使得前 36 项的和至少为 500。 数列 u0,u1,u2,…u_0, u_1, u_2, \dots 的定义为: u0=400u_0 = 400 且当 n≥1n \ge 1…
  4. 4Anand 编写了一个计算机程序,用于在受控环境中模拟生物种群。假设在模拟期间没有生物死亡或离开该环境。 在模拟 A 中,第 1 天向环境中引入 200 个生物。在随后的每一天开始时,向环境中再引入 48 个生物。求在某天结束时,环境中的生…
  5. 5在上个月的第一天,一家制造厂内一台机器的温度被发现为 90∘C90^\circ\text{C},主管认为该温度过高。每天,机器产生的废热作为副产品会导致机器温度上升 2∘C2^\circ\text{C}。为了降低温度,主管决定调整恒温器,并在每天…