Name: recursive sequences and partial sums
Uploaded: 2025-11-26T05:43:56.000Z
Duration: 1 min 29 s
Channel: JoVE

数列是按照特定规则或模式排列的数字有序列表。第 n 项可通过基于其位置的公式求得。例如，一个弹跳球每次弹起的高度都会降低，形成一个递减序列，其中每次弹起的高度均为前一次高度的固定比例。序列中的每个数称为一项，有序项的位置决定了其数值。当模式清晰时，圆点表示序列继续。某些数列通过前面的项来定义后续项，这类数列称为递推数列。例如，第 n 项是通过第 (n−1) 项来定义的，n-1）项。例如，在斐波那契数列中，每一项等于前两项之和。部分和是指一个数列前几项的和。通常用求和符号（sigma notation）表示，部分和有助于分析随着项数增加，总和如何增长。这些中的每一项都称为部分和：S1 是第一项，S2 是第二项，而 Sn 是第 n 项的和。由这些项构成的序列称为部分和序列。例如，在追踪每周储蓄时，每周的存款即为一项。部分和则显示总储蓄随时间的增长情况。

序列

Sequences

&#24207;&#21015;&#26159;&#25968;&#23398;&#20013;&#26368;&#22522;&#26412;&#30340;&#25968;&#23398;&#23545;&#35937;&#20043;&#19968;&#65292;&#30001;&#36981;&#24490;&#29305;&#23450;&#35268;&#24459;&#25110;&#27169;&#24335;&#30340;&#26377;&#24207;&#25968;&#21015;&#26500;&#25104;&#12290;&#24207;&#21015;&#22312;&#35832;&#22810;&#25968;&#23398;&#39046;&#22495;&#20013;&#21457;&#25381;&#30528;&#20851;&#38190;&#20316;&#29992;&#65292;&#21253;&#25324;&#24494;&#31215;&#20998;&#12289;&#32423;&#25968;&#20197;&#21450;&#25968;&#35770;&#31561;&#12290;&#23427;&#20204;&#36824;&#21487;&#29992;&#20110;&#21051;&#30011;&#29616;&#23454;&#19990;&#30028;&#20013;&#30340;&#22810;&#31181;&#29616;&#35937;&#65292;&#20363;&#22914;&#20154;&#21475;&#22686;&#38271;&#12289;&#37329;&#34701;&#25237;&#36164;&#65292;&#20197;&#21450;&#35832;&#22914;&#24377;&#36339;&#29699;&#39640;&#24230;&#36880;&#28176;&#20943;&#23567;&#31561;&#29289;&#29702;&#36807;&#31243;&#12290;&#24207;&#21015;&#20013;&#30340;&#27599;&#19968;&#20010;&#25968;&#23383;&#31216;&#20026;&#19968;&#39033;&#12290;&#36890;&#24120;&#65292;&#36825;&#20123;&#39033;&#35760;&#20316; a_1&#12289;a_2&#12289;a_3&#12289;&#8230;&#65292;&#19979;&#26631;&#34920;&#31034;&#20854;&#22312;&#24207;&#21015;&#20013;&#30340;&#20301;&#32622;&#12290;&#24403;&#35268;&#24459;&#28165;&#26224;&#26102;&#65292;&#24207;&#21015;&#24120;&#20197;&#30465;&#30053;&#21495;&#34920;&#31034;&#20854;&#24310;&#32493;&#24615;&#12290;&#20174;&#25968;&#23398;&#35282;&#24230;&#26469;&#30475;&#65292;&#24207;&#21015;&#20063;&#21487;&#35270;&#20026;&#19968;&#20010;&#20989;&#25968;&#65292;&#20854;&#23450;&#20041;&#22495;&#20026;&#33258;&#28982;&#25968;&#38598;&#65292;&#27599;&#20010;&#33258;&#28982;&#25968;&#23545;&#24212;&#24207;&#21015;&#20013;&#30340;&#26576;&#19968;&#29305;&#23450;&#39033;&#12290;&#36825;&#31181;&#20989;&#25968;&#21270;&#30340;&#34920;&#31034;&#26041;&#24335;&#22312;&#26174;&#24335;&#25110;&#36882;&#24402;&#23450;&#20041;&#24207;&#21015;&#26102;&#20855;&#26377;&#37325;&#35201;&#20316;&#29992;&#12290;&#36882;&#24402;&#24207;&#21015;&#26159;&#25351;&#27599;&#19968;&#39033;&#30001;&#21069;&#19968;&#39033;&#25110;&#21069;&#33509;&#24178;&#39033;&#20915;&#23450;&#30340;&#24207;&#21015;&#12290;&#20854;&#20013;&#26368;&#33879;&#21517;&#30340;&#20363;&#23376;&#26159;&#26000;&#27874;&#37027;&#22865;&#25968;&#21015;&#65292;&#20854;&#27599;&#19968;&#39033;&#22343;&#31561;&#20110;&#21069;&#20004;&#39033;&#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:1244/72;' src='https://cloudfront.jove.com/files/ftp_upload/40093/40093_Equation_1_editor_40093.svg' alt='40093_Equation_1.svg' /></figure>&#36825;&#19968;&#23450;&#20041;&#24378;&#35843;&#20102;&#27599;&#19968;&#39033;&#23545;&#21069;&#39033;&#30340;&#20381;&#36182;&#20851;&#31995;&#65292;&#36825;&#26159;&#36882;&#24402;&#24207;&#21015;&#30340;&#20856;&#22411;&#29305;&#24449;&#12290;&#37096;&#20998;&#21644;&#25351;&#30340;&#26159;&#24207;&#21015;&#21069;&#33509;&#24178;&#39033;&#30340;&#32047;&#31215;&#21644;&#65292;&#23427;&#22312;&#30740;&#31350;&#38543;&#30528;&#39033;&#25968;&#22686;&#21152;&#32780;&#21464;&#21270;&#30340;&#24635;&#21644;&#36235;&#21183;&#26041;&#38754;&#20855;&#26377;&#37325;&#35201;&#20215;&#20540;&#12290;&#23545;&#20110;&#24207;&#21015; {a_n}&#65292;&#31532; n &#39033;&#37096;&#20998;&#21644;&#30340;&#34920;&#36798;&#24335;&#20026;&#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:1109/132;' src='https://cloudfront.jove.com/files/ftp_upload/40093/40093_Equation_2_editor_40093.svg' alt='40093_Equation_2.svg' /></figure>&#23545;&#24207;&#21015;&#12289;&#36882;&#24402;&#23450;&#20041;&#20197;&#21450;&#37096;&#20998;&#21644;&#30340;&#29702;&#35299;&#65292;&#26159;&#36827;&#19968;&#27493;&#25506;&#35752;&#26356;&#39640;&#23618;&#27425;&#20027;&#39064;&#65288;&#22914;&#26080;&#31351;&#32423;&#25968;&#12289;&#25910;&#25947;&#24615;&#19982;&#25968;&#23398;&#24402;&#32435;&#27861;&#65289;&#30340;&#22522;&#30784;&#12290;&#27492;&#22806;&#65292;&#26395;&#36828;&#38236;&#22411;&#24207;&#21015;&#26159;&#19968;&#31867;&#29305;&#27530;&#30340;&#24207;&#21015;&#65292;&#20854;&#29305;&#24449;&#22312;&#20110;&#24403;&#37096;&#20998;&#21644;&#23637;&#24320;&#26102;&#65292;&#22823;&#22810;&#25968;&#39033;&#20250;&#30456;&#20114;&#25269;&#28040;&#65292;&#20174;&#32780;&#20351;&#27714;&#21644;&#36807;&#31243;&#26174;&#33879;&#31616;&#21270;&#12290;&#22312;&#26395;&#36828;&#38236;&#32423;&#25968;&#20013;&#65292;&#31532; n &#39033;&#37096;&#20998;&#21644;&#36890;&#24120;&#21487;&#21270;&#31616;&#20026;&#23569;&#25968;&#20960;&#39033;&#65288;&#36890;&#24120;&#20026;&#39318;&#39033;&#19982;&#26411;&#39033;&#65289;&#20043;&#38388;&#30340;&#24046;&#65292;&#20174;&#32780;&#24471;&#21040;&#31616;&#26126;&#30340;&#38381;&#24335;&#34920;&#36798;&#24335;&#12290;&#36825;&#19968;&#24615;&#36136;&#22312;&#27714;&#35299;&#26080;&#31351;&#32423;&#25968;&#19982;&#35777;&#26126;&#25910;&#25947;&#24615;&#26102;&#23588;&#20026;&#26377;&#29992;&#12290;

Education

教育

JoVE Core

Math Fundamentals

数学基础

Unit

单位

Introduction to Sequences and Series

数列与级数导论

KEY TERMS AND CONCEPTS

关键术语与概念

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 recursively. In a recursive sequence, each term depends on earlier terms. The Fibonacci sequence is a well-known example, because each term is the sum of the two terms before it.

Sequences appear in many areas of math, including calculus, series, and number theory. They can also model real-world changes such as population growth, financial investments, and the decreasing height of a bouncing ball. These examples show how a pattern in numbers can describe a changing process over time.

Partial sums help track the total of the first few terms of a sequence. For a sequence {an}, the nth partial sum is the sum of the first n terms. This idea is important for studying how a total changes as more terms are added. It also supports later topics such as infinite series, convergence, and mathematical induction.

A telescoping sequence is a special case where many terms cancel when the partial sum is expanded. This makes the sum easier to evaluate. In a telescoping series, the nth partial sum often becomes the difference between just a few terms, usually the first and the last. That simplified form is useful for finding closed-form expressions and for studying infinite series.

Recursive Sequences and Partial Sums

sequences

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

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...

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 recursive sequences, partial sums, and telescoping series work, with examples like the Fibonacci sequence and real-world patterns.

Recursive Sequences and Partial Sums | 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

Recursive Sequences and Partial Sums

Description

Transcript