The \( n \)-th term \( a_n = S_n - S_{n-1} \).

["Understanding the ( n )-th Term of a Sequence: ( a_n = S_n - S_{n-1} )", "When exploring sequences in mathematics, one of the most powerful and intuitive relationships defines the ( n )-th term of a sequence in terms of its partial sums. The formula\n[\na_n = S_n - S_{n-1}\n]\noffers a foundational insight into how individual terms relate to cumulative sums. This article explores the meaning, derivation, and practical applications of this essential formula.", "---", "### What Are Partial Sums and Their Importance?", "Before diving into the formula, it’s helpful to understand partial sums. For a sequence ( {a_n} ) where ( a_n ) represents the ( n )-th term, the partial sum ( S_n ) is the sum of the first ( n ) terms:\n[\nS_n = a_1 + a_2 + \cdots + a_{n-1} + a_n\n]\nPartial sums act as building blocks—each captures the total up to the ( n )-th term, enabling us to isolate individual data points through difference.", "---", "### The Formula: ( a_n = S_n - S_{n-1} )", "The expression\n[\na_n = S_n - S_{n-1}\n]\nformally defines the ( n )-th term of a sequence in terms of its partial sums. This relationship holds for all ( n \geq 1 ), though care must be taken with ( S_0 ), conventionally defined as 0.", "#### How It Works\n- ( S_n ) gives the total of terms from ( a_1 ) to ( a_n ).\n- ( S_{n-1} ) gives the total from ( a_1 ) to ( a_{n-1} ).\n- Subtracting these yields only the ( n )-th term:\n[\na_n = (a_1 + \cdots + a_{n-1} + a_n) - (a_1 + \cdots + a_{n-1}) = a_n\n]", "This elegant derivation confirms what intuitive summation suggests—each term emerges as the difference between accumulated totals.", "---", "### Why This Formula Matters", "Understanding ( a_n = S_n - S_{n-1} ) equips learners and practitioners with a versatile tool:", "1. Analyzing Sequence Behavior\n By comparing consecutive partial sums, one can investigate growth patterns—whether sequences rise, fall, oscillate, or behave asymptotically.", "2. Deriving General Terms\n If a partial sum ( S_n ) is known explicitly, differentiating it (subtracting) yields a closed-form expression for ( a_n ), simplifying summation tasks and series convergence analysis.", "3. Computational Efficiency\n In algorithm design and numerical methods, computing ( a_n ) via differences avoids direct summation, enhancing performance—especially in large datasets.", "---", "### Examples in Action", "#### Example 1: Arithmetic Sequence\nLet ( a_n = 3n + 2 ).\nPartial sums:\n[\nS_n = \sum_{k=1}^{n} (3k + 2) = 3 \frac{n(n+1)}{2} + 2n = \frac{3n^2}{2} + \frac{7n}{2}\n]\nThen:\n[\nS_{n-1} = \frac{3(n-1)^2}{2} + \frac{7(n-1)}{2} = \frac{3n^2 - 6n + 3 + 7n - 7}{2} = \frac{3n^2 + n - 4}{2}\n]\nNow compute:\n[\na_n = S_n - S_{n-1} = \left( \frac{3n^2}{2} + \frac{7n}{2} \right) - \left( \frac{3n^2 + n - 4}{2} \right) = \frac{6n + 4}{2} = 3n + 2\n]\nConfirmed: the formula recovers the original term.", "#### Example 2: Geometric Sequence\nLet ( a_n = 2^n ). Then\n[\nS_n = \sum_{k=1}^{n} 2^k = 2(2^n - 1) = 2^{n+1} - 2\n]\nAnd\n[\nS_{n-1} = 2^n - 2\n]\nSo:\n[\na_n = S_n - S_{n-1} = (2^{n+1} - 2) - (2^n - 2) = 2^{n+1} - 2^n = 2^n\n]\nOnce again, the formula successfully extracts the ( n )-th term.", "---", "### Applications Beyond Pure Math", "This relationship extends beyond algebra into:", "- Computer Science: Efficient computation in recursive algorithms and dynamic programming.\n- Economics: Modeling cumulative flows such as total revenue or cumulative growth from sequential data.\n- Data Science: Deriving per-unit changes in aggregated metrics like total sales over time.", "---", "### Conclusion", "The expression\n[\n\boxed{a_n = S_n - S_{n-1}}\n]\nlies at the heart of understanding how individual terms are constructed within sequences. By leveraging partial sums and their differences, we unlock a deeper grasp of sequence behavior, efficient computation, and broad applicability across STEM fields. Whether you're solving for the nth term, analyzing convergence, or implementing algorithms—this formula remains an indispensable ally in both theoretical exploration and practical application.", "---", "Further Reading:\n- Summation techniques and telescoping series\n- Applications of partial sums in calculus\n- Recursive definitions and closed-form solutions", "Optimize your mathematical toolkit—master ( a_n = S_n - S_{n-1} ) and enhance your problem-solving capabilities!"]