Name: proving number patterns with induction
Uploaded: 2025-11-26T05:43:51.000Z
Duration: 1 min 29 s
Channel: JoVE

数学归纳法是一种用于证明对所有自然数成立的命题真实性的方法。例如，在多米诺效应中，如果第一个骨牌倒下，并且每一个骨牌都能推倒下一个，那么整排骨牌都将依次倒下。再考虑另一个每天存硬币的例子：第一天存1个25美分硬币，第二天存2个，第三天存3个，依此类推，持续 n 天。所存硬币的总数构成一个包含前 n 个自然数的数列。该数列的和遵循一个简单的规律，计算结果等于 n 乘以 n 加 1 再除以 2。数学归纳法通过验证基础情况和归纳步骤，证明该模式对所有自然数成立。对于第一个数，即基础情况，实际的求和结果与规则得出的结果一致，从而验证了基础情况。 接着假设该规则对任意数 k 均成立。这构成了归纳步骤，即此前所有数的和也应遵循相同的规律。添加下一个数 k 加 1，按照相同的逻辑，可证明该模式仍然成立。由于基础情况和归纳步骤均成立，通过数学归纳法可证明该规则对所有自然数均成立。

数学归纳法

Mathematical Induction

&#25968;&#23398;&#24402;&#32435;&#27861;&#26159;&#19968;&#31181;&#31995;&#32479;&#24615;&#30340;&#35777;&#26126;&#26041;&#27861;&#65292;&#29992;&#20110;&#39564;&#35777;&#28041;&#21450;&#33258;&#28982;&#25968;&#30340;&#21629;&#39064;&#30340;&#30495;&#23454;&#24615;&#12290;&#32771;&#34385;&#21069; n &#20010;&#33258;&#28982;&#25968;&#20043;&#21644;&#65306;<figure class='image image-style-align-center image_resized' style='display:table;margin-left:auto;margin-right:auto;width:50%;'><img style='aspect-ratio:1920/250;' src='https://cloudfront.jove.com/files/ftp_upload/40096/40096_Equation_1_1__editor_40096.svg' alt='40096_Equation_1_1_.svg' /></figure>&#35813;&#20844;&#24335;&#25551;&#36848;&#20102;&#19968;&#31181;&#38543;&#30528;&#39033;&#25968;&#22686;&#21152;&#32780;&#20445;&#25345;&#25104;&#31435;&#30340;&#35268;&#24459;&#12290;&#20026;&#20102;&#35777;&#26126;&#20854;&#23545;&#25152;&#26377;&#33258;&#28982;&#25968;&#22343;&#25104;&#31435;&#65292;&#25968;&#23398;&#24402;&#32435;&#27861;&#36890;&#24120;&#21253;&#25324;&#20004;&#20010;&#22522;&#26412;&#27493;&#39588;&#12290;&#31532;&#19968;&#27493;&#26159;&#22522;&#30784;&#24773;&#24418;&#26816;&#39564;&#65292;&#21363;&#39564;&#35777;&#24403; n = 1 &#26102;&#20844;&#24335;&#26159;&#21542;&#25104;&#31435;&#12290;&#23558; n = 1 &#20195;&#20837;&#31561;&#24335;&#20004;&#36793;&#65292;&#21487;&#24471;&#65306;<figure class='image image-style-align-center image_resized' style='display:table;margin-left:auto;margin-right:auto;width:50%;'><img style='aspect-ratio:1920/250;' src='https://cloudfront.jove.com/files/ftp_upload/40096/40096_Equation_2_1__editor_40096.svg' alt='40096_Equation_2_1_.svg' /></figure>&#30001;&#27492;&#21487;&#35265;&#65292;&#22522;&#30784;&#24773;&#24418;&#25104;&#31435;&#12290;&#31532;&#20108;&#27493;&#26159;&#24402;&#32435;&#27493;&#39588;&#65292;&#21363;&#20551;&#35774;&#20844;&#24335;&#23545;&#20110;&#26576;&#20010;&#20219;&#24847;&#33258;&#28982;&#25968; k &#25104;&#31435;&#65292;&#27492;&#20551;&#35774;&#31216;&#20026;&#24402;&#32435;&#20551;&#35774;&#65306;<figure class='image image-style-align-center image_resized' style='display:table;margin-left:auto;margin-right:auto;width:50%;'><img style='aspect-ratio:1920/250;' src='https://cloudfront.jove.com/files/ftp_upload/40096/40096_Equation_3_1__editor_40096.svg' alt='40096_Equation_3_1_.svg' /></figure>&#25509;&#19979;&#26469;&#65292;&#24212;&#35777;&#26126;&#35813;&#20844;&#24335;&#23545; k + 1 &#20063;&#25104;&#31435;&#12290;&#23558; k + 1 &#21152;&#33267;&#24402;&#32435;&#20551;&#35774;&#30340;&#20004;&#36793;&#65292;&#24471;&#21040;&#65306;<figure class='image image-style-align-center image_resized' style='display:table;margin-left:auto;margin-right:auto;width:50%;'><img style='aspect-ratio:1920/250;' src='https://cloudfront.jove.com/files/ftp_upload/40096/40096_Equation_4_1__editor_40096.svg' alt='40096_Equation_4_1_.svg' /></figure>&#36825;&#34920;&#26126;&#35813;&#35268;&#24459;&#22312; k + 1 &#30340;&#24773;&#24418;&#19979;&#20381;&#28982;&#25104;&#31435;&#12290;&#36890;&#36807;&#39564;&#35777;&#22522;&#30784;&#24773;&#24418;&#19982;&#24402;&#32435;&#27493;&#39588;&#65292;&#21487;&#20197;&#35777;&#26126;&#35813;&#20844;&#24335;&#23545;&#25152;&#26377;&#33258;&#28982;&#25968;&#22343;&#25104;&#31435;&#12290;

Education

教育

JoVE Core

Math Fundamentals

数学基础

Unit

单位

Introduction to Sequences and Series

数列与级数导论

KEY TERMS AND CONCEPTS

关键术语与概念

proving number patterns with induction

Mathematical induction is a proof method for statements about natural numbers. It is often used to test whether a pattern really works for every number in a sequence. A common example is the sum of the first n natural numbers, where the formula seems to hold as more terms are added.

The proof begins with a base case. In this step, the formula is checked at the first value, usually n = 1. Substituting 1 into both sides shows that the equality is true, so the base case holds.

Next comes the inductive step. Here, the statement is assumed to be true for an arbitrary natural number k. This assumption is called the induction hypothesis. The goal is then to show that the same statement is true for k + 1.

To do that, k + 1 is added to both sides of the induction hypothesis. This shows that the pattern also works for the next number. With the base case and the inductive step both verified, the formula is proven for all natural numbers.

Proving Number Patterns with Induction

sequences

Recursive Sequences and Partial Sums

Sequences are ordered lists of numbers that follow a rule or pattern. Each number in the list is called a term. Terms are often written as a1, a2, a3, and so on, where the subscript shows the position in the sequence. When the pattern is clear, dots may be used to show that the list continues. A sequence can also be viewed as a function. Its domain is the set of natural numbers, and each natural number maps to one term in the list. This view is useful when a sequence is defined explicitly or...

summation notation

Summation Notation for Sequences

Sigma notation, also called summation notation, gives a short way to write the sum of a sequence of terms that follow a regular pattern. It uses the uppercase Greek letter sigma, ∑, to show that terms are being added together. A typical sigma expression includes an index of summation. The index starts at a lower value, such as 1, and ends at an upper value, such as n. The term a_k represents the general term in the sequence, where k changes across the stated range. For example, the increasing...

arithmetic sequences

Arithmetic Sequence Formulas and Partial Sums

Arithmetic sequences follow a regular number pattern. Each term is found by adding the same value, called the common difference, to the term before it. This steady change makes the sequence easy to study and predict. The nth-term formula helps find any term in the sequence without listing every earlier number. In this formula, a n is the nth term, a is the first term, d is the common difference, and n shows the term position. It gives a direct way to calculate a specific value from the pattern.

geometric sequences

Infinite Geometric Series and Decay

Infinite geometric series describe values that shrink by the same factor each step. Each new term is found by multiplying the previous term by a fixed common ratio. This pattern is useful for modeling gradual loss, such as energy dissipation or a drop in amplitude over time. When the common ratio has a magnitude less than one, the terms keep getting smaller. In that case, the total of the series approaches a definite number instead of growing without bound or changing back and forth. This is...

mathematical induction

Mathematical induction is a proof method for statements about natural numbers. It is often used to test whether a pattern really works for every number in a sequence. A common example is the sum of the first n natural numbers, where the formula seems to hold as more terms are added. The proof begins with a base case. In this step, the formula is checked at the first value, usually n = 1. Substituting 1 into both sides shows that the equality is true, so the base case holds. Next comes the...

the binomial theorem

Expanding Binomials with the Binomial Theorem

The Binomial Theorem gives a clear method for expanding binomial expressions raised to a power. It applies to binomials of the form (a + b)^n, where a and b are variables or constants that represent algebraic expressions, and n is a non-negative integer. Each term in the expansion follows a fixed pattern. The binomial coefficient in each term is found using factorials. The exponent of a decreases from n to 0, while the exponent of b increases from 0 to n. The theorem also helps students...

binomial expansion using pascal's triangle

binomial-expansion-using-pascal-s-triangle

Pascal’s Triangle for Binomial Coefficients

Pascal’s Triangle helps organize the coefficients in a binomial expansion. A binomial is an expression with two terms, such as (a + b), and raising it to a power creates a predictable pattern of terms. The triangle is built row by row. The top row, called the zeroth row, matches (a + b)0. Each new row gives the coefficients for the next power of the binomial, so the sixth row, 1, 5, 10, 10, 5, 1, gives the coefficients for (a + b)5. Each row begins and ends with 1. Every number inside the...

key terms and concepts

Learn how mathematical induction proves number patterns using a base case and inductive step, with the sum of the first n natural numbers as an example.

Proving Number Patterns with Induction | JoVE K12

The JoVE Math Fundamentals collection is designed to build a deep and comprehensive understanding of essential mathematics. Covering the foundations of algebra, geometry, trigonometry, and analytic reasoning, this course establishes a strong base for future studies. The collection connects core mathematical concepts with real-world practice, equipping learners to solve complex problems, master problem-solving skills, and apply abstract ideas.

math fundamentals

Proving Number Patterns with Induction

Description

Transcript