| English | 释义 | 拼音 |
|---|---|---|
| positive integer/ˈpɒzɪtɪv ˈɪntɪdʒə/ | 正整数 | zhèng zhěng shù |
| mathematical induction/ˌmæθɪˈmætɪkl ɪnˈdʌkʃn/ | 数学归纳法 | shù xué guī nà fǎ |
| base case/beɪs keɪs/ | 基础情形 | jī chǔ qíng xíng |
| inductive step/ɪnˈdʌktɪv step/ | 归纳步骤 | guī nà bù zhòu |
| inductive hypothesis/ɪnˈdʌktɪv haɪˈpɒθəsɪs/ | 归纳假设 | guī nà jiǎ shè |
| divisible/dɪˈvɪzɪbl/ | 整除 | zhěng chú |
| conjecture/kənˈdʒektʃə/ | 猜想 | cāi xiǎng |
| factorial/fækˈtɔːrɪəl/ | 阶乘 | jiē chéng |
可重复的规则必须有起点
- 检查前几个正整数不能确立无限多情况。数学归纳法将一个初始真命题与通向每一个后续命题的规则相结合。
- 基础情形 启动归纳链。归纳步骤 证明针对任意允许整数的条件关联,而不仅仅是短表中下一个数字。
多米诺骨牌图示代表两个独立要求:一个起始的真理和一种在后续每个位置均有效的关联。
A starting truth and a general forward link
The base case P(n₀) and P(k)⇒P(k+1) for every k≥n₀ together establish P(n) for all integers n≥n₀.
明确表述被证明的内容
- 写出命题 $P(n)$ 及其整数范围,从 $n_0$ 开始。直接验证 $P(n_0)$,如有适用则使用给定的初始条件。然后假设 $P(k)$ 对某个任意整数 $k\ge n_0$ 成立,并利用该假设推导出 $P(k+1)$。
- 归纳假设 是临时且条件性的:它并不预设对所有整数结论成立。由于已验证的基础情形与通用关联相结合,可得出 $P(n)$ 对所有整数 $n\ge n_0$ 成立。
不要试图在证明 $k+1$ 时预设其为真。仅展示 $P(k+1)\Rightarrow P(k)$ 会导致错误的蕴含关系。反向代数运算有助于规划思路,但证明需要有效的正向论证,或经过合理说明的等价语句链。
The two steps of proof by induction are the base case and the:
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
Induction needs a base case plus an inductive step from k to k+1.
For a claim stated for every positive integer n starting at 1, which base case is needed?
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
The base case checks the smallest value, usually n = 1.
If P(1) is true and P(k) implies P(k+1) for every integer k≥1, then P(n) is true for all positive integers n.
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
The base case is explicitly1, and the forward implication applies to every later step. A proof starting at a different base has a different guaranteed range.
You can prove a result by induction using only the inductive step, without a base case.
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
Both steps are essential. Without the base case, the chain never starts.
在求和中添加新项
- 对于有限求和,分离出 $k+1$ 求和式的最后一项。仅利用假设替换其前 $k$ 项,然后化简为含 $n=k+1$ 的公式形式。
- 展示起始情形、准确的归纳假设及最终结论。仅仅引用 $k+1$ 的求和公式的一行未能建立所需的关联。
证明正整数 $n$ 满足 $\sum_{r=1}^{n}r(r+1)=n(n+1)(n+2)/3$。
在 $n=1$ 处,等式两边均等于 $2$。假设公式对 $n=k$ 成立。那么
这就是所需的 $k+1$ 公式,因此由归纳法可知结果对所有正整数成立。
Using induction, the sum 1 + 2 + ... + n = n(n+1)/2. For n = 10, find the sum.
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
10(11)/2 = 55.
Prove by induction that $\sum_{r=1}^{n}(2r-1)^2=n(4n^2-1)/3$ for every positive integer $n$. Show the algebra in the forward step.
Check the stated first case, use the exact hypothesis in a valid forward step for arbitrary k in its domain, and conclude only the range the proof establishes.
Prove by induction that $\sum_{r=0}^{n}3^r=(3^{n+1}-1)/2$ for every integer $n\ge0$. State the correct base case and explain the term count.
Check the stated first case, use the exact hypothesis in a valid forward step for arbitrary k in its domain, and conclude only the range the proof establishes.
暴露整除性中的整数倍因子
- 要证明某表达式被非零整数 $m$ 整除,需将其写为 $m$ 乘以一个整数。在归纳步骤中,分离出假设可整除的表达式,并证明其余每一项也都是 $m$ 的倍数。
- $k$ 表达式的适当倍数以及相邻表达式之间的差值均可提供帮助。需指明整数倍因子;“通过观察即知可整除”可能掩盖了未正确使用归纳假设的问题。
设 $F_n=10^n-4^n$。在 $n=1$ 处,$F_1=6$。假设 $F_k=6q$ 对整数 $q$ 成立。那么
括号内的部分是一个整数。因此 $6$ 整除 $F_{k+1}$,且归纳法证明了该结果对所有正整数 $n$ 成立。
Prove by induction that $25^n+7^n-2$ is divisible by $6$ for every positive integer $n$. Identify an integer multiple in the step instead of quoting a pattern from small cases.
Check the stated first case, use the exact hypothesis in a valid forward step for arbitrary k in its domain, and conclude only the range the proof establishes.
Prove by induction that $n^3-n$ is divisible by $6$ for every positive integer $n$. Explain why the extra term in the step is divisible by $6$, rather than only by $3$.
Check the stated first case, use the exact hypothesis in a valid forward step for arbitrary k in its domain, and conclude only the range the proof establishes.
利用递推式向前推进
- 递推式提供了一种从 $u_k$ 过渡到 $u_{k+1}$ 的合法方法。检查所提议的闭式解是否具有正确的首项,将其 $k$ 版本代入递推式并化简。
- 除非你建立了所提议的 $k+1$ 公式与已知 $k$ 公式之间的可逆等价关系,否则不要直接将前者代入递推式便声称完成证明。最清晰的推导路径应从给定的递推式出发。
假设 $u_1=2$ 和 $u_{n+1}=3u_n+2$。命题为 $u_n=3^n-1$。它在 $n=1$ 时成立。假设 $u_k=3^k-1$ 成立,
这证明了所声称的通项公式对所有正整数均成立,而不仅仅是最初计算出的几项 $2,8,26$。
A sequence has $u_1=3$ and $u_{n+1}=2u_n+3$. Calculate its first four terms, conjecture a closed formula, and prove it by induction. Separate evidence for the guess from its proof.
Check the stated first case, use the exact hypothesis in a valid forward step for arbitrary k in its domain, and conclude only the range the proof establishes.
保持上界并检查分母符号
- 对于涉及递推式的不等式,将归纳假设代入一个符号可控的表达式中。在使用该表达式以保持不等式之前,先说明其分母为何为正。
- 有时所需的归纳假设包含两个界限。需证明这两个界限在步骤后依然成立。一旦每一项都确立了界限,即可在不预设答案的情况下,为后续的单调性论证提供依据。
设 $u_1=1$ 和 $u_{n+1}=(4u_n+3)/(u_n+2)$。证明 $0<u_n<3$。
第一项同时满足两个不等式。若 $0<u_k<3$ 成立,则 $u_{k+1}$ 的分子和分母均为正。此外,
因此 $0<u_{k+1}<3$ 成立。由数学归纳法可知,$0<u_n<3$ 对所有正整数 $n$ 均成立。已确立的界限进而给出
故该数列是递增的。最后这一推论依赖于已证的界限;它不能替代该界限本身的证明。
Suppose $0<u_1<1$ is given and $u_{n+1}=2u_n/(1+u_n)$. Prove by induction that $0<u_n<1$ for all positive integers. Then use your proved bounds to decide whether the sequence is increasing.
Check the stated first case, use the exact hypothesis in a valid forward step for arbitrary k in its domain, and conclude only the range the proof establishes.
通过矩阵乘法证明幂次公式
- 对于单个矩阵的幂次运算,$M^{k+1}=M^kM$ 成立。将假设的 $M^k$ 表达式代入,按行乘列进行计算,并验证每个元素均具有 $k+1$ 的形式。
- 矩阵的幂次并非通过对每个元素分别求幂得到。此外,仅在 $M$ 和 $M^2$ 处验证过的公式,只有在完成任意 n $k$ 的步骤证明之前,仅能作为证据。
当 n $M=\begin{pmatrix}2&1\\0&1\end{pmatrix}$ 时,命题为
n=$n=1$ 的情形即为 $M$ 本身。利用 k=n $k$ 的归纳假设,
因此该公式对所有正整数均成立(由归纳法)。单独的 n=$n=0$ 情形对应 $M^0=I$,同样符合此公式。
支持 $M=\begin{pmatrix}2&1\\0&2\end{pmatrix}$, calculate $M^2$, then prove $M^n=\begin{pmatrix}2^n&n2^{n-1}\\0&2^n\end{pmatrix}$ for every positive integer $n$. Show the off-diagonal multiplication explicitly.
Check the stated first case, use the exact hypothesis in a valid forward step for arbitrary k in its domain, and conclude only the range the proof establishes.
猜想 导数规律
- 猜想是指基于证据提出的陈述,而非已确立的定理。计算前几阶导数,寻找规律,并用精确的数学语言表达出来,注明起始值 n=$n$。
- 对于$n$阶导数公式,对假设的$k$阶导数求一次导。正确的模式需要在归纳步骤中进行实际的微分和化简。
当 n=$f(x)=xe^{2x}$ 时,前几个导数分别为 $e^{2x}(2x+1)$、$e^{2x}(4x+4)$ 和 $e^{2x}(8x+12)$。据此作出猜想
一阶导数给出了基础情形。对$k$公式求导可得
这正是所需的$k+1$阶导数。因此该猜想对所有正整数$n$均成立。
In mathematics, a conjecture is:
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
A conjecture is an unproven statement based on evidence — you then try to prove it (often by induction).
支持 $f(x)=x^2e^x$, compute the first three derivatives and conjecture $f^{(n)}(x)$ for $n\ge1$. Prove the formula by induction for all real $x$.
Check the stated first case, use the exact hypothesis in a valid forward step for arbitrary k in its domain, and conclude only the range the proof establishes.
The values n²−n+41 at n=1,2,3 are 41,43,47, all prime. A student conjectures that the expression is prime for every positive integer n. Test n=41 and explain what the result says about limited trials and induction.
Check the stated first case, use the exact hypothesis in a valid forward step for arbitrary k in its domain, and conclude only the range the proof establishes.
根据陈述匹配导数阶数
- 若所声称的公式针对$2n$阶导数,将$n$增加一将使导数阶数增加二。归纳步骤必须求两次导。在开始代数运算前统计导数阶数。
- 分别追踪交替符号及依赖于$n$的系数。关于特定偶数阶的陈述并不自动等同于关于所有导数阶的陈述。
当 n $f(x)=x\sin x$ 时,命题为
在$n=1$处,$f''(x)=2\cos x-x\sin x$,如所需。对假设的$2k$公式求一次导得$(-1)^k\{x\cos x+(2k+1)\sin x\}$。第二次求导得
从而完成至$2(k+1)$阶导数的步骤。因此该公式通过归纳法对所有正整数$n$成立。
Prove by induction that for $f(x)=x\sin x$, $f^{(2n-1)}(x)=(-1)^{n-1}\{x\cos x+(2n-1)\sin x\}$ for every positive integer $n$. How many differentiations does one induction step require?
Check the stated first case, use the exact hypothesis in a valid forward step for arbitrary k in its domain, and conclude only the range the proof establishes.
将简短试算转化为阶乘猜想
- 正整数 $n$ 的 阶乘 定义为 $n!=1\cdot2\cdots n$,其中 $0!=1$。部分和可能暗示存在平移后的阶乘模式,但该规律必须在一般归纳步骤中持续成立。
- 仔细计算前几项,并寻找加减常数后的简单表达式。当题目要求使用归纳法时,即使存在直接裂项相消论证,也应提供归纳证明。
对于$S_n=\sum_{r=1}^{n}r\,r!$,前几个和为$1,5,23,119$。加上$1$后提示结果为$S_n=(n+1)!-1$。
在$n=1$处,两边均等于$1$。假设$k$处的公式成立,
因此该猜想通过归纳法对所有正整数成立。恒等式$r\,r!=(r+1)!-r!$也解释了为何和式会裂项相消,但仅列出早期数值并非证明。
Let $S_n=\sum_{r=1}^{n}(r^2+r+1)r!$. Compute $S_1,S_2,S_3$, compare $S_n+1$ with $(n+1)!$, conjecture a formula for $S_n$, and prove it by induction.
Check the stated first case, use the exact hypothesis in a valid forward step for arbitrary k in its domain, and conclude only the range the proof establishes.
从声明实际覆盖的第一个值开始
- 声明可能从$n=4$或其他指定整数开始。证明该起始情形并假设$k$处于允许范围内;不要默许地将定义域替换为所有正整数。
- 对于$2^n\ge n^2$且$n\ge4$的情形,基础情形为$16=16$。假设$2^k\ge k^2$在$k\ge4$处成立,则有$2^{k+1}\ge2k^2\ge(k+1)^2$,因为$2k^2-(k+1)^2=(k-1)^2-2>0$在该范围内。因此归纳法证明了针对所有整数$n\ge4$的所述声明。
该链证明了从4开始的所述范围。实际上n=3不成立,因为8小于9;起始点是声明的一部分。
Prove $3^n\ge n^2$ by induction for every integer $n\ge2$. Justify the comparison in your inductive step. Does this proof by itself cover $n=1$?
Check the stated first case, use the exact hypothesis in a valid forward step for arbitrary k in its domain, and conclude only the range the proof establishes.
检查蕴含关系与结论
- 检查假设是否被用于正向推导下一情形,且所有表达式均有定义。仅有验证过的基础情形和反向蕴含关系不足以确立后续整数的声明。
- 将结论与链接匹配:$P(k)\Rightarrow P(k+1)$ 可到达每一个后续整数,而从 $k$ 到 $k+2$ 的链接仅能从单个基数出发到达一种奇偶性。要用该链接覆盖两种奇偶性,需要两个起始情况。
陈述 $P(n): n\le5$ 给出了警示。尽管 $P(1)$ 为真且 $P(k+1)\Rightarrow P(k)$ 对正整数成立,但 $P(6)$ 却是假的。反向蕴含不能替代所需的正向步骤。
证明正确的起始情况,假设任意允许的 k 并建立前向步骤。将结论与所达范围匹配;偶阶导数公式每步需两次微分。
Using the formula for the sum of the first n integers, what is the sum when n = 8, and why is the inductive step not enough on its own?
The closed formula gives the sum directly. Induction still has to anchor that formula with a first true case.
What is the sum of the first 8 integers?
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
8 times 9 divided by 2 is 36. Other options — 55 (the lesson sum for n = 10); 8 (the value of n).
A proposed proof of n+1<n says: assume k+1<k; adding 1 gives k+2<k+1; therefore the result holds for every positive integer. Identify the error and explain why a valid conditional calculation is insufficient.
Check the stated first case, use the exact hypothesis in a valid forward step for arbitrary k in its domain, and conclude only the range the proof establishes.
Let P(n) be n≤7. A student checks P(1), proves P(k+1) implies P(k), and concludes P(n) for all positive integers. Show why this fails and identify a value of k where the required forward link fails.
Check the stated first case, use the exact hypothesis in a valid forward step for arbitrary k in its domain, and conclude only the range the proof establishes.
For P(n): n is odd, P(1) is true and P(k) implies P(k+2). What range does this chain cover? Why can it not establish the claim for all positive integers merely by calling the link an inductive step?
Check the stated first case, use the exact hypothesis in a valid forward step for arbitrary k in its domain, and conclude only the range the proof establishes.