🁢 数学归纳法：推倒第一块多米诺🁢 Mathematical Induction: Tipping the First Domino
上一片里，骨牌一块推一块，一次只把数列往前推一项。如果想把“对所有 n 都成立”一次性推倒呢？借同一排骨牌——只要两步。Last leaf, each domino tipped only the next one — advancing the sequence one term at a time. What if you want to knock down “true for every n” all at once? Borrow the same row of dominoes — with just two steps.
第 1 步：两个条件，整排全倒Step 1: two conditions, the whole row falls
先别急着算每一项，看看整排骨牌需要什么条件才会倒。Don’t rush into computing each term — first see what the row of dominoes needs in order to fall.
想让一排多米诺全倒，只要两件事：①推倒第 1 块——这是基础步，验证 n=1 时命题成立；②保证“随便哪一块倒下，都能推倒下一块”——这是归纳步：假设 n=k 时成立，推出 n=k+1 也成立。两条都做到，这一排无论多长都会全倒。缺一条：不推第一块，整排纹丝不动；推了却接不上，倒一半就停。To knock down a whole row of dominoes you need exactly two things: (1) tip the 1st tile — the base step, proving the statement for n = 1; (2) make sure “any falling tile tips the next one” — the induction step: assume it holds for n = k, deduce it for n = k+1. Do both, and no matter how long the row is, it all falls. Miss one: without the push, nothing moves; push but lose contact, and it stops halfway.
换一个更好懂的比喻：一架没有尽头的梯子。Here is an easier picture: an endless ladder.
第 2 步：站上第一级，就一定能往上Step 2: stand on rung one, and keep climbing
基础步 = 你能站上第 1 级；归纳步 = 只要能站在第 k 级，就一定能跨上第 k+1 级。两条合起来，结论是：你能到达任意一级——不管梯子有多高。这就是“对所有 n 成立”的意思：不是把 n 一个个试过去，而是一次性证明“每一步都跨得动”。Base step = you can stand on rung 1; induction step = whenever you can stand on rung k, you can step up to rung k+1. Together they say: you can reach any rung — no matter how tall the ladder. That is what “true for all n” means: not testing n one by one, but proving once that every single step is climbable.
用它来推一张真正的公式卡：1+2+…+n 的和。Now use it on a real formula card: the sum 1+2+…+n.
第 3 步：公式卡被推过所有 nStep 3: the formula card carried across every n
目标是证明 1+2+…+n = n(n+1)/2。基础步：n=1 时，左边是 1，右边 1×2/2=1，成立。归纳步：假设 1+2+…+k = k(k+1)/2，两边一起加上 k+1——左边变成 1+2+…+(k+1)，右边整理一下正好是 (k+1)(k+2)/2，也就是把公式里的 k 换成 k+1。于是公式卡被推过 1、2、3……所有 n。戏法不在于逐项硬算，而在于证明“推得动”。The target: prove 1+2+…+n = n(n+1)/2. Base step: for n = 1, the left side is 1, and the right is 1×2/2 = 1 — true. Induction step: assume 1+2+…+k = k(k+1)/2, then add k+1 to both sides — the left becomes 1+2+…+(k+1), and the right tidies up to exactly (k+1)(k+2)/2, which is the formula with k replaced by k+1. So the card is carried across 1, 2, 3… every n. The trick is not grinding through each term — it is proving the push always works.
🎮 你来当推牌手（1 分钟）🎮 Your turn: the domino tipper (1 minute)
道理讲完了。下面是一排骨牌：调好间距（归纳步），再推倒金色第 1 块（基础步）——两个灯都亮，整排才会全倒。Theory done. Below is a row of tiles: fix the spacing (induction step), then tip the golden first tile (base step) — only when both lights turn on does the whole row fall.
一句话记住它：数学归纳法 = 推倒第 1 块 + 每块能推倒下一块，于是整排全倒——对所有 n 成立。Remember it in one line: induction = tip tile 1 + every tile tips the next — so the whole row falls, true for all n.
基础步：验证 n=1 成立（推倒第 1 块）Base step: check n = 1 (tip the 1st tile)归纳步：n=k 成立 ⇒ n=k+1 成立（每块能推倒下一块）Induction step: true for k ⇒ true for k+1 (each tile tips the next)两步缺一不可，缺了哪步整排都倒不完Both are essential — miss one and the row never fully falls
内容参考 OpenStax 等公开教材，多来源核对 · AI 生成、人工审核 · 发现错误欢迎指正，帮这片叶子长得更好。Based on OpenStax and other open textbooks, cross-checked across sources · AI-generated, human-reviewed · Spotted a mistake? Tell us — help this leaf grow.
Back to tree
