The sum of the first \( n \) terms is \( S_n = 2n^2 + 3n \).

["# Understanding the Sum of the First ( n ) Terms: ( S_n = 2n^2 + 3n )", "When studying sequences and series, one of the fundamental concepts is the sum of the first ( n ) terms of a sequence. In this article, we explore the closed-form formula for the sum:", "[ S_n = 2n^2 + 3n ]", "where ( S_n ) represents the sum of the first ( n ) terms. By analyzing this expression, we uncover key properties of the underlying sequence, including individual term values, recurrence relations, and patterns in growth. Whether you're a student learning series or a math enthusiast reviewing algebraic summation techniques, this guide provides clear insights and practical applications.", "---", "## What Does ( S_n = 2n^2 + 3n ) Represent?", "The expression ( S_n = 2n^2 + 3n ) defines the cumulative sum of a sequence where each term represents a distinct value in the sequence. Formally:", "[\nS_n = a_1 + a_2 + a_3 + \cdots + a_n\n]", "Our goal is to extract meaningful information about the individual terms and understand how the total sum evolves as ( n ) increases.", "---", "## Extracting Individual Terms Using ( a_n )", "To study the sequence deeply, we derive the explicit formula for the ( n )-th term, ( a_n ), using the relationship between consecutive sums:", "[\na_n = S_n - S_{n-1}\n]", "For ( n \geq 2 ), compute:", "[\n\begin{aligned}\na_n &= (2n^2 + 3n) - \left[2(n-1)^2 + 3(n-1)\right] \\n&= 2n^2 + 3n - \left[2(n^2 - 2n + 1) + 3n - 3\right] \\n&= 2n^2 + 3n - (2n^2 - 4n + 2 + 3n - 3) \\n&= 2n^2 + 3n - (2n^2 - n - 1) \\n&= 2n^2 + 3n - 2n^2 + n + 1 \\n&= 4n + 1\n\end{aligned}\n]", "Therefore, for ( n \geq 2 ):\n[\n\boxed{a_n = 4n + 1}\n]", "Check the first term separately:\nWhen ( n = 1 ),\n[\nS_1 = 2(1)^2 + 3(1) = 5 \quad \Rightarrow \quad a_1 = 5\n]\nUsing the formula ( a_n = 4n + 1 ),\n[\na_1 = 4(1) + 1 = 5\n]\nThe formulas agree for ( n = 1 ), confirming consistency across all ( n \geq 1 ).", "---", "## Verifying ( a_n = 4n + 1 ) for Small ( n )", "| ( n ) | ( S_n = 2n^2 + 3n ) | ( a_n = S_n - S_{n-1} ) | Matches ( 4n + 1 )? |\n|--------|----------------------|--------------------------|-----------------------|\n| 1 | ( 5 ) | ( 5 ) | Yes |\n| 2 | ( 14 ) | ( 14 - 5 = 9 ) | ( 4(2)+1 = 9 ) |\n| 3 | ( 27 ) | ( 27 - 14 = 13 ) | ( 4(3)+1 = 13 ) |\n| 4 | ( 44 ) | ( 44 - 27 = 17 ) | ( 4(4)+1 = 17 ) |\n| 5 | ( 65 ) | ( 65 - 44 = 21 ) | ( 4(5)+1 = 21 ) |", "The formula ( a_n = 4n + 1 ) correctly reconstructs each term.", "---", "## Analyzing the Growth of ( S_n )", "The sum ( S_n = 2n^2 + 3n ) is a quadratic polynomial in ( n ). This indicates the sequence grows at a quadratic rate—faster than linear but slower than exponential.", "- Dominant term: ( 2n^2 ), so as ( n \ o \infty ), ( S_n ) behaves like ( 2n^2 ).\n- Rate of change:\n[\n\Delta S_n = S_n - S_{n-1} = 4n + 1\n]\nThis tells us that each additional term adds ( 4n + 1 ), increasing linearly with ( n ).", "---", "## Relation to Mini-Sums and Recurrence Patterns", "Notice that the difference ( \Delta S_n = a_n = 4n + 1 ) is linear. Recurrence relations often simplify when derived this way.", "The sequence ( a_n = 4n + 1 ) satisfies the recurrence:\n[\na_n = a_{n-1} + (4n + 1) - (4(n-1) + 1) = a_{n-1} + 4\n]\nBut from earlier calculation, ( a_n - a_{n-1} = 4n + 1 - (4(n-1) + 1) = 4n + 1 - (4n - 4 + 1) = 4 ). Wait — correction:", "Wait — earlier we found ( a_n = 4n + 1 ), so:\n[\na_n - a_{n-1} = (4n + 1) - (4(n-1) + 1) = 4n + 1 - (4n - 4 + 1) = 4n + 1 - 4n + 3 = 4\n]\nThus, the sequence ( a_n = 4n + 1 ) forms an arithmetic progression with common difference 4, starting at ( a_1 = 5 ).", "---", "## Applications and Practical Use", "Understanding ( S_n = 2n^2 + 3n ) and ( a_n = 4n + 1 ) has several educational and practical benefits:", "- Problem Solving: Enables quick computation of total sums in standard sequences.\n- Verification: Allows checking sums using a derived closed-form formula.\n- Pattern Recognition: Demonstrates how summation transforms from linear to quadratic behavior.\n- Math Foundations: Supports deeper study in discrete mathematics, series convergence, and algorithm analysis in computer science.", "---", "## Summary", "The sum of the first ( n ) terms given by\n[\nS_n = 2n^2 + 3n\n]\ncorresponds to a sequence where each term is linearly increasing:\n[\na_n = 4n + 1 \quad \ ext{for } n \geq 1\n]\nThis quadratic growth allows efficient computation and analysis, linking summation techniques to algebraic manipulation and sequence behavior. Whether for assignments, exams, or deepening mathematical insight, mastering such formulas strengthens problem-solving skills across numerous disciplines.", "---", "## Further Reading & Related Topics", "- Sum of arithmetic sequences: ( S_n = \frac{n}{2}(a_1 + a_n) )\n- Sum of squares: ( S_n = \frac{n(n+1)(2n+1)}{6} )\n- Discrete summation and telescoping series\n- Generating functions for sequence analysis", "---", "Keywords: sum of first ( n ) terms, ( S_n = 2n^2 + 3n ), mathematical series, closed-form formula, individual term derivation, arithmetic sequences, quadratic sum, term-by-term analysis, recurrence relations."]