Arithmetic Progression

Generate an ordered numeric sequence by repeatedly adding one fixed common difference, making every term affine in its discrete index.

Version

v1 · 2026-08-30 · History

Domain-specific #

1302

Origin domain

mathematics

Subdomain

elementary algebra

Aliases

Arithmetic sequence

Core Idea

An arithmetic progression, or arithmetic sequence, is an ordered sequence in which subtracting any term from the next always gives the same value. That value is the common difference d. With first term a_1,

\[ a_{n+1}=a_n+d \quad\text{and}\quad a_n=a_1+(n-1)d. \]

The local rule and global formula express the same identity. Repeatedly add d to move one index step, or multiply d by the number of steps to jump directly to any term. OpenStax presents both forms and identifies d with the constant rate of change of the plotted sequence.^[1]

The order and indices matter. A progression is not merely a set of evenly spaced values: the first term selects an origin, the index counts steps, and a finite endpoint determines how many terms participate. This draft permits d=0, so a constant sequence is the degenerate case. A convention requiring distinct terms must say d is nonzero.

A finite progression also licenses the sum formula

\[ S_n=\frac{n}{2}(a_1+a_n) =\frac{n}{2}\left(2a_1+(n-1)d\right). \]

That formula is a consequence of the progression. The resulting sum is an arithmetic series, not the ordered sequence itself.^[2]

Structural Signature

Sig role-phrases:

• the indexed carrier — a finite or infinite ordered numeric sequence
• the initial term — a_1, or a_0 under a declared zero-based convention
• the common difference — one fixed additive increment d
• the successor step — moving from n to n+1 by adding d
• the discrete index — the ordered position that counts repeated steps
• the affine term law — a_n=a_1+(n-1)d
• the constant-difference invariant — a_{n+1}-a_n=d wherever both terms exist
• the optional endpoint — a last index and last term for a finite progression
• the recognition verdict — every defined consecutive difference is equal

Equivalent diagnostics include zero second differences and the midpoint identity 2a_n=a_{n-1}+a_{n+1} for interior terms. For a sequence with at least two terms, a_1 and d determine every term. Two terms a_r and a_s with distinct known indices determine d=(a_s-a_r)/(s-r), provided the sequence is known to be arithmetic.

The sign of d controls direction: positive gives increasing values, negative gives decreasing values, and zero gives a constant sequence. Changing from one-based to zero-based indexing changes the intercept but not d or the underlying ordered values.

What It Is Not

• Not every numeric sequence. Fibonacci and quadratic sequences have changing first differences.
• Not a geometric progression. Geometric terms have a constant ratio; arithmetic terms have a constant difference.
• Not an arithmetic series. The series is a sum of terms from the progression.^[2]
• Not a continuous line. Its graph lies on a line, but only the declared discrete index values belong to the sequence.
• Not approximate linearity. A fitted line or nearly constant differences do not satisfy the exact definition unless a tolerance-qualified variant is explicitly introduced.
• Not mere equal timing. Values can advance by equal amounts even when observations occur at irregular times, and equally timed observations can have unequal values.
• Not an unordered residue class. Number theory often uses a+dk to denote the represented integers, but the progression identity retains index and order.
• Not repeated multiplication. Adding d at every step is constitutive.

Scope of Application

Elementary algebra. Arithmetic progressions teach the equivalence between recursive and explicit descriptions, solve for missing terms, and turn a constant rate of change into a discrete sequence model.^[1]

Finite sums. Pairing the first and last terms, then the second and next-to-last, gives n pairs with common total a_1+a_n after accounting for the factor one-half. This compresses repeated addition into a closed expression.

Number theory. Expressions a+dk organize integers with a fixed residue modulo d and support questions about divisibility and primes in progressions. Here authors may focus on membership rather than order, so the index domain and sign convention must be made explicit.

Discrete models. Straight-line depreciation, fixed annual increases, seat counts by row, regular inventory increments, and equally stepped measurement levels all use the same discrete affine law when the increment is genuinely constant. OpenStax uses straight-line depreciation as a canonical applied model.^[1]

Finite products and special cases. Products of progression terms include factorial-like expressions and double-factorial patterns. These are derived uses of the same term family, not extra defining roles.^[3]

The node stops at exact additive progressions. Noisy data with an estimated slope belongs to statistical modeling unless the fitted sequence itself is then declared arithmetic.

Clarity

The fastest test is local: compute each consecutive difference. Equal results establish the property over the observed finite sequence; one unequal result refutes it. The global formula then exposes terms not yet written.

Indexing is the most common source of error. Under one-based indexing the nth term is a_1+(n-1)d because reaching position n requires n-1 steps. Under zero-based indexing it is a_0+nd. These are translations of the same sequence, not competing definitions.

The word progression sometimes names the formula a+kd or the set it traces. For catalog purposes, the primary identity is the indexed sequence. A set-use is accepted when an index domain and constant step can be recovered, but properties that depend on order or multiplicity must not be inferred from the set alone.

Manages Complexity

Without the abstraction, n terms appear to require n separate facts. The pair (a_1,d), plus an optional length, compresses the entire sequence. This makes random access constant-work algebra rather than repeated simulation: compute a_n directly instead of applying the successor rule n-1 times.

The same compression supports inverse questions. Given two indexed terms, solve one linear equation for d; given an endpoint, solve for the number of steps; given a total, use the sum formula to recover a missing parameter. Each task remains tractable because the sequence has only two degrees of freedom before truncation.

The abstraction also separates model error from arithmetic error. If observed increments differ, the arithmetic-progression model has failed; manipulating its closed form more carefully will not repair the mismatch.

Abstract Reasoning

Use this recognition and deduction protocol:

1. Declare the index domain and whether the sequence is finite.
2. Compute a_{n+1}-a_n for every available adjacent pair.
3. Reject exact arithmetic progression if any differences disagree.
4. Record their common value d and an anchored term a_r.
5. Derive a_n=a_r+(n-r)d for any valid index n.
6. If finite, derive the endpoint and sum only within the declared range.

Several consequences follow immediately. Translating every term by c preserves d. Scaling every term by k produces common difference kd. Adding two same-indexed arithmetic progressions produces another with the sum of their differences. Reversing a finite progression preserves its values in reverse order and changes d to -d.

Conversely, a sequence is arithmetic exactly when its first-difference sequence is constant, or equivalently when its second differences vanish. This provides both an algorithmic test and a bridge to discrete calculus.

The sum formula follows by writing S_n forward and backward. Each aligned pair equals a_1+a_n, so 2S_n=n(a_1+a_n). This argument depends on a finite endpoint; it does not assign a finite sum to an infinite nonzero progression.

Knowledge Transfer

Literal transfer stays inside additive indexed structures. Integer, rational, real, and complex sequences all support the same recurrence. More generally, one can speak of a_0+nd in an additive abelian group, although order words such as increasing no longer apply automatically.

Applied transfer is exact when the modeled quantity changes by one constant amount per discrete step. Straight-line book values and fixed annual payment increases preserve every role. A graph that merely looks straight, or a schedule with evenly spaced dates but nonlinear values, preserves only an analogy.

The portable skeleton is constant-step recurrence. The live Recurrence prime owns that cross-domain dependency pattern. Arithmetic Progression remains domain-specific because numeric addition, subtraction, affine term formulas, and discrete indexed values are required to recognize it.

Examples

A finite progression

Consider 2, 5, 8, 11, 14. Every consecutive difference is 3, so d=3 and

\[ a_n=2+3(n-1)=3n-1. \]

The endpoint is a_5=14 and the sum is S_5=5(2+14)/2=40.

Mapped back:

• indexed carrier: five ordered terms
• initial term: a_1=2
• common difference: d=3
• successor step: add 3
• index: n in {1,2,3,4,5}
• affine law: a_n=3n-1
• endpoint: a_5=14
• recognition verdict: all four first differences equal 3

Straight-line depreciation

An asset valued at 25,000 dollars loses 3,400 dollars of book value each year. Index elapsed years from zero. Then

\[ V_n=25{,}000-3{,}400n. \]

The values 25,000, 21,600, 18,200, 14,800, 11,400, 8,000 form a finite arithmetic progression through year five, matching the OpenStax example.^[1]

Mapped back:

• indexed carrier: yearly book values from year 0 through year 5
• initial term: V_0=25,000
• common difference: d=-3,400 dollars per year
• successor step: subtract 3,400 after each year
• index: elapsed whole years n
• affine law: V_n=25,000-3,400n
• endpoint: V_5=8,000
• boundary: the model applies only while straight-line depreciation and the declared five-year horizon remain valid

Structural Tensions

T1: Local recurrence versus global formula. One describes the next term; the other jumps to any term. Diagnostic: Is the task sequential generation or random access by index?

T2: Exact law versus empirical approximation. Real measurements rarely have perfectly equal differences. Diagnostic: Are values defined by the law, or has constancy merely been estimated from noisy data?

T3: Sequence versus set. Order supports differences and endpoints, while set notation can suppress both. Diagnostic: Are index, direction, and multiplicity still recoverable?

T4: Finite truncation versus infinite continuation. The same local rule can describe either. Diagnostic: Has a last index been declared before a finite sum or endpoint is used?

T5: Positive, negative, or zero step. The identity is unchanged while monotonic behavior differs. Diagnostic: Has a sign restriction been mistaken for part of the general definition?

T6: Index origin versus invariant difference. Reindexing changes the intercept but not d. Diagnostic: Does a disagreement come from different zero-based and one-based conventions?

T7: Progression versus its aggregates. Sums and products reveal useful consequences but are not the sequence. Diagnostic: Is the object an ordered term family or a derived scalar expression?

T8: Domain autonomy versus structural reduction. Recurrence captures the step dependence but not its additive numeric law. Diagnostic: Can the candidate be recognized without numeric subtraction, a common difference, and an affine discrete-index formula? If not, the domain node remains autonomous.

Structural–Framed Character

Arithmetic Progression is strongly structural within mathematics under five explicit criteria:

• Vocabulary travel: low. “Common difference,” indexed term, and affine discrete law travel among mathematical and modeled numeric settings, not into arbitrary ordering practices.
• Evaluative weight: none. Recognition depends on exact differences, not on a preferred outcome or evaluator.
• Institutional origin: none. No institution or declaration creates the progression once its carrier and index law are fixed.
• Human-practice boundedness: none. The truth conditions are mathematical, even when a human practice supplies the quantities being modeled.
• Import versus recognition: literal only when ordered additive values, discrete indices, and one invariant difference survive; otherwise the term is imported metaphorically.

Its domain-specific conclusion remains unchanged: numeric or additive values, ordered discrete indices, and equality of differences are indispensable. Uses in finance or engineering are mathematical models of domain quantities, not evidence that the full identity has escaped mathematics.

Structural Core vs. Domain Accent

The structural core is a first-order recurrence with one invariant step: each state is obtained from its predecessor by applying the same translation. That skeleton lifts to the live Recurrence prime.

The domain accent fixes states as additive mathematical values, the translation as addition of d, and positions as consecutive discrete indices. It supplies subtraction-based recognition, affine closed form, zero second differences, and finite-sum identities. Remove those features and one retains generic recurrence, not an arithmetic progression.

Instantiates / Related Primes

• Recurrence. Arithmetic Progression strictly presupposes the first-order recurrence a_{n+1}=a_n+d as its generative relation, but it is not a subtype of Recurrence, which also includes variable-step, nonlinear, stochastic, and higher-order cases.
• Sequencing. Related but declined as a structured parent. The order is constitutive, yet the live prime concerns organizing steps or items whose arrangement changes an outcome; it does not entail an additive term law.
• Cadence. Related but declined. Equal value increments need not be equal temporal spacing, and Cadence does not supply numeric differences.
• Linear Combination. Declined as a direct parent. The explicit formula uses scalar multiplication and addition, but that algebra is internal and does not organize the candidate as minimally as Recurrence does.

Relationships to Other Abstractions

Current abstraction Arithmetic Progression Domain-specific

Parents (1) — more general patterns this builds on

• Arithmetic Progression presupposes Recurrence Prime

  Arithmetic Progression strictly presupposes the first-order recurrence a_{n+1}=a_n+d as its generative relation but is not a subtype of Recurrence.

Children (1) — more specific cases that build on this

• Equally Spaced Polynomial Domain-specific presupposes Arithmetic Progression

  Arithmetic Progression is the prospective DAG parent through strict composition/presupposition.

Hierarchy path (1) — routes to 1 parentless root

• Arithmetic Progression → Recurrence

Neighborhood in Abstraction Space

Arithmetic Progression sits in a sparse region of the domain-specific corpus (72^nd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

• Wilf Equivalence — 0.85
• Covering Set — 0.84
• Slow-Growing Hierarchy — 0.84
• Natural Number — 0.84
• Recurrence relation — 0.83

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With

• Arithmetic series: sum of progression terms. Tell: is the object a sequence or one accumulated value?
• Geometric progression: constant ratio. Tell: subtract adjacent terms or divide them?
• Harmonic progression: reciprocals form an arithmetic progression. Tell: are the original terms or their reciprocals equally spaced?
• Linear function: affine law on a declared function domain. Tell: is the object specifically a discrete indexed sequence?
• Approximately linear trend: best-fit behavior. Tell: are all first differences exactly equal?
• Sequencing: meaningful ordering of tasks or items. Tell: is repeated numeric addition constitutive?
• Cadence: recurring temporal or procedural spacing. Tell: is d a value increment rather than a time interval?
• Recurrence: any prior-state dependence. Tell: is the rule exactly one constant additive step?
• Residue class: integers congruent modulo m. Tell: have sequence order, direction, and index range been discarded?
• Equally spaced samples: constant observation times. Tell: are the sample values also in arithmetic progression?
• Constant sequence: the d=0 case here, not a competing class. Tell: does the convention permit zero difference?
• Finite-difference table: a diagnostic representation. Tell: is the table the sequence or merely a way to inspect it?

References

[1] Jay Abramson. Precalculus 2e, section 11.2, Arithmetic Sequences. OpenStax, 2021. Defines constant consecutive difference, recursive and explicit forms, and gives the straight-line depreciation example. registry ↩a ↩b ↩c ↩d

[2] Lynn Marecek and Andrea Honeycutt Mathis. Intermediate Algebra 2e, section 12.2, Arithmetic Sequences. OpenStax, 2020. Develops arithmetic-sequence recognition and finite-sum formulas. registry ↩a ↩b

[3] Eric W. Weisstein. Arithmetic Progression. MathWorld. Gives standard term, sum, and product formulas. registry ↩