Study guide
8.2 Arithmetic & Geometric Sequences
GMAT Quantitative Reasoning Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Exam Structure, Adaptive Scoring & Problem Solving Fundamentals
1.1 GMAT Focus Quant Overview & Question Mechanics 1.2 Mental Math, Estimation & Non-Calculator Strategies 1.3 Problem Solving Strategies & Elimination Techniques
2 Chapter 2: Number Theory & Integer Properties
2.1 Divisibility Rules, Prime Factorization & Factors 2.2 Greatest Common Factor (GCF) & Least Common Multiple (LCM) 2.3 Division Algorithm & Remainder Arithmetic 2.4 Parity, Signs & Consecutive Integer Properties 2.5 Real Numbers, the Number Line & Properties of Operations
3 Chapter 3: Fractions, Decimals, Ratios & Percentages
3.1 Fraction Arithmetic & Operations 3.2 Decimals, Place Value & Terminating Decimals 3.3 Ratios, Proportions & Variation 3.4 Percentages, Percent Change, Markup & Profit
4 Chapter 4: Exponents, Roots & Radical Expressions
4.1 Laws of Exponents & Exponential Equations 4.2 Radicals & Operations with Roots 4.3 Exponent & Root Inequalities and Traps
5 Chapter 5: Algebraic Expressions, Equations & Inequalities
5.1 Algebraic Manipulation & Special Products 5.2 Linear Equations & Systems of Equations 5.3 Quadratic Equations, Roots & Factoring 5.4 Inequalities, Sign Charts & Absolute Value 5.5 Formulas, Units & Measurement Conversion
6 Chapter 6: Coordinate Geometry & Linear Functions
6.1 The Coordinate Plane, Distance & Midpoint 6.2 Slope, Equations of Lines & Intercepts 6.3 Functions, Notation & Transformations
7 Chapter 7: Rates, Work, Motion & Mixture Word Problems
7.1 Uniform Motion: Rate, Time & Distance 7.2 Relative Speed, Catch-Up & Current/Wind Problems 7.3 Work-Rate & Cooperative Labor 7.4 Mixture & Weighted Average Word Problems
8 Chapter 8: Applied Word Problems, Sets & Sequences
8.1 Overlapping Sets & Venn Diagrams 8.2 Arithmetic & Geometric Sequences 8.3 Simple & Compound Interest Calculations 8.4 Age Problems & Discrete Optimization
9 Chapter 9: Descriptive Statistics & Data Distributions
9.1 Mean, Median & Mode 9.2 Range, Variance & Standard Deviation 9.3 Frequency Distributions & Distribution Properties
10 Chapter 10: Permutations, Combinations & Probability
10.1 Fundamental Counting Principle & Factorials 10.2 Combinations, Permutations & Grouping 10.3 Probability Rules: Independent & Dependent Events 10.4 Complementary Probability & Multi-Stage Events
8.2 Arithmetic & Geometric Sequences
Key Takeaways Explain This Topic AI
An arithmetic sequence changes by a constant difference d; the n-th term is a_n = a_1 + (n − 1)d, and the inclusive term count is n = (last − first)/d + 1.
The sum of n arithmetic terms is n times the average of the first and last terms: S_n = n(a_1 + a_n)/2.
A geometric sequence scales by a constant ratio r; the n-th term is a_n = a_1 r^(n−1), and the finite sum is S_n = a_1(r^n − 1)/(r − 1) when r ≠ 1.
Evenly spaced integers are arithmetic: their mean equals the average of the first and last terms and also equals the median.
Recursive sequences are handled by computing the first several terms, identifying a cycle of length p when one appears, and reducing the index with N mod p.
Last updated: August 2026
Official Guide Math Review 3.4 groups series with sets, counting, and estimation. On GMAT Quantitative Reasoning you will not be asked to derive closed forms from first principles. You will be asked to recognize a constant difference, a constant ratio, or a repeating cycle, then apply a short formula by hand in 45 minutes with no calculator.
Arithmetic Sequences
An arithmetic sequence has a constant difference d = a n + 1 − a n d = a_{n+1} - a_n d = a n + 1 − a n . Once a 1 a_1 a 1 and d d d are known, every later term is determined: a n = a 1 + ( n − 1 ) d a_n = a_1 + (n - 1)d a n = a 1 + ( n − 1 ) d
Relating two arbitrary terms: a m = a k + ( m − k ) d a_m = a_k + (m - k)d a m = a k + ( m − k ) d . The number of terms from a 1 a_1 a 1 through a n a_n a n inclusive is n = a n − a 1 d + 1 n = \frac{a_n - a_1}{d} + 1 n = d a n − a 1 + 1
The extra + 1 +1 + 1 is the inclusive-count correction. Forgetting it is the most common arithmetic-sequence error on Problem Solving items that ask how many multiples of k k k lie between two endpoints.
The sum of n n n arithmetic terms is n n n times the average of the first and last terms: S n = n × a 1 + a n 2 = n 2 [ 2 a 1 + ( n − 1 ) d ] S_n = n \times \frac{a_1 + a_n}{2} = \frac{n}{2}\bigl[2a_1 + (n - 1)d\bigr] S n = n × 2 a 1 + a n = 2 n [ 2 a 1 + ( n − 1 ) d ]
That average is also the mean of the entire list, and it is the median when n n n is odd (the middle term) or the average of the two central terms when n n n is even.
Evenly Spaced Integers
Consecutive integers, consecutive evens, consecutive odds, and the multiples of a fixed integer k k k are all arithmetic. High-yield special cases:
First n n n positive integers: 1 + 2 + ⋯ + n = n ( n + 1 ) / 2 1 + 2 + \cdots + n = n(n + 1)/2 1 + 2 + ⋯ + n = n ( n + 1 ) /2
First n n n odd positives: 1 + 3 + ⋯ + ( 2 n − 1 ) = n 2 1 + 3 + \cdots + (2n - 1) = n^2 1 + 3 + ⋯ + ( 2 n − 1 ) = n 2
First n n n even positives: 2 + 4 + ⋯ + 2 n = n ( n + 1 ) 2 + 4 + \cdots + 2n = n(n + 1) 2 + 4 + ⋯ + 2 n = n ( n + 1 )
Multiples of k k k from a a a through b b b inclusive: first = the least multiple of k k k that is ≥ a \ge a ≥ a , last = the greatest multiple of k k k that is ≤ b \le b ≤ b , then apply the arithmetic-sum formula
Because the list is evenly spaced, the mean equals ( first + last ) / 2 (\text{first} + \text{last})/2 ( first + last ) /2 . If a GMAT stem gives the mean of an evenly spaced set, you already know the average of the endpoints.
Geometric Sequences
A geometric sequence has a constant ratio r = a n + 1 / a n r = a_{n+1}/a_n r = a n + 1 / a n with r ≠ 0 r \neq 0 r = 0 . The n n n -th term is a n = a 1 ⋅ r n − 1 a_n = a_1 \cdot r^{n-1} a n = a 1 ⋅ r n − 1
The sum of the first n n n terms, for r ≠ 1 r \neq 1 r = 1 , is S n = a 1 r n − 1 r − 1 = a 1 1 − r n 1 − r S_n = a_1 \frac{r^n - 1}{r - 1} = a_1 \frac{1 - r^n}{1 - r} S n = a 1 r − 1 r n − 1 = a 1 1 − r 1 − r n
If r = 1 r = 1 r = 1 , the sequence is constant and S n = n a 1 S_n = n a_1 S n = n a 1 . GMAT items almost never require a logarithm to recover n n n . Typical common ratios are 2 2 2 , 3 3 3 , 1 / 2 1/2 1/2 , 1 / 3 1/3 1/3 , or 10 10 10 , so you multiply term-by-term or evaluate a small power such as 2 6 = 64 2^6 = 64 2 6 = 64 by doubling.
Three consecutive positive terms a a a , b b b , c c c form a geometric sequence if and only if b 2 = a c b^2 = ac b 2 = a c (the middle term is the geometric mean).
Infinite Geometric Series
If ∣ r ∣ < 1 |r| < 1 ∣ r ∣ < 1 , the infinite sum converges: S ∞ = a 1 1 − r S_{\infty} = \frac{a_1}{1 - r} S ∞ = 1 − r a 1
If ∣ r ∣ ≥ 1 |r| \ge 1 ∣ r ∣ ≥ 1 , the series diverges. A classic application is a bouncing-ball total distance. A ball dropped from height H H H that rebounds each time to a fraction r r r of the previous height travels H + 2 ∑ k = 1 ∞ H r k = H + 2 H r 1 − r = H 1 + r 1 − r H + 2\sum_{k=1}^{\infty} H r^k = H + \frac{2Hr}{1 - r} = H\frac{1 + r}{1 - r} H + 2 k = 1 ∑ ∞ H r k = H + 1 − r 2 Hr = H 1 − r 1 + r
The first drop is counted once; every later descent is paired with the preceding ascent. Repeating decimals are the same series: 0. 36 ‾ = ( 36 / 100 ) / ( 1 − 1 / 100 ) = 36 / 99 0.\overline{36} = (36/100)/(1 - 1/100) = 36/99 0. 36 = ( 36/100 ) / ( 1 − 1/100 ) = 36/99 .
Recursive and Periodic Sequences
A recursive definition such as a n = a n − 1 − a n − 2 a_n = a_{n-1} - a_{n-2} a n = a n − 1 − a n − 2 does not come with a closed form on the GMAT. Compute the first 5 5 5 – 8 8 8 terms by hand and look for a repeating block of length p p p . Once a n + p = a n a_{n+p} = a_n a n + p = a n for all computed n n n , the N N N -th term is the term in position R = N m o d p R = N \bmod p R = N mod p of the block, using position p p p when the remainder is 0 0 0 . The sum of the first N N N terms is S N = q × ( sum of one cycle ) + ( sum of the first R terms ) S_N = q \times (\text{sum of one cycle}) + (\text{sum of the first } R \text{ terms}) S N = q × ( sum of one cycle ) + ( sum of the first R terms )
where N = q p + R N = qp + R N = qp + R . If one cycle sums to 0 0 0 , most of the work collapses to the leftover terms.
Master Formula Table
Type Signature n n n -th term Sum
Arithmetic a n + 1 − a n = d a_{n+1} - a_n = d a n + 1 − a n = d a 1 + ( n − 1 ) d a_1 + (n-1)d a 1 + ( n − 1 ) d n ( a 1 + a n ) / 2 n(a_1 + a_n)/2 n ( a 1 + a n ) /2
Finite geometric a n + 1 / a n = r ≠ 1 a_{n+1}/a_n = r \neq 1 a n + 1 / a n = r = 1 a 1 r n − 1 a_1 r^{n-1} a 1 r n − 1 a 1 ( r n − 1 ) / ( r − 1 ) a_1(r^n - 1)/(r - 1) a 1 ( r n − 1 ) / ( r − 1 )
Infinite geometric ∣ r ∣ < 1 \vert r\vert< 1 ∣ r ∣ < 1 a 1 r n − 1 a_1 r^{n-1} a 1 r n − 1 a 1 / ( 1 − r ) a_1/(1 - r) a 1 / ( 1 − r )
- First n n n integers d = 1 d = 1 d = 1 n n n n ( n + 1 ) / 2 n(n+1)/2 n ( n + 1 ) /2
- First n n n odds d = 2 d = 2 d = 2 2 n − 1 2n-1 2 n − 1 n 2 n^2 n 2
Periodic a n + p = a n a_{n+p} = a_n a n + p = a n term N m o d p N \bmod p N mod p q S cycle + S R q S_{\text{cycle}} + S_R q S cycle + S R
Worked Example: Inclusive Multiples
Sum every integer from 200 200 200 through 500 500 500 inclusive that is divisible by 7 7 7 .
The first eligible term is 7 × 29 = 203 7 \times 29 = 203 7 × 29 = 203 . The last is 7 × 71 = 497 7 \times 71 = 497 7 × 71 = 497 . Term count n = ( 497 − 203 ) / 7 + 1 = 42 + 1 = 43 n = (497 - 203)/7 + 1 = 42 + 1 = 43 n = ( 497 − 203 ) /7 + 1 = 42 + 1 = 43 . Sum = 43 × ( 203 + 497 ) / 2 = 43 × 350 = 15,050 = 43 \times (203 + 497)/2 = 43 \times 350 = 15{,}050 = 43 × ( 203 + 497 ) /2 = 43 × 350 = 15 , 050 .
Worked Example: Finite Geometric Sum
A geometric sequence has first term 5 5 5 and common ratio 2 2 2 . The sum of the first six terms is 5 ( 2 6 − 1 ) / ( 2 − 1 ) = 5 ( 64 − 1 ) = 315 5(2^6 - 1)/(2 - 1) = 5(64 - 1) = 315 5 ( 2 6 − 1 ) / ( 2 − 1 ) = 5 ( 64 − 1 ) = 315 . Multiplying through the list confirms the same total: 5 + 10 + 20 + 40 + 80 + 160 = 315 5 + 10 + 20 + 40 + 80 + 160 = 315 5 + 10 + 20 + 40 + 80 + 160 = 315 .
Worked Example: Periodic Recursion
Let a 1 = 3 a_1 = 3 a 1 = 3 , a 2 = 5 a_2 = 5 a 2 = 5 , and a n = a n − 1 − a n − 2 a_n = a_{n-1} - a_{n-2} a n = a n − 1 − a n − 2 for n ≥ 3 n \ge 3 n ≥ 3 . The terms are 3 , 5 , 2 , − 3 , − 5 , − 2 3, 5, 2, -3, -5, -2 3 , 5 , 2 , − 3 , − 5 , − 2 , then 3 , 5 , … 3, 5, \ldots 3 , 5 , … — a cycle of length 6 6 6 whose sum is 0 0 0 . The sum of the first 100 100 100 terms is the leftover after 16 16 16 full cycles ( 96 96 96 terms): a 1 + a 2 + a 3 + a 4 = 3 + 5 + 2 + ( − 3 ) = 7 a_1 + a_2 + a_3 + a_4 = 3 + 5 + 2 + (-3) = 7 a 1 + a 2 + a 3 + a 4 = 3 + 5 + 2 + ( − 3 ) = 7 .