A sequence is an ordered list generated by a function whose inputs are selected integers. A series is an accumulation formed by adding sequence terms. The distinction between a term and a partial sum is essential because they describe different quantities. Arithmetic patterns arise from repeated addition, while geometric patterns arise from repeated multiplication. This lesson develops formulas by tracing those repeated operations rather than treating them as disconnected rules.
Define a sequence as a function
A sequence is a function whose domain is usually the positive integers or the nonnegative integers. The input is an index, and the output is a term. The notation names the term at index . The subscript is not multiplication. It identifies position in the ordered list.
If a sequence begins , then , , and . The ellipsis indicates that the pattern continues, but it does not define the pattern uniquely. Many different rules can begin with the same finite list. A formula or recursion makes the intended continuation explicit. The listed values provide evidence for a rule but are not themselves a complete definition.
Order distinguishes sequences from sets. The sequence differs from even though both use the same distinct values. Repetition is allowed. The index domain gives every occurrence its place. Applications use this order to represent time steps, positions, iterations, or ranked observations.
Distinguish explicit and recursive definitions
An explicit rule gives directly from the index . For example, generates when indexing starts at one. Substituting gives the initial term four. Substituting gives the tenth term without computing earlier terms. Explicit formulas support direct access.
A recursive rule defines one or more initial terms and explains how later terms depend on earlier ones. The same sequence can be written and for . The subscript names the preceding term. Computing recursively requires generating the intervening values unless another method is found. Recursions emphasize process and dependence.
Neither representation is universally better. Recursive forms model iterative processes naturally. Explicit forms reveal long-term behavior and allow direct calculation. Some recursions have simple explicit solutions, while others do not. Translating between forms is a central sequence skill.
Track indexing carefully
Indexing may begin at zero, one, or another integer. A formula must match that starting point. If is the first term, then counts the number of steps from index one to index . At , zero steps have occurred. This explains why many first-term formulas contain .
If indexing begins at zero, the same step count is . A geometric sequence might be written for . At , the exponent is zero and . Using in this convention would shift every term. The formula should be checked at the starting index.
Changing an index label does not change a sequence if the domain and rule move consistently. The symbols and can describe the same general term under different dummy labels. Fixed references such as are not dummy labels. Index errors often arise from changing one part of notation without changing the others. Substitution at the first two indices is a reliable check.
Recognize arithmetic sequences
An arithmetic sequence has a constant difference between consecutive terms. If that difference is , then . The letter is a scalar amount added at each step. Positive produces increasing terms, while negative produces decreasing terms. Zero produces a constant sequence.
Starting from , one step gives . Two steps give . After steps, . The explicit formula records repeated addition. It is a linear function of index .
For , the common difference is . The twentieth term is . The factor nineteen counts the additions from the first term to the twentieth. Using twenty additions would overshoot by one step. Index reasoning explains the calculation.
Model arithmetic change
Arithmetic sequences describe equal additive change per discrete interval. A tank gaining each minute at recorded whole minutes follows an arithmetic sequence. A salary increasing by a fixed dollar amount each year can also be arithmetic. The common difference carries the same units as the terms. It represents change per index step.
Suppose an account begins with and receives at the end of each month without interest. Immediately after month , the balance may be . If the initial balance is labeled , this formula uses deposits. If the first recorded term is after one deposit, indexing must reflect that choice. Timeline labels prevent off-by-one errors.
Arithmetic models are inappropriate for constant percentage growth. A fixed percentage creates changes proportional to current amount rather than a fixed difference. The numerical differences then vary. Examining first differences distinguishes additive from multiplicative structure. Context should confirm the pattern rather than relying on a short table alone.
Derive the finite arithmetic sum
Let . The capital denotes the sum of the first terms, not the th term. Write the sum once forward and once backward. Each aligned pair adds to . There are such pairs across the two written sums.
Therefore . Dividing by two gives . The horizontal fraction bar groups over two. The formula equals number of terms times average of first and last term. This average works because arithmetic terms are evenly spaced.
The formula can also be written after substituting . Brackets group the entire interior expression. Both forms are equivalent. The first is convenient when the last term is known. The second is convenient when the common difference is known.
Apply an arithmetic sum
Return to the sequence . The fifteenth term is . The sum of the first fifteen terms is . There are fifteen terms, and their average is thirty-five. Multiplication confirms the same total.
A direct listing would be possible but inefficient. The formula uses the pattern’s structure. A magnitude check helps: fifteen terms averaging about thirty-five should total a little over five hundred. The answer fits that expectation. A result such as would be too small by an order of magnitude.
Units of a series depend on the terms. If each term is a monthly payment in dollars, their sum is total dollars. The index count is dimensionless. Adding terms with incompatible units is invalid. A series is an accumulation of like quantities.
Recognize geometric sequences
A geometric sequence has a constant nonzero ratio between consecutive terms. If the ratio is , then wherever the denominator is nonzero. Each step multiplies by . Positive gives growth in magnitude for positive starts. A ratio with produces decay in magnitude.
Starting from , one step gives . Two steps give . After steps, . The exponent counts multiplicative steps. This is an exponential function of index.
If , term signs alternate. If , the standard ratio interpretation becomes delicate after the first zero because division by zero is undefined, though the explicit rule may still generate a sequence. If , every term equals . Parameter cases affect formulas and behavior. The ratio is part of the model, not merely a calculator input.
Model geometric change
Geometric sequences describe equal multiplicative change per interval. Compound interest, repeated depreciation, population growth under a constant factor, and radioactive decay at equal time steps are common examples. A growth rate corresponds to factor . A decay rate corresponds to factor when . Percent language must be converted to a decimal factor.
Equipment initially worth retains of its value each year. If is the initial value, then . The ratio is dimensionless. The exponent counts yearly retention steps. After one year, the model gives .
Retaining eighty-five percent is equivalent to depreciating fifteen percent per year in this model. It is not equivalent to subtracting every year. The dollar decrease becomes smaller as value falls. Constant difference and constant ratio describe different mechanisms. Tables of differences and ratios can distinguish them.
Derive the finite geometric sum
Let . Multiply by to obtain . The multiplication shifts every original power one position. Subtract the second equation from the first. All interior terms cancel.
The result is . If , divide by to get . The condition is necessary because the denominator would otherwise be zero. When , the sum is simply . This separate case follows because all terms are equal.
An equivalent form is . Multiplying numerator and denominator by negative one produces it. Either form is valid under the same condition. Choosing a form that keeps intermediate values positive can reduce sign errors. Derivation makes the alternatives easier to recognize.
Apply a finite geometric sum
Suppose a person deposits at the end of each month into an account earning per month. Immediately after the twelfth deposit, the first deposit has earned interest for eleven months. The last deposit has earned none. The balance is . The bounds encode twelve deposits and their growth durations.
Using the finite formula gives . The denominator and numerator are both negative, so their ratio is positive. Total deposits equal . The additional is consistent with modest interest. This comparison checks scale.
Deposit timing changes the exponents. Deposits at the beginning of each month would receive one additional month of growth by the same evaluation time. A timeline is more reliable than guessing whether the first exponent is eleven or twelve. Index bounds are part of the financial model. Off-by-one errors have monetary consequences.
Read sigma notation as an instruction
The expression means . The symbol is the index of summation. The lower bound gives its first value, and the upper bound gives its last value. The term formula tells what to compute for each index. Sigma notation compresses repeated addition.
To evaluate , substitute . The terms are . Their sum is . The number of integer terms is . The plus one includes both endpoints.
The index is a local dummy variable. Replacing by does not change the sum if bounds and term formula remain consistent. Thus . A free variable outside the sum must not be renamed accidentally. Scope matters in summation notation as it does in functions.
Manipulate finite sums linearly
Summation distributes over addition. The identity is . A constant factor can be moved outside, so . These rules follow from ordinary distributive and associative properties. They do not depend on a special sequence type.
A constant summed times gives . The index does not appear in the term, but the bounds still control repetition count. For example, . There are five terms, not seven. Count comes from upper minus lower plus one.
Bounds can be split at an interior index. For , . No term may be duplicated or omitted. This property supports partial accumulation and algorithms. Drawing the index list verifies the split.
Distinguish terms from partial sums
Given sequence , define the partial sum . The sequence is a new sequence. Its terms record accumulated totals. It differs from the original term sequence . Confusing them leads to incorrect convergence claims.
The relation between them is for . The newest term is the increment in accumulated sum. Conversely, . This recursion links local contribution with cumulative total. It is a discrete analogue of derivative and integral relationships.
For for every , terms approach one while partial sums grow as . For , terms approach zero and partial sums approach a finite limit. Term behavior and sum behavior answer different questions. A series converges only when its partial-sum sequence converges. Inspecting alone cannot establish the final accumulated value.
Define an infinite series through a limit
An infinite series is not completed by literally adding a final term. It is defined as the limit of partial sums. The notation expresses this definition. The arrow means that the number of included terms grows without bound. If partial sums approach a finite value, the series converges.
If partial sums do not approach a finite value, the series diverges. They may grow without bound, oscillate, or behave irregularly. Divergence is not always the same as approaching infinity. The definition asks for one finite limiting sum. Partial sums provide the evidence.
A necessary condition for convergence is . If terms do not approach zero, adding further terms cannot settle the partial sums. The condition is not sufficient. The harmonic series has but diverges. Term tests can disprove convergence without always proving it.
Derive the infinite geometric sum
For a geometric series beginning at index zero, the partial sum is when it includes terms through . If , then . The partial sums approach . Therefore for . The limit converts a sequence of finite sums into the defined infinite-series value.
The absolute-value condition is part of the formula. If , partial sums grow by . If with nonzero , partial sums oscillate. If , term magnitudes grow. None of these cases produces a finite limiting sum.
For , the ratio magnitude is . The sum is . Alternating signs make partial sums approach the limit from opposite sides. The finite value follows from the partial-sum limit, not from stopping the series. Every additional term changes the partial sum by a smaller amount.
Interpret convergence visually
Plotting against index shows term behavior. Plotting against index shows accumulated behavior. A convergent series has partial-sum points approaching a horizontal level. Its term points must approach zero. The two graphs should not be confused.
For a positive geometric ratio below one, partial sums approach the limit from one side. For a negative ratio with magnitude below one, they oscillate with decreasing amplitude around the limit. A ratio near one produces slow convergence. The formula and graph describe the same rate behavior. Visual patterns support limit reasoning.
Finite decimal representations illustrate geometric convergence. The repeating decimal equals . This geometric series has first term and ratio . Its sum is . Infinite representation can equal a finite number through a limit.
Diagnose common sequence errors
One mistake is confusing with . The first is a term, and the second is an accumulated sum. Another is using instead of when is the initial term. Substituting the starting index reveals the shift. Index checks are faster than repairing a full calculation.
Another error is classifying constant percentage growth as arithmetic. Arithmetic sequences have constant differences. Geometric sequences have constant ratios. A short data table can sometimes mimic both approximately, so context matters. Computing several differences and ratios provides evidence.
Infinite-series errors include applying the geometric sum when or assuming proves convergence. The convergence condition belongs with the formula. A finite sum always exists, but an infinite series requires a limiting argument. Writing the partial sum first keeps this distinction visible. A formula without its convergence condition is incomplete.
Practice a complete sequence routine
First state the index domain and initial term. Second determine whether change is additive, multiplicative, recursive, or another pattern. Third write a rule and test it at the first two indices. Fourth distinguish whether the question asks for one term or an accumulated sum. Fifth check units, size, and index count.
For with , the first five terms are . The ratio is one-half. The fifth exponent is four because four multiplications occur after the first term. Each term is positive and half the preceding one. The behavior matches the formula.
For , the terms are . Their sum is . The same list is arithmetic with first term three and last term nine. The arithmetic formula gives . Two methods provide a check.
Consolidate sequence and series reasoning
A sequence is a function on an ordered integer domain. Explicit rules provide direct terms, while recursive rules describe generation. Arithmetic patterns repeat addition, and geometric patterns repeat multiplication. Their exponents and coefficients count steps from a declared starting index. Indexing is part of the model.
A series adds sequence terms. Finite arithmetic sums follow from equal pairing, while finite geometric sums follow from shifting and cancellation. Sigma notation specifies index, bounds, and term formula compactly. Partial sums form a separate sequence of accumulated values. Infinite series are defined through limits of those partial sums.
Reliable work distinguishes terms from sums and checks the first index. It carries units through applications and uses timelines for repeated deposits or changes. It states convergence conditions alongside infinite formulas. Deriving structure reduces dependence on memorization. Sequences describe ordered change, and series describe what that change accumulates.