Skip to content

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.

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.

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.

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.

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.

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.

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.

Relationships to Other Abstractions

Local relationship map for Arithmetic ProgressionParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.ArithmeticProgressionDOMAINPrime abstraction: Recurrence — presupposesRecurrencePRIMEDomain-specific abstraction: Equally Spaced Polynomial — presupposesEqually SpacedPolynomialDOMAIN

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

Neighborhood in Abstraction Space

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

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

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