Study guide
8.1 Arithmetic and Geometric Sequences
New York Regents Algebra II Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Regents Exam Format, Scoring & Reference Guide
1.1 Regents Exam Format, Parts, and Score Conversion 1.2 The Next Generation Reference Sheet, Calculator Rules & Pacing
2 Chapter 2: Number and Quantity: Complex Numbers & Exponents
2.1 Rational Exponents and Radicals 2.2 The Complex Number System and Operations 2.3 Complex Solutions of Quadratic Equations
3 Chapter 3: Polynomial Arithmetic & Structure
3.1 Polynomial Structure and Factoring Techniques 3.2 Factoring Cubes, Polynomial Identities, and Binomial Expansions 3.3 Polynomial Division and the Remainder Theorem
4 Chapter 4: Solving Polynomial & Radical Equations
4.1 Zeros, Roots, and Graphing of Polynomial Functions 4.2 Radical Equations and Extraneous Solutions 4.3 Linear-Quadratic Systems: Parabolas and Circles 4.4 Creating Equations from Context and Justifying Each Step 4.5 Graphical Solutions: Reading f(x) = g(x) and f(x) < g(x)
5 Chapter 5: Rational Expressions & Equations
5.1 Simplifying and Operating with Rational Expressions 5.2 Solving Rational Equations and Modeling 5.3 Rational Function Graphs, Asymptotes, and Discontinuities
6 Chapter 6: Function Fundamentals & Transformations
6.1 Function Notation, Domain, Range, and Composition 6.2 Key Features of Functions and Average Rate of Change 6.3 Function Transformations 6.4 Comparing and Combining Functions Across Representations
7 Chapter 7: Inverses, Exponentials & Logarithms
7.1 Inverse Functions and Domain Restrictions 7.2 Exponential Growth, Decay, and Continuous Compounding 7.3 Logarithmic Properties and Solving Exponential/Logarithmic Equations 7.4 Graphing Exponential, Logarithmic, and Cube Root Functions
8 Chapter 8: Sequences and Series
8.1 Arithmetic and Geometric Sequences 8.2 Summation and Finite Series Formulas 8.3 Applications of Series: Financial Models and Annuities
9 Chapter 9: Trigonometric Functions
9.1 Radian Measure, Arc Length, and the Unit Circle 9.2 Graphs of Sine and Cosine & Sinusoidal Modeling 9.3 Trigonometric Identities and Equations
10 Chapter 10: Quantitative Data & Normal Distributions
10.1 The Normal Distribution, Empirical Rule, and Z-Scores 10.2 Bivariate Data, Scatterplots, and Regression Models 10.3 Residuals and Model Appropriateness 10.4 Judging Whether a Normal Model Fits and Choosing a Regression Model
11 Chapter 11: Statistical Inference & Probability
11.1 Statistical Studies: Surveys, Experiments, and Observational Studies 11.2 Sampling Variability, Simulation, and Margin of Error 11.3 Conditional Probability, Two-Way Tables, and Independence 11.4 Compound Events, Rules of Probability, and Expected Value
8.1 Arithmetic and Geometric Sequences
Key Takeaways Explain This Topic AI
A sequence is formally defined as a function whose domain is a subset of integers (typically positive integers {1, 2, 3, ...}), generating an ordered progression of real-number outputs called terms.
Arithmetic sequences maintain a constant common difference d = a_n - a_(n-1), represented by explicit formula a_n = a_1 + (n - 1)d and recursive form a_1 = k, a_n = a_(n-1) + d, which models discrete points along a linear function with slope m = d.
Geometric sequences maintain a constant common ratio r = a_n / a_(n-1), represented by explicit formula a_n = a_1 · r^(n - 1) and recursive form a_1 = k, a_n = r · a_(n-1), which models discrete points along an exponential function with base b = r.
Recursive formulas define each term from preceding terms and strictly mandate a base case initial value (a_1), whereas explicit formulas permit immediate calculation of any n-th term without intermediate evaluations.
Unknown terms between two non-consecutive terms are resolved algebraically: for arithmetic sequences, by calculating d = (a_k - a_j) / (k - j); for geometric sequences, by solving r^(k - j) = a_k / a_j, evaluating both positive and negative roots when k - j is even.
Last updated: September 2026
8.1 Arithmetic and Geometric Sequences
Quick Answer: A sequence is a function whose domain consists of consecutive integers (typically n ∈ { 1 , 2 , 3 , … } n \in \{1, 2, 3, \dots\} n ∈ { 1 , 2 , 3 , … } ). An arithmetic sequence adds a constant common difference d d d to each term ( a n = a 1 + ( n − 1 ) d a_n = a_1 + (n-1)d a n = a 1 + ( n − 1 ) d ), exhibiting discrete linear growth with slope m = d m = d m = d . A geometric sequence multiplies each term by a constant common ratio r r r ( a n = a 1 r n − 1 a_n = a_1 r^{n-1} a n = a 1 r n − 1 ), exhibiting discrete exponential growth with base b = r b = r b = r . Explicit formulas calculate any term directly from its index n n n , while recursive formulas specify an initial term a 1 a_1 a 1 and define a n a_n a n from a n − 1 a_{n-1} a n − 1 .
1. Sequences as Functions on Discrete Integer Domains (F-BF.1a, F-BF.2)
In elementary algebra, functions are typically introduced over continuous real domains: a linear function f ( x ) = 3 x + 2 f(x) = 3x + 2 f ( x ) = 3 x + 2 or an exponential function g ( x ) = 5 ( 2 ) x g(x) = 5(2)^x g ( x ) = 5 ( 2 ) x accepts any real input x ∈ R x \in \mathbb{R} x ∈ R , yielding unbroken, continuous graphical curves. Under the New York State Next Generation Learning Standards, students transition to analyzing sequences through the formal lens of function theory.
The Formal Definition of a Sequence
A sequence is a function f f f whose domain is a subset of the integers—almost universally the set of positive integers (natural numbers): Domain: N = { 1 , 2 , 3 , 4 , … , n , … } \text{Domain: } \mathbb{N} = \{1, 2, 3, 4, \dots, n, \dots\} Domain: N = { 1 , 2 , 3 , 4 , … , n , … }
Rather than writing function notation f ( n ) f(n) f ( n ) , mathematicians use subscript notation a n a_n a n to designate the output value corresponding to the input integer n n n : f ( 1 ) = a 1 , f ( 2 ) = a 2 , f ( 3 ) = a 3 , … , f ( n ) = a n f(1) = a_1, \quad f(2) = a_2, \quad f(3) = a_3, \quad \dots, \quad f(n) = a_n f ( 1 ) = a 1 , f ( 2 ) = a 2 , f ( 3 ) = a 3 , … , f ( n ) = a n
The input integer n n n is called the term index or position.
The output value a n a_n a n is called the n n n -th term or general term.
The first output a 1 a_1 a 1 is called the initial term .
Because the domain contains only isolated integers, the graph of a sequence in the coordinate plane consists strictly of discrete, disconnected points ( 1 , a 1 ) , ( 2 , a 2 ) , ( 3 , a 3 ) , … (1, a_1), (2, a_2), (3, a_3), \dots ( 1 , a 1 ) , ( 2 , a 2 ) , ( 3 , a 3 ) , … . It is mathematically incorrect to connect the plotted points with a solid line or curve, because values such as a 2.5 a_{2.5} a 2.5 or a 2 a_{\sqrt{2}} a 2 do not exist.
Explicit vs. Recursive Representations
Every sequence can be described using two distinct mathematical frameworks:
Explicit Formulas : Express the term value a n a_n a n solely in terms of its position index n n n . This allows direct computation of any arbitrary term without prior knowledge of earlier terms. For example, to find the 100th term, one simply evaluates a 100 a_{100} a 100 .
Recursive Formulas : Express the term value a n a_n a n as a function of the immediately preceding term a n − 1 a_{n-1} a n − 1 (or multiple preceding terms). A complete recursive definition strictly requires two components: an initial condition (base case) defining a 1 a_1 a 1 , and a recurrence relation governing a n a_n a n for all integers n ≥ 2 n \ge 2 n ≥ 2 .
2. Arithmetic Sequences: Differences, Formulas, and Linear Models
An arithmetic sequence is a sequence in which the difference between any two consecutive terms is constant. This constant value is designated the common difference , symbolized by d d d .
Calculating the Common Difference
To determine whether a sequence is arithmetic, compute the difference between successive terms: d = a n − a n − 1 = a 2 − a 1 = a 3 − a 2 = a 4 − a 3 d = a_n - a_{n-1} = a_2 - a_1 = a_3 - a_2 = a_4 - a_3 d = a n − a n − 1 = a 2 − a 1 = a 3 − a 2 = a 4 − a 3
If d > 0 d > 0 d > 0 , the sequence is strictly increasing.
If d < 0 d < 0 d < 0 , the sequence is strictly decreasing.
If d = 0 d = 0 d = 0 , the sequence is constant.
Deriving the Explicit Formula
Tracing the sequence term-by-term reveals a clear structural pattern: a 1 = a 1 a 2 = a 1 + d a 3 = a 2 + d = ( a 1 + d ) + d = a 1 + 2 d a 4 = a 3 + d = ( a 1 + 2 d ) + d = a 1 + 3 d ⋮ a n = a 1 + ( n − 1 ) d \begin{aligned}
- a_1 &= a_1 \\
- a_2 &= a_1 + d \\
- a_3 &= a_2 + d = (a_1 + d) + d = a_1 + 2d \\
- a_4 &= a_3 + d = (a_1 + 2d) + d = a_1 + 3d \\
- &\;\;\vdots \\
- a_n &= a_1 + (n - 1)d
\end{aligned} a 1 a 2 a 3 a 4 a n = a 1 = a 1 + d = a 2 + d = ( a 1 + d ) + d = a 1 + 2 d = a 3 + d = ( a 1 + 2 d ) + d = a 1 + 3 d ⋮ = a 1 + ( n − 1 ) d
Notice that to advance from the first term a 1 a_1 a 1 to the n n n -th term a n a_n a n , exactly ( n − 1 ) (n - 1) ( n − 1 ) additions of the common difference d d d are executed. This explicit formula is explicitly provided on the NYSED Next Generation Mathematics Reference Sheet .
The Recursive Definition
The recursive formula translates the stepwise addition of d d d directly into mathematical notation: { a 1 = k a n = a n − 1 + d , for n ≥ 2 \begin{cases} a_1 = k \\ a_n = a_{n-1} + d, & \text{for } n \ge 2 \end{cases} { a 1 = k a n = a n − 1 + d , for n ≥ 2
Important
The Base Case Rule on Regents Exams : When asked to write a recursive formula on Part II or Part III constructed-response items, failing to state a 1 = k a_1 = k a 1 = k results in an automatic 1-credit penalty. A recurrence relation a n = a n − 1 + d a_n = a_{n-1} + d a n = a n − 1 + d alone is incomplete because an infinite number of sequences share the same common difference but start at different initial values.
The Connection Between Arithmetic Sequences and Linear Functions
Expanding the explicit formula highlights its underlying algebraic identity with linear functions: a n = a 1 + ( n − 1 ) d = a 1 + d n − d = d n + ( a 1 − d ) a_n = a_1 + (n - 1)d = a_1 + dn - d = dn + (a_1 - d) a n = a 1 + ( n − 1 ) d = a 1 + d n − d = d n + ( a 1 − d )
Comparing this structure to slope-intercept form f ( x ) = m x + b f(x) = mx + b f ( x ) = m x + b :
The common difference d d d corresponds exactly to the constant rate of change (slope m m m ) .
The constant term ( a 1 − d ) (a_1 - d) ( a 1 − d ) corresponds to the vertical intercept (the hypothetical 0th term a 0 a_0 a 0 ) .
Mathematical Attribute Continuous Linear Function f ( x ) = m x + b f(x) = mx + b f ( x ) = m x + b Discrete Arithmetic Sequence a n = d n + ( a 1 − d ) a_n = dn + (a_1 - d) a n = d n + ( a 1 − d )
Domain All real numbers: x ∈ R x \in \mathbb{R} x ∈ R Positive integers: n ∈ { 1 , 2 , 3 , … } n \in \{1, 2, 3, \dots\} n ∈ { 1 , 2 , 3 , … }
Rate of Change Constant slope: m = Δ y Δ x m = \frac{\Delta y}{\Delta x} m = Δ x Δ y Common difference: d = a n − a n − 1 d = a_n - a_{n-1} d = a n − a n − 1
Vertical Intercept Value at x = 0 x = 0 x = 0 : f ( 0 ) = b f(0) = b f ( 0 ) = b Hypothetical 0th term: a 0 = a 1 − d a_0 = a_1 - d a 0 = a 1 − d
- Graphical Appearance Unbroken continuous line Collinear set of isolated points
- 3. Geometric Sequences: Ratios, Formulas, and Exponential Models
A geometric sequence is a sequence in which the ratio between any two consecutive terms is constant. This multiplier is designated the common ratio , symbolized by r r r .
Calculating the Common Ratio
To determine whether a sequence is geometric, divide each term by its immediate predecessor: r = a n a n − 1 = a 2 a 1 = a 3 a 2 = a 4 a 3 ( a n − 1 ≠ 0 ) r = \frac{a_n}{a_{n-1}} = \frac{a_2}{a_1} = \frac{a_3}{a_2} = \frac{a_4}{a_3} \quad (a_{n-1} \neq 0) r = a n − 1 a n = a 1 a 2 = a 2 a 3 = a 3 a 4 ( a n − 1 = 0 )
If r > 1 r > 1 r > 1 and a 1 > 0 a_1 > 0 a 1 > 0 , terms grow exponentially without bound.
If 0 < r < 1 0 < r < 1 0 < r < 1 and a 1 > 0 a_1 > 0 a 1 > 0 , terms decay exponentially toward 0.
If r < 0 r < 0 r < 0 , terms alternate in sign between positive and negative values (an oscillating sequence).
Deriving the Explicit Formula
Tracing the multiplication term-by-term reveals the exponential progression: a 1 = a 1 a 2 = a 1 ⋅ r a 3 = a 2 ⋅ r = ( a 1 ⋅ r ) ⋅ r = a 1 r 2 a 4 = a 3 ⋅ r = ( a 1 r 2 ) ⋅ r = a 1 r 3 ⋮ a n = a 1 r n − 1 \begin{aligned}
- a_1 &= a_1 \\
- a_2 &= a_1 \cdot r \\
- a_3 &= a_2 \cdot r = (a_1 \cdot r) \cdot r = a_1 r^2 \\
- a_4 &= a_3 \cdot r = (a_1 r^2) \cdot r = a_1 r^3 \\
- &\;\;\vdots \\
- a_n &= a_1 r^{n - 1}
\end{aligned} a 1 a 2 a 3 a 4 a n = a 1 = a 1 ⋅ r = a 2 ⋅ r = ( a 1 ⋅ r ) ⋅ r = a 1 r 2 = a 3 ⋅ r = ( a 1 r 2 ) ⋅ r = a 1 r 3 ⋮ = a 1 r n − 1
To advance from a 1 a_1 a 1 to a n a_n a n , the initial value is multiplied by r r r exactly ( n − 1 ) (n - 1) ( n − 1 ) times. This explicit formula is provided on the official NYSED Reference Sheet .
The Recursive Definition { a 1 = k a n = r ⋅ a n − 1 , for n ≥ 2 \begin{cases} a_1 = k \\ a_n = r \cdot a_{n-1}, & \text{for } n \ge 2 \end{cases} { a 1 = k a n = r ⋅ a n − 1 , for n ≥ 2
The Connection Between Geometric Sequences and Exponential Functions
Rewriting the explicit formula using exponent rules demonstrates its structural identity with exponential models: a n = a 1 r n − 1 = a 1 ⋅ r n ⋅ r − 1 = ( a 1 r ) r n a_n = a_1 r^{n - 1} = a_1 \cdot r^n \cdot r^{-1} = \left(\frac{a_1}{r}\right) r^n a n = a 1 r n − 1 = a 1 ⋅ r n ⋅ r − 1 = ( r a 1 ) r n
Comparing this to standard exponential form f ( x ) = a ⋅ b x f(x) = a \cdot b^x f ( x ) = a ⋅ b x :
The common ratio r r r corresponds to the growth/decay factor (base b b b ) .
The leading coefficient a 1 r \frac{a_1}{r} r a 1 represents the initial value f ( 0 ) = a 0 f(0) = a_0 f ( 0 ) = a 0 .
Note
Alternating Sequences vs. Real Exponential Curves : Continuous exponential functions f ( x ) = a ⋅ b x f(x) = a \cdot b^x f ( x ) = a ⋅ b x require the base b > 0 b > 0 b > 0 because negative bases raised to fractional powers (such as ( − 4 ) 1 / 2 = 2 i (-4)^{1/2} = 2i ( − 4 ) 1/2 = 2 i ) produce non-real complex numbers. In contrast, geometric sequences restrict their domain to integer powers n ∈ Z + n \in \mathbb{Z}^+ n ∈ Z + . Therefore, geometric sequences permit negative common ratios r < 0 r < 0 r < 0 , which generate alternating sign sequences such as 3 , − 6 , 12 , − 24 , 48 , … 3, -6, 12, -24, 48, \dots 3 , − 6 , 12 , − 24 , 48 , … .
4. Comprehensive Structural Comparison
- Sequence Property Arithmetic Sequence Geometric Sequence
- Defining Operation Successive addition of constant d d d Successive multiplication by constant r r r
Identifying Test a 2 − a 1 = a 3 − a 2 = d a_2 - a_1 = a_3 - a_2 = d a 2 − a 1 = a 3 − a 2 = d a 2 a 1 = a 3 a 2 = r \frac{a_2}{a_1} = \frac{a_3}{a_2} = r a 1 a 2 = a 2 a 3 = r
Explicit Formula (Ref. Sheet) a n = a 1 + ( n − 1 ) d a_n = a_1 + (n - 1)d a n = a 1 + ( n − 1 ) d a n = a 1 r n − 1 a_n = a_1 r^{n - 1} a n = a 1 r n − 1
Recursive Definition a 1 = k , a n = a n − 1 + d a_1 = k, \; a_n = a_{n-1} + d a 1 = k , a n = a n − 1 + d a 1 = k , a n = r ⋅ a n − 1 a_1 = k, \; a_n = r \cdot a_{n-1} a 1 = k , a n = r ⋅ a n − 1
Underlying Function Family Linear: f ( x ) = m x + b f(x) = mx + b f ( x ) = m x + b Exponential: f ( x ) = a ⋅ b x f(x) = a \cdot b^x f ( x ) = a ⋅ b x
Growth Parameter Slope: m = d m = d m = d Base multiplier: b = r b = r b = r
Hypothetical 0th Term a 0 = a 1 − d a_0 = a_1 - d a 0 = a 1 − d a 0 = a 1 r a_0 = \frac{a_1}{r} a 0 = r a 1
Behavior when d < 0 d < 0 d < 0 or 0 < r < 1 0 < r < 1 0 < r < 1 Decreases linearly toward − ∞ -\infty − ∞ Decays exponentially toward 0
5. Worked Problem 1: Converting Between Recursive and Explicit Forms
Problem: A sequence is defined recursively by a 1 = 19 a_1 = 19 a 1 = 19 and a n = a n − 1 − 3.5 a_n = a_{n-1} - 3.5 a n = a n − 1 − 3.5 for n ≥ 2 n \ge 2 n ≥ 2 . Write an explicit formula for the sequence, calculate the value of a 32 a_{32} a 32 , and determine the linear function f ( n ) f(n) f ( n ) that models this sequence.
Step 1: Identify the sequence type and parameters. The recurrence relation subtracts a constant 3.5 3.5 3.5 from each term, indicating an arithmetic sequence with: a 1 = 19 , d = − 3.5 a_1 = 19, \quad d = -3.5 a 1 = 19 , d = − 3.5
Step 2: Construct the explicit formula. Using the reference sheet formula a n = a 1 + ( n − 1 ) d a_n = a_1 + (n - 1)d a n = a 1 + ( n − 1 ) d : a n = 19 + ( n − 1 ) ( − 3.5 ) a_n = 19 + (n - 1)(-3.5) a n = 19 + ( n − 1 ) ( − 3.5 )
Step 3: Simplify into slope-intercept form. a n = 19 − 3.5 n + 3.5 = − 3.5 n + 22.5 a_n = 19 - 3.5n + 3.5 = -3.5n + 22.5 a n = 19 − 3.5 n + 3.5 = − 3.5 n + 22.5
The corresponding linear function is f ( n ) = − 3.5 n + 22.5 f(n) = -3.5n + 22.5 f ( n ) = − 3.5 n + 22.5 for n ∈ N n \in \mathbb{N} n ∈ N .
Step 4: Compute the 32nd term. Substitute n = 32 n = 32 n = 32 into the explicit formula: a 32 = − 3.5 ( 32 ) + 22.5 = − 112 + 22.5 = − 89.5 a_{32} = -3.5(32) + 22.5 = -112 + 22.5 = -89.5 a 32 = − 3.5 ( 32 ) + 22.5 = − 112 + 22.5 = − 89.5
6. Worked Problem 2: Finding Missing Terms Between Non-Consecutive Geometric Terms
Problem: In a geometric sequence of positive real numbers, the third term is a 3 = 24 a_3 = 24 a 3 = 24 and the seventh term is a 7 = 384 a_7 = 384 a 7 = 384 . Algebraically determine the common ratio r r r , the initial term a 1 a_1 a 1 , write the explicit formula, and state the values of the intermediate missing terms a 4 , a 5 , a_4, a_5, a 4 , a 5 , and a 6 a_6 a 6 .
Step 1: Express both terms using the explicit geometric formula. Using a n = a 1 r n − 1 a_n = a_1 r^{n-1} a n = a 1 r n − 1 : a 3 = a 1 r 3 − 1 = a 1 r 2 = 24 a_3 = a_1 r^{3 - 1} = a_1 r^2 = 24 a 3 = a 1 r 3 − 1 = a 1 r 2 = 24 a 7 = a 1 r 7 − 1 = a 1 r 6 = 384 a_7 = a_1 r^{7 - 1} = a_1 r^6 = 384 a 7 = a 1 r 7 − 1 = a 1 r 6 = 384
Step 2: Solve for r r r by forming the quotient of the equations. a 7 a 3 = a 1 r 6 a 1 r 2 = 384 24 \frac{a_7}{a_3} = \frac{a_1 r^6}{a_1 r^2} = \frac{384}{24} a 3 a 7 = a 1 r 2 a 1 r 6 = 24 384 r 6 − 2 = r 4 = 16 r^{6 - 2} = r^4 = 16 r 6 − 2 = r 4 = 16
Step 3: Extract the fourth root. r = ± 16 4 = ± 2 r = \pm \sqrt[4]{16} = \pm 2 r = ± 4 16 = ± 2
Because the problem prompt explicitly specifies that the sequence consists of positive real numbers, reject the negative root: r = 2 r = 2 r = 2
Step 4: Calculate the first term a 1 a_1 a 1 . Substitute r = 2 r = 2 r = 2 back into the equation for a 3 a_3 a 3 : a 1 ( 2 ) 2 = 24 ⟹ 4 a 1 = 24 ⟹ a 1 = 6 a_1 (2)^2 = 24 \implies 4a_1 = 24 \implies a_1 = 6 a 1 ( 2 ) 2 = 24 ⟹ 4 a 1 = 24 ⟹ a 1 = 6
Step 5: State the explicit formula and calculate missing terms. a n = 6 ( 2 ) n − 1 a_n = 6(2)^{n - 1} a n = 6 ( 2 ) n − 1
Evaluating consecutive terms: a 4 = 6 ( 2 ) 3 = 48 , a 5 = 6 ( 2 ) 4 = 96 , a 6 = 6 ( 2 ) 5 = 192 a_4 = 6(2)^3 = 48, \quad a_5 = 6(2)^4 = 96, \quad a_6 = 6(2)^5 = 192 a 4 = 6 ( 2 ) 3 = 48 , a 5 = 6 ( 2 ) 4 = 96 , a 6 = 6 ( 2 ) 5 = 192
7. Worked Problem 3: Resolving Non-Consecutive Arithmetic Terms
Problem: An arithmetic sequence has a 4th term of a 4 = − 7 a_4 = -7 a 4 = − 7 and an 11th term of a 11 = 35 a_{11} = 35 a 11 = 35 . Determine the common difference d d d , the first term a 1 a_1 a 1 , and the term index n n n for which a n = 101 a_n = 101 a n = 101 .
Step 1: Set up equations for both terms. a 4 = a 1 + 3 d = − 7 a_4 = a_1 + 3d = -7 a 4 = a 1 + 3 d = − 7 a 11 = a 1 + 10 d = 35 a_{11} = a_1 + 10d = 35 a 11 = a 1 + 10 d = 35
Step 2: Subtract the equations to eliminate a 1 a_1 a 1 . ( a 1 + 10 d ) − ( a 1 + 3 d ) = 35 − ( − 7 ) (a_1 + 10d) - (a_1 + 3d) = 35 - (-7) ( a 1 + 10 d ) − ( a 1 + 3 d ) = 35 − ( − 7 ) 7 d = 42 ⟹ d = 6 7d = 42 \implies d = 6 7 d = 42 ⟹ d = 6
Step 3: Solve for a 1 a_1 a 1 . a 1 + 3 ( 6 ) = − 7 ⟹ a 1 + 18 = − 7 ⟹ a 1 = − 25 a_1 + 3(6) = -7 \implies a_1 + 18 = -7 \implies a_1 = -25 a 1 + 3 ( 6 ) = − 7 ⟹ a 1 + 18 = − 7 ⟹ a 1 = − 25
Step 4: Determine the index n n n where a n = 101 a_n = 101 a n = 101 . 101 = − 25 + ( n − 1 ) 6 101 = -25 + (n - 1)6 101 = − 25 + ( n − 1 ) 6 126 = 6 ( n − 1 ) ⟹ 21 = n − 1 ⟹ n = 22 126 = 6(n - 1) \implies 21 = n - 1 \implies n = 22 126 = 6 ( n − 1 ) ⟹ 21 = n − 1 ⟹ n = 22
The 22nd term of the sequence is 101 101 101 .
8. Common Regents Pitfalls and Exam Strategies
Pitfall 1: Index Off-by-One Exponent Error : A frequent error on Part I items is confusing r n − 1 r^{n-1} r n − 1 with r n r^n r n . In a n = a 1 r n − 1 a_n = a_1 r^{n-1} a n = a 1 r n − 1 , the exponent is n − 1 n - 1 n − 1 because the first term already has zero factors of r r r ( a 1 = a 1 r 0 a_1 = a_1 r^0 a 1 = a 1 r 0 ). Writing a n = a 1 r n a_n = a_1 r^n a n = a 1 r n shifts the entire sequence by one index, making a 1 a_1 a 1 equal to a 1 r a_1 r a 1 r , which is incorrect.
Pitfall 2: Forgetting the Base Case in Recursive Definitions : When writing a recursive formula on Regents constructed-response items, you must explicitly state a 1 = k a_1 = k a 1 = k . Omitting a 1 a_1 a 1 forfeits 1 credit out of 2.
Pitfall 3: Reversing the Subtraction or Division Order : When computing common difference d d d or common ratio r r r , always take the later term minus (or divided by) the earlier term: d = a 2 − a 1 d = a_2 - a_1 d = a 2 − a 1 , never a 1 − a 2 a_1 - a_2 a 1 − a 2 .
Pitfall 4: Overlooking Dual Signs on Even Roots : When solving r k − j = C r^{k-j} = C r k − j = C where k − j k - j k − j is even, r = ± C k − j r = \pm \sqrt[k-j]{C} r = ± k − j C . Unless the prompt restricts terms to positive real numbers, both positive and negative values for r r r are mathematically valid.