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
v2 · 2026-09-19 · History
Domain-specific #
1302
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Elementary Algebra → Mathematics
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.

How would you explain it like I'm…

Same-Size Steps

An arithmetic progression is a list of numbers where you always add the same amount to get the next one, like 2, 4, 6, 8. It is like walking up stairs where every step is exactly the same height. If you know where you started and how big each step is, you can find any step.

Add-the-Same Pattern

An arithmetic progression is a list of numbers in order where the jump from each number to the next is always the same. That jump is called the common difference: in 5, 8, 11, 14 it is 3. Because the jump never changes, you can skip ahead: the 10th number is the first number plus 9 jumps. The jump can even be zero, which just gives the same number over and over.

Constant-Difference Sequence

An arithmetic progression (or arithmetic sequence) is an ordered sequence in which each term minus the one before always equals the same value d, the common difference. You can describe it locally, a_(n+1) = a_n + d, or globally, a_n = a_1 + (n - 1)d; both say the same thing, one step at a time or all at once. Order matters: it is not just a set of evenly spaced numbers, because the first term fixes a starting point and the index counts steps. Plotted against its position number, the sequence rises (or falls) at a constant rate d. Adding up a finite progression gives an arithmetic series, S_n = n(a_1 + a_n)/2, which is a result about the sequence rather than the sequence itself.

 

An arithmetic progression is an ordered sequence (a_n) with a_{n+1} - a_n = d for a fixed common difference d. Equivalently a_n = a_1 + (n-1)d: the local recurrence and the closed form express the same identity, one by stepping and one by multiplying d by the number of steps. Viewed as a function of the index, the sequence is linear, and d is its constant rate of change. The structure depends on order and indexing: the first term fixes an origin, the index counts steps, and a finite endpoint fixes how many terms take part, so an unordered set of evenly spaced values is not yet a progression. Under the convention used here d = 0 is allowed, making a constant sequence a degenerate case; a convention requiring distinct terms must demand d not equal to 0. A finite progression yields the sum S_n = n(a_1 + a_n)/2 = n(2a_1 + (n-1)d)/2, but that sum is an arithmetic series, a consequence of the progression rather than the progression itself.

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) — outgoing typed relations

  • 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) — abstractions linked here by typed relations

  • Equally Spaced Polynomial Domain-specific presupposes Arithmetic Progression

    Arithmetic Progression is the broader abstraction this entry instantiates through strict composition/presupposition.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Arithmetic Progression sits in a moderately populated region (53rd percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Formal Sequences & Language Structure (18 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25