Sequences & Series
Arithmetic/geometric sequences, recursions, sums, telescoping sums
What you need to know
We write for the th term of a sequence, so is the first term.
- Arithmetic sequences go up by the same amount each time (the common difference). The th term is . The sum of the first terms is : the number of terms times the average of the first and last. Example: for , and .
- Geometric sequences multiply by the same number each time (the common ratio). Then and . Example: for , and .
- Infinite geometric series. If is between and , the sum that goes on forever is . Example: .
- Sums to memorize. . . . Example: with these are , , and .
- Telescoping. Write each term as a difference so that neighbors cancel and only the ends survive. The key split is (this is partial fractions). Example: .
- Recursions often repeat. When each term is made from the one before, compute terms until one repeats. From there the sequence cycles. If the cycle goes all the way back to , only the remainder of the index divided by the cycle length (the period) matters. If some terms come before the cycle starts, count from the start of the cycle instead: adding the squares of the digits, starting from , gives , a cycle of length that starts at . Example: and give , with period . Since , .
- Three-term tests. is arithmetic exactly when . For numbers that are not zero, is geometric exactly when . Example: is arithmetic () and is geometric ().
How AMC 10 tests it
- Problems 3–10: a direct question about an arithmetic sequence (one term, a sum, or the number of terms).
- Problems 8–15: ", ; find ." Compute a few terms, spot the cycle, and use the remainder of the index.
- Problems 10–18: an arithmetic or geometric sequence hidden in a story (rows of seats, a bouncing ball), sometimes an infinite geometric series.
- Problems 14–20: a telescoping sum of fractions, or of terms like . Rewrite each term as a difference, such as .
- Mixed conditions (" is arithmetic and is geometric") that turn into a small system of equations.
Standard approaches
- Decide the type: arithmetic, geometric, telescoping, or recursive. For a recursion, write out the first five or six terms.
- For an arithmetic sum, use (number of terms) (average term). Count the terms as .
- For a sum of fractions, or a product, try to write each term as a difference of neighboring pieces, like .
- For a term with a huge index, find the period or a formula, then reduce the index.
- Use the answer choices as a check: whole number or not, even or odd, or the pattern from small cases.
Worked example
Define and for . What is the product ?
(A) (B) (C) (D) (E)
Compute terms until one repeats.
Since , the terms repeat in blocks of : .
Multiply one block. .
Count the blocks. . So the terms are full blocks, each multiplying to , then two extra terms: and .
The whole product is . The answer is .
Pitfalls
- Off-by-one when counting terms: is steps past . Example: for , , not .
- Using when is not between and . Example: has no sum, but the formula would give .
- Reducing the index wrongly. With period and a cycle that starts at , an index that is a multiple of (remainder , like ) matches , not a nonexistent .
- Telescoping without tracking which terms survive at both ends, or dropping the factor in front: , not .
Traps that recur
- Trying to compute terms exactly, or bounding with only one side of the ratio and landing in the wrong interval. (2019 AMC 10B #24)
- Reading 'the average drops by 1' as 'each term drops by 1' and running the sequence down from around 2025 to 1, which points at choice (E). (2025 AMC 10B #17)
- Assuming the ratio must be an integer (b = 1440, digit sum 9) or grabbing 9/8 (b = 810) without checking that 15 and 16 both divide 720. (2024 AMC 10A #19)
- Assuming every row has the same common difference (a linear function Bi + Cj + A), which cannot fit the four given values; the row differences themselves form an arithmetic progression. (2024 AMC 10A #21)
- 1.2010 AMC 10B #24
A high school basketball game between the Raiders and Wildcats was tied at the end of the first quarter. The number of points scored by the Raiders in each of the four quarters formed an increasing geometric sequence, and the number of points scored by the Wildcats in each of the four quarters formed an increasing arithmetic sequence. At the end of the fourth quarter, the Raiders had won by one point. Neither team scored more than points. What was the total number of points scored by the two teams in the first half?
- A)
- B)
- C)
- D)
- E)
- 2.2004 AMC 10B #21
Let ; ; ; and ; ; ; be two arithmetic progressions. The set is the union of the first terms of each sequence. How many distinct numbers are in ?
- A)
- B)
- C)
- D)
- E)
- 3.2003 AMC 10B #24
The first four terms in an arithmetic sequence are , , , and , in that order. What is the fifth term?
- A)
- B)
- C)
- D)
- E)
- 4.2002 AMC 10B #23
Let be a sequence of integers such that and for all positive integers and Then is
- A)
- B)
- C)
- D)
- E)
- 5.2019 AMC 10B #24
Define a sequence recursively by and for all nonnegative integers Let be the least positive integer such that In which of the following intervals does lie?
- A)
- B)
- C)
- D)
- E)
Answers
| # | Answer | The idea it turns on |
|---|---|---|
| 1 | E | The 100-point limit leaves the Raiders few options, such as 1, 2, 4, 8 or 8, 12, 18, 27. Only 5, 10, 20, 40 fits a Wildcats total one lower. |
| 2 | A | Shared numbers start at 16 and go up by 21, but only up to 6010, where the first list ends. That gives 286 to subtract. |
| 3 | E | Each step adds -2y, so the 3rd and 4th terms are x - 3y and x - 5y. Dividing xy = x - 3y by y gives y = -3/5. |
| 4 | D | Put n = 1: each term is the previous one plus the next counting number. That gives 1, 3, 6, 10, ..., the triangular numbers, so a_12 = 78. |
| 5 | C | Track how far each term is above 4. That distance shrinks by a factor between 9/10 and 10/11 each step, so powers of those fractions bound m. |
Problems © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. The topic note, tags and key insights are original to this site.