Study guide
7.1 Arithmetic Sequences and Sums
Gaokao Mathematics Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Sets, Logic, and Algebraic Foundations
1.1 Sets and Set Operations 1.2 Propositional Logic and Quantifiers 1.3 Inequalities and Absolute Value Equations
2 Chapter 2: Functions and Fundamental Properties
2.1 Concept, Domain, Range, and Mapping of Functions 2.2 Monotonicity, Parity, and Periodicity of Functions 2.3 Function Graphs, Transformations, and Zeros
3 Chapter 3: Exponential, Logarithmic, and Power Functions
3.1 Exponents and Exponential Functions 3.2 Logarithms and Logarithmic Functions 3.3 Power Functions and Comparative Growth Rates
4 Chapter 4: Complex Numbers and Quadratic Function Views
4.1 Algebraic and Geometric Representations of Complex Numbers 4.2 Complex Number Operations and Equations 4.3 Quadratic Equations and Inequalities from a Function Viewpoint
5 Chapter 5: Trigonometric Functions and Identities
5.1 Angles, Radians, and Unit Circle Definitions 5.2 Trigonometric Identities and Reduction Formulas 5.3 Addition, Subtraction, and Double-Angle Formulas 5.4 Graphs and Properties of Sine, Cosine, and Tangent Functions
6 Chapter 6: Triangles and Trigonometric Applications
6.1 Sine Theorem, Cosine Theorem, and Triangle Area Formulas 6.2 Solving Triangles and Comprehensive Geometric Applications 6.3 Practical Measurement, Optimization, and Trigonometric Modeling
7 Chapter 7: Sequences and Series
7.1 Arithmetic Sequences and Sums 7.2 Geometric Sequences and Sums 7.3 Recurrence Relations and General Term Determination 7.4 Advanced Summation Techniques and Sequence Applications
8 Chapter 8: Plane Vectors
8.1 Vector Concepts, Addition, Subtraction, and Scalar Multiplication 8.2 Coordinate Operations of Vectors 8.3 Dot Products, Angles, Vector Projections, and Geometric Applications
9 Chapter 9: Lines and Circles in Cartesian Coordinates
9.1 Equations of Straight Lines and Positional Relationships 9.2 Standard and General Equations of Circles 9.3 Positional Relationships Between Lines and Circles
10 Chapter 10: Conic Sections: Ellipses
10.1 Standard Equations and Definitions of Ellipses 10.2 Geometric Properties of Ellipses (Vertices, Foci, Eccentricity) 10.3 Intersection of Lines and Ellipses and Chord Problems
11 Chapter 11: Conic Sections: Hyperbolas and Parabolas
11.1 Hyperbola Definitions, Standard Equations, and Asymptotes 11.2 Parabola Definitions, Standard Equations, and Focal Properties 11.3 Unified Properties of Conic Sections and Trajectory Problems
12 Chapter 12: Solid Geometry: Three-Dimensional Figures
12.1 Prisms, Pyramids, Cylinders, Cones, and Spheres 12.2 Three-Dimensional Views and Cross-Sections 12.3 Surface Area and Volume Calculations
13 Chapter 13: Spatial Lines, Planes, and Spatial Vectors
13.1 Positional Relationships of Lines and Planes in Space 13.2 Parallelism and Perpendicularity Proofs in Solid Geometry 13.3 Spatial Coordinates and Spatial Vector Operations 13.4 Using Spatial Vectors to Compute Angles and Distances
14 Chapter 14: Permutations, Combinations, and Binomial Theorem
14.1 Fundamental Counting Principles (Addition and Multiplication Rules) 14.2 Permutations and Combinations 14.3 Binomial Theorem, Expansion Terms, and Coefficients
15 Chapter 15: Probability and Statistics
15.1 Classical Probability and Conditional Probability 15.2 Independent Events and Repeated Bernoulli Trials 15.3 Discrete Random Variables, Probability Distributions, Expectation, and Variance 15.4 Normal Distribution, Statistical Sampling, Correlation, and Regression
16 Chapter 16: Derivatives and Mathematical Modeling
16.1 Limit Concepts and Derivatives of Elementary Functions 16.2 Tangent Lines, Derivatives, Monotonicity, and Extremum Analysis 16.3 Optimization Problems and Curve Sketching with Derivatives 16.4 Real-World Mathematical Modeling and Problem Solving
7.1 Arithmetic Sequences and Sums
Key Takeaways Explain This Topic AI
An arithmetic sequence (a_n) is defined by a_{n+1} - a_n = d for all n >= 1, yielding the general term a_n = a_1 + (n-1)d.
The term index property states that if m + n = p + q, then a_m + a_n = a_p + a_q, which provides rapid evaluation paths in Gaokao problems.
The sum of the first n terms S_n = n(a_1 + a_n)/2 = (d/2)n^2 + (a_1 - d/2)n is a quadratic discrete function with zero constant term.
Extremum determination of S_n can be analyzed by inspecting the continuous discrete quadratic vertex or finding the term index n where terms transition sign.
Block partial sums S_k, S_{2k}-S_k, S_{3k}-S_{2k}, ... form another arithmetic sequence with common difference k^2 d.
Last updated: July 2026
- 7.1 Arithmetic Sequences and Sums
- 1. Mathematical Definition and Recursive Structure
An arithmetic sequence (等差数列) is a sequence of real numbers ( a n ) = ( a 1 , a 2 , a 3 , … ) (a_n) = (a_1, a_2, a_3, \dots) ( a n ) = ( a 1 , a 2 , a 3 , … ) in which the difference between any two consecutive terms is constant. Formally, a sequence ( a n ) (a_n) ( a n ) is an arithmetic sequence if and only if there exists a constant real number d ∈ R d \in \mathbb{R} d ∈ R , called the common difference (公差), such that: a n + 1 − a n = d , ∀ n ∈ N ∗ a_{n+1} - a_n = d, \quad \forall n \in \mathbb{N}^* a n + 1 − a n = d , ∀ n ∈ N ∗
Equivalently, the sequence satisfies the three-term relation: 2 a n = a n − 1 + a n + 1 , ∀ n ≥ 2 , n ∈ N ∗ 2 a_n = a_{n-1} + a_{n+1}, \quad \forall n \ge 2, n \in \mathbb{N}^* 2 a n = a n − 1 + a n + 1 , ∀ n ≥ 2 , n ∈ N ∗
General Term Derivation
To derive the general term a n a_n a n from the first term a 1 a_1 a 1 and common difference d d d , we employ the difference accumulation method (累加法). Writing out the definition for successive indices: a 2 − a 1 & = d a 3 − a 2 & = d a 4 − a 3 & = d & ⋮ a n − a n − 1 & = d \begin{aligned}
- a_2 - a_1 \&= d \\
- a_3 - a_2 \&= d \\
- a_4 - a_3 \&= d \\
- \&\vdots \\
- a_n - a_{n-1} \&= d
- \end{aligned} a 2 − a 1 & = d a 3 − a 2 & = d a 4 − a 3 & = d & ⋮ a n − a n − 1 & = d
Summing these n − 1 n-1 n − 1 equations telescopes the left side: ( a 2 − a 1 ) + ( a 3 − a 2 ) + ⋯ + ( a n − a n − 1 ) = ∑ k = 1 n − 1 d (a_2 - a_1) + (a_3 - a_2) + \dots + (a_n - a_{n-1}) = \sum_{k=1}^{n-1} d ( a 2 − a 1 ) + ( a 3 − a 2 ) + ⋯ + ( a n − a n − 1 ) = k = 1 ∑ n − 1 d a n − a 1 = ( n − 1 ) d ⟹ a n = a 1 + ( n − 1 ) d a_n - a_1 = (n-1)d \implies a_n = a_1 + (n-1)d a n − a 1 = ( n − 1 ) d ⟹ a n = a 1 + ( n − 1 ) d
2. Discrete Linear Function Interpretation
Re-arranging the general term formula yields: a n = d ⋅ n + ( a 1 − d ) a_n = d \cdot n + (a_1 - d) a n = d ⋅ n + ( a 1 − d )
When viewed through the lens of continuous functions, a n = f ( n ) a_n = f(n) a n = f ( n ) where f ( x ) = d x + ( a 1 − d ) f(x) = dx + (a_1 - d) f ( x ) = d x + ( a 1 − d ) is a linear function defined on the discrete domain N ∗ \mathbb{N}^* N ∗ .
Function Property Continuous Linear Function f ( x ) = k x + b f(x) = kx + b f ( x ) = k x + b Arithmetic Sequence a n = d n + ( a 1 − d ) a_n = dn + (a_1 - d) a n = d n + ( a 1 − d )
- Domain R \mathbb{R} R N ∗ = { 1 , 2 , 3 , … } \mathbb{N}^* = \{1, 2, 3, \dots\} N ∗ = { 1 , 2 , 3 , … }
- Slope / Growth k k k (Slope) d d d (Common Difference)
Monotonicity Strictly increasing if k > 0 k>0 k > 0 , decreasing if k < 0 k<0 k < 0 , constant if k = 0 k=0 k = 0 Strictly increasing if d > 0 d>0 d > 0 , decreasing if d < 0 d<0 d < 0 , constant if d = 0 d=0 d = 0
Geometric Representation Continuous straight line in R 2 \mathbb{R}^2 R 2 Set of collinear discrete points ( n , a n ) (n, a_n) ( n , a n )
3. Core Term Index Properties
One of the most powerful tools for solving Gaokao arithmetic sequence problems is the term index summation property .
Theorem (Index Sum Equivalence)
If ( a n ) (a_n) ( a n ) is an arithmetic sequence and m , n , p , q ∈ N ∗ m, n, p, q \in \mathbb{N}^* m , n , p , q ∈ N ∗ satisfy m + n = p + q m + n = p + q m + n = p + q , then: a m + a n = a p + a q a_m + a_n = a_p + a_q a m + a n = a p + a q
Proof : Express each term in terms of a 1 a_1 a 1 and d d d : a m + a n = [ a 1 + ( m − 1 ) d ] + [ a 1 + ( n − 1 ) d ] = 2 a 1 + ( m + n − 2 ) d a_m + a_n = [a_1 + (m-1)d] + [a_1 + (n-1)d] = 2a_1 + (m+n-2)d a m + a n = [ a 1 + ( m − 1 ) d ] + [ a 1 + ( n − 1 ) d ] = 2 a 1 + ( m + n − 2 ) d a p + a q = [ a 1 + ( p − 1 ) d ] + [ a 1 + ( q − 1 ) d ] = 2 a 1 + ( p + q − 2 ) d a_p + a_q = [a_1 + (p-1)d] + [a_1 + (q-1)d] = 2a_1 + (p+q-2)d a p + a q = [ a 1 + ( p − 1 ) d ] + [ a 1 + ( q − 1 ) d ] = 2 a 1 + ( p + q − 2 ) d
- Since m + n = p + q m + n = p + q m + n = p + q , the two expressions are identically equal. ■ \blacksquare ■
- Corollary: Arithmetic Mean Property
For any term a k a_k a k ( k ≥ 2 k \ge 2 k ≥ 2 ), setting m = k − 1 m = k-1 m = k − 1 and n = k + 1 n = k+1 n = k + 1 gives ( k − 1 ) + ( k + 1 ) = 2 k (k-1) + (k+1) = 2k ( k − 1 ) + ( k + 1 ) = 2 k , so: a k − 1 + a k + 1 = 2 a k ⟹ a k = a k − 1 + a k + 1 2 a_{k-1} + a_{k+1} = 2 a_k \implies a_k = \frac{a_{k-1} + a_{k+1}}{2} a k − 1 + a k + 1 = 2 a k ⟹ a k = 2 a k − 1 + a k + 1
Similarly, for an odd number of terms 2 k − 1 2k-1 2 k − 1 , the sum of terms symmetric about the middle term a k a_k a k satisfies: a 1 + a 2 k − 1 = a 2 + a 2 k − 2 = ⋯ = 2 a k a_1 + a_{2k-1} = a_2 + a_{2k-2} = \dots = 2 a_k a 1 + a 2 k − 1 = a 2 + a 2 k − 2 = ⋯ = 2 a k
4. Partial Sum Formulas ( S n S_n S n )
The sum of the first n n n terms of a sequence is denoted by S n = ∑ k = 1 n a k = a 1 + a 2 + ⋯ + a n S_n = \sum_{k=1}^n a_k = a_1 + a_2 + \dots + a_n S n = ∑ k = 1 n a k = a 1 + a 2 + ⋯ + a n .
Gauss Reverse Pairing Derivation
To derive S n S_n S n , write S n S_n S n in forward and reverse order: S n & = a 1 + a 2 + a 3 + ⋯ + a n − 1 + a n S n & = a n + a n − 1 + a n − 2 + ⋯ + a 2 + a 1 \begin{aligned}
- S_n \&= a_1 + a_2 + a_3 + \dots + a_{n-1} + a_n \\
- S_n \&= a_n + a_{n-1} + a_{n-2} + \dots + a_2 + a_1
\end{aligned} S n & = a 1 + a 2 + a 3 + ⋯ + a n − 1 + a n S n & = a n + a n − 1 + a n − 2 + ⋯ + a 2 + a 1
Adding these two equations column by column: 2 S n = ( a 1 + a n ) + ( a 2 + a n − 1 ) + ( a 3 + a n − 2 ) + ⋯ + ( a n + a 1 ) 2 S_n = (a_1 + a_n) + (a_2 + a_{n-1}) + (a_3 + a_{n-2}) + \dots + (a_n + a_1) 2 S n = ( a 1 + a n ) + ( a 2 + a n − 1 ) + ( a 3 + a n − 2 ) + ⋯ + ( a n + a 1 )
By the term index summation property, a 1 + a n = a 2 + a n − 1 = a 3 + a n − 2 = … a_1 + a_n = a_2 + a_{n-1} = a_3 + a_{n-2} = \dots a 1 + a n = a 2 + a n − 1 = a 3 + a n − 2 = … . Thus, all n n n paired sums are equal to a 1 + a n a_1 + a_n a 1 + a n : 2 S n = n ( a 1 + a n ) ⟹ S n = n ( a 1 + a n ) 2 2 S_n = n(a_1 + a_n) \implies S_n = \frac{n(a_1 + a_n)}{2} 2 S n = n ( a 1 + a n ) ⟹ S n = 2 n ( a 1 + a n )
Substituting a n = a 1 + ( n − 1 ) d a_n = a_1 + (n-1)d a n = a 1 + ( n − 1 ) d yields the secondary quadratic sum formula: S n = n [ 2 a 1 + ( n − 1 ) d ] 2 = n a 1 + n ( n − 1 ) 2 d = d 2 n 2 + ( a 1 − d 2 ) n S_n = \frac{n[2a_1 + (n-1)d]}{2} = n a_1 + \frac{n(n-1)}{2} d = \frac{d}{2} n^2 + \left(a_1 - \frac{d}{2}\right) n S n = 2 n [ 2 a 1 + ( n − 1 ) d ] = n a 1 + 2 n ( n − 1 ) d = 2 d n 2 + ( a 1 − 2 d ) n
Quadratic Functional Structure of S n S_n S n
Let A = d 2 A = \frac{d}{2} A = 2 d and B = a 1 − d 2 B = a_1 - \frac{d}{2} B = a 1 − 2 d . Then S n = A n 2 + B n S_n = A n^2 + B n S n = A n 2 + B n .
Key Gaokao Insight : A sequence ( a n ) (a_n) ( a n ) is an arithmetic sequence if and only if its partial sum S n S_n S n can be expressed as a quadratic function of n n n with zero constant term ( S n = A n 2 + B n S_n = A n^2 + B n S n = A n 2 + B n ). If a constant term C ≠ 0 C \neq 0 C = 0 is present ( S n = A n 2 + B n + C S_n = A n^2 + B n + C S n = A n 2 + B n + C ), the sequence is arithmetic starting only from n = 2 n=2 n = 2 , while a 1 = S 1 = A + B + C ≠ A + B a_1 = S_1 = A + B + C \neq A + B a 1 = S 1 = A + B + C = A + B .
5. Partial Block Sum Property
For any positive integer k k k , if we partition the terms of an arithmetic sequence ( a n ) (a_n) ( a n ) into consecutive blocks of size k k k and sum each block: T 1 = S k = a 1 + a 2 + ⋯ + a k T_1 = S_k = a_1 + a_2 + \dots + a_k T 1 = S k = a 1 + a 2 + ⋯ + a k T 2 = S 2 k − S k = a k + 1 + a k + 2 + ⋯ + a 2 k T_2 = S_{2k} - S_k = a_{k+1} + a_{k+2} + \dots + a_{2k} T 2 = S 2 k − S k = a k + 1 + a k + 2 + ⋯ + a 2 k T 3 = S 3 k − S 2 k = a 2 k + 1 + a 2 k + 2 + ⋯ + a 3 k T_3 = S_{3k} - S_{2k} = a_{2k+1} + a_{2k+2} + \dots + a_{3k} T 3 = S 3 k − S 2 k = a 2 k + 1 + a 2 k + 2 + ⋯ + a 3 k
Then the sequence of block sums ( T 1 , T 2 , T 3 , … ) (T_1, T_2, T_3, \dots) ( T 1 , T 2 , T 3 , … ) forms another arithmetic sequence with common difference D = k 2 d D = k^2 d D = k 2 d .
Proof : Note that a k + i − a i = k d a_{k+i} - a_i = k d a k + i − a i = k d for each i ∈ { 1 , 2 , … , k } i \in \{1, 2, \dots, k\} i ∈ { 1 , 2 , … , k } . Summing over i = 1 … k i=1 \dots k i = 1 … k : T 2 − T 1 = ∑ i = 1 k ( a k + i − a i ) = ∑ i = 1 k k d = k ⋅ ( k d ) = k 2 d . ■ T_2 - T_1 = \sum_{i=1}^k (a_{k+i} - a_i) = \sum_{i=1}^k k d = k \cdot (k d) = k^2 d. \quad \blacksquare T 2 − T 1 = i = 1 ∑ k ( a k + i − a i ) = i = 1 ∑ k k d = k ⋅ ( k d ) = k 2 d . ■
6. Extremum of Partial Sum S n S_n S n
When d ≠ 0 d \neq 0 d = 0 , S n = d 2 n 2 + ( a 1 − d 2 ) n S_n = \frac{d}{2} n^2 + \left(a_1 - \frac{d}{2}\right) n S n = 2 d n 2 + ( a 1 − 2 d ) n is a quadratic function of discrete integer variable n n n .
Determination Methods for Maximum / Minimum of S n S_n S n :
Term Sign Analysis Method (项正负分析法) :
If a 1 > 0 a_1 > 0 a 1 > 0 and d < 0 d < 0 d < 0 , terms decrease. S n S_n S n reaches its maximum value when n n n is the index of the last non-negative term, i.e., a n ≥ 0 a_n \ge 0 a n ≥ 0 and a n + 1 ≤ 0 a_{n+1} \le 0 a n + 1 ≤ 0 .
If a 1 < 0 a_1 < 0 a 1 < 0 and d > 0 d > 0 d > 0 , terms increase. S n S_n S n reaches its minimum value when n n n is the index of the last non-positive term, i.e., a n ≤ 0 a_n \le 0 a n ≤ 0 and a n + 1 ≥ 0 a_{n+1} \ge 0 a n + 1 ≥ 0 .
Symmetry of Quadratic Vertex Method (二次函数对称轴法) :
Consider continuous function f ( x ) = d 2 x 2 + ( a 1 − d 2 ) x f(x) = \frac{d}{2} x^2 + \left(a_1 - \frac{d}{2}\right) x f ( x ) = 2 d x 2 + ( a 1 − 2 d ) x . The axis of symmetry is x 0 = − B 2 A = 1 2 − a 1 d x_0 = -\frac{B}{2A} = \frac{1}{2} - \frac{a_1}{d} x 0 = − 2 A B = 2 1 − d a 1 .
The integer n ∈ N ∗ n \in \mathbb{N}^* n ∈ N ∗ closest to x 0 x_0 x 0 maximizes or minimizes S n S_n S n . If x 0 x_0 x 0 is a half-integer ( k + 0.5 k + 0.5 k + 0.5 ), then S k = S k + 1 S_k = S_{k+1} S k = S k + 1 are dual extrema.
Loading diagram... Arithmetic Sequence Structural Relationships
- Worked Gaokao Exam Examples
- Example 1 (Term Index and General Term Determination)
Problem : In an arithmetic sequence ( a n ) (a_n) ( a n ) , it is known that a 3 + a 8 = 22 a_3 + a_8 = 22 a 3 + a 8 = 22 and S 5 = 35 S_5 = 35 S 5 = 35 .
Find the general term formula for a n a_n a n .
Find the partial sum formula for S n S_n S n .
Solution :
Express the given conditions in terms of a 1 a_1 a 1 and d d d .
Using a n = a 1 + ( n − 1 ) d a_n = a_1 + (n-1)d a n = a 1 + ( n − 1 ) d : a 3 + a 8 = ( a 1 + 2 d ) + ( a 1 + 7 d ) = 2 a 1 + 9 d = 22 a_3 + a_8 = (a_1 + 2d) + (a_1 + 7d) = 2a_1 + 9d = 22 a 3 + a 8 = ( a 1 + 2 d ) + ( a 1 + 7 d ) = 2 a 1 + 9 d = 22
Using S 5 = 5 ( a 1 + a 5 ) 2 = 5 a 1 + 10 d = 35 S_5 = \frac{5(a_1 + a_5)}{2} = 5a_1 + 10d = 35 S 5 = 2 5 ( a 1 + a 5 ) = 5 a 1 + 10 d = 35 , which simplifies to: a 1 + 2 d = 7 a_1 + 2d = 7 a 1 + 2 d = 7
Now solve the system of linear equations: { 2 a 1 + 9 d = 22 a 1 + 2 d = 7 \begin{cases} 2a_1 + 9d = 22 \\ a_1 + 2d = 7 \end{cases} { 2 a 1 + 9 d = 22 a 1 + 2 d = 7
Multiplying the second equation by 2 gives 2 a 1 + 4 d = 14 2a_1 + 4d = 14 2 a 1 + 4 d = 14 . Subtracting this from the first equation: 5 d = 8 ⟹ d = 2 5d = 8 \implies d = 2 5 d = 8 ⟹ d = 2
Substituting d = 2 d = 2 d = 2 back into a 1 + 2 d = 7 a_1 + 2d = 7 a 1 + 2 d = 7 yields a 1 = 3 a_1 = 3 a 1 = 3 .
Therefore, the general term is: a n = 3 + ( n − 1 ) ⋅ 2 = 2 n + 1 a_n = 3 + (n-1) \cdot 2 = 2n + 1 a n = 3 + ( n − 1 ) ⋅ 2 = 2 n + 1
The partial sum formula S n S_n S n is: S n = n ( a 1 + a n ) 2 = n ( 3 + 2 n + 1 ) 2 = n ( 2 n + 4 ) 2 = n 2 + 2 n S_n = \frac{n(a_1 + a_n)}{2} = \frac{n(3 + 2n + 1)}{2} = \frac{n(2n + 4)}{2} = n^2 + 2n S n = 2 n ( a 1 + a n ) = 2 n ( 3 + 2 n + 1 ) = 2 n ( 2 n + 4 ) = n 2 + 2 n
Example 2 (Extremum of Partial Sum S n S_n S n )
Problem : Let ( a n ) (a_n) ( a n ) be an arithmetic sequence with initial term a 1 = 25 a_1 = 25 a 1 = 25 and common difference d = − 4 d = -4 d = − 4 .
Find the term index n n n for which the partial sum S n S_n S n attains its maximum value.
Calculate the maximum value of S n S_n S n .
Solution :
Method 1: Term Sign Analysis The general term is a n = 25 + ( n − 1 ) ( − 4 ) = 29 − 4 n a_n = 25 + (n-1)(-4) = 29 - 4n a n = 25 + ( n − 1 ) ( − 4 ) = 29 − 4 n .
We solve a n ≥ 0 a_n \ge 0 a n ≥ 0 : 29 − 4 n ≥ 0 ⟹ 4 n ≤ 29 ⟹ n ≤ 7.25 29 - 4n \ge 0 \implies 4n \le 29 \implies n \le 7.25 29 − 4 n ≥ 0 ⟹ 4 n ≤ 29 ⟹ n ≤ 7.25
Since n ∈ N ∗ n \in \mathbb{N}^* n ∈ N ∗ , the terms are positive for n ≤ 7 n \le 7 n ≤ 7 and negative for n ≥ 8 n \ge 8 n ≥ 8 : a 7 = 29 − 4 ( 7 ) = 1 > 0 a_7 = 29 - 4(7) = 1 > 0 a 7 = 29 − 4 ( 7 ) = 1 > 0 a 8 = 29 − 4 ( 8 ) = − 3 < 0 a_8 = 29 - 4(8) = -3 < 0 a 8 = 29 − 4 ( 8 ) = − 3 < 0
Because adding positive terms increases S n S_n S n and adding negative terms decreases S n S_n S n , S n S_n S n reaches its maximum at n = 7 n = 7 n = 7 .
Calculation of Maximum Value : S 7 = 7 ( a 1 + a 7 ) 2 = 7 ( 25 + 1 ) 2 = 7 × 26 2 = 91 S_7 = \frac{7(a_1 + a_7)}{2} = \frac{7(25 + 1)}{2} = \frac{7 \times 26}{2} = 91 S 7 = 2 7 ( a 1 + a 7 ) = 2 7 ( 25 + 1 ) = 2 7 × 26 = 91
Alternatively, using S n = d 2 n 2 + ( a 1 − d 2 ) n = − 2 n 2 + 27 n S_n = \frac{d}{2}n^2 + (a_1 - \frac{d}{2})n = -2n^2 + 27n S n = 2 d n 2 + ( a 1 − 2 d ) n = − 2 n 2 + 27 n : S 7 = − 2 ( 7 ) 2 + 27 ( 7 ) = − 98 + 189 = 91 S_7 = -2(7)^2 + 27(7) = -98 + 189 = 91 S 7 = − 2 ( 7 ) 2 + 27 ( 7 ) = − 98 + 189 = 91
The maximum value of S n S_n S n is 91 91 91 at n = 7 n = 7 n = 7 .