Arithmetic Progressions

⚡ Key Takeaways

An arithmetic progression (AP) is a sequence in which each term differs from the previous one by a fixed constant $d$ , the common difference. Its $n$ -th term is $a_n = a_1 + (n-1)d$ and the sum of its first $n$ terms is $S_n = \tfrac{n}{2}(a_1 + a_n)$ . APs appear everywhere linear growth occurs — interest, seating rows, physics under constant acceleration — and were studied from antiquity, with the famous summation trick attributed to a young Carl Friedrich Gauss.

💡 The Core Insight

Constant steps make the sequence linear, and linearity makes the sum a symmetric average. Because every term is the first term plus a whole number of equal jumps, term $n$ is a linear function of $n$ . And because terms are evenly spaced, the average of all of them equals the average of the two endpoints — so the total is simply that average times the count. Two ideas — equal spacing and end-pairing — generate every formula on this page.

DefinitionArithmetic Progression

A sequence $(a_n)_{n\ge 1}$ is an arithmetic progression if there exists a constant $d \in \mathbb{R}$ , called the common difference, such that

1

\quad a_{n+1} - a_n = d \qquad \text{for all } n \ge 1.

Derivation hint: This is the defining property; "common difference" literally means $a_{n+1}-a_n$ is the same for every $n$ . Here:

$a_1$ = the first term (the starting value),
$a_n$ = the $n$ -th term (general term),
$d$ = the common difference (constant gap between neighbours),
$n$ = the index (position), a positive integer.

The closed form for the general term is

2

\quad a_n = a_1 + (n-1)d.

Derivation hint: Start at $a_1$ and add $d$ a total of $(n-1)$ times to reach term $n$ ; telescoping $a_n = a_1 + \sum_{k=1}^{n-1}d$ .

TheoremSum of an Arithmetic Progression

The sum $S_n = a_1 + a_2 + \cdots + a_n$ of the first $n$ terms of an arithmetic progression is

3

\quad S_n = \frac{n}{2}\,(a_1 + a_n).

Derivation hint: Average of first and last term, $\tfrac{a_1+a_n}{2}$ , times the number of terms $n$ — equivalently the Gauss pairing trick below. Substituting $a_n = a_1 + (n-1)d$ from [2] gives the form using only $a_1$ and $d$ :

4

\quad S_n = \frac{n}{2}\,\bigl[\,2a_1 + (n-1)d\,\bigr].

Derivation hint: Replace $a_n$ in [3] with $a_1+(n-1)d$ and factor $a_1+a_1 = 2a_1$ .

ProofSum formula via end-pairing (Gauss's method)

We prove [3].

Step 1. Write the sum forwards:

S_n = a_1 + a_2 + \cdots + a_{n-1} + a_n.

Step 2. Write the same sum backwards:

S_n = a_n + a_{n-1} + \cdots + a_2 + a_1.

Step 3. Add the two lines term by term. The $k$ -th column gives $a_k + a_{n-k+1}$ . But in an AP, $a_k = a_1 + (k-1)d$ and $a_{n-k+1} = a_1 + (n-k)d$ , so

a_k + a_{n-k+1} = 2a_1 + (n-1)d = a_1 + a_n,

a constant independent of $k$ .

Step 4. There are $n$ such columns, each summing to $(a_1 + a_n)$ . Therefore

2S_n = n\,(a_1 + a_n).

Step 5. Divide by 2:

S_n = \frac{n}{2}(a_1 + a_n). \qquad \blacksquare

∎

ProofGeneral term via induction

We prove [2] by induction on $n$ .

Base case ( $n=1$ ): $a_1 = a_1 + (1-1)d = a_1$ . ✓

Inductive step: Assume $a_k = a_1 + (k-1)d$ . By the definition [1], $a_{k+1} = a_k + d = a_1 + (k-1)d + d = a_1 + kd = a_1 + ((k+1)-1)d$ . ✓ By induction, [2] holds for all $n \ge 1$ . $\blacksquare$

∎

mathematician · Carl Friedrich Gauss | 1777–1855

The German mathematician Carl Friedrich Gauss is legendarily said to have, as a schoolboy around age 7–10, summed the integers from 1 to 100 in seconds by pairing $1+100, 2+99, \ldots$ into fifty pairs of 101, giving $5050$ . Whether the anecdote is literally true is debated, but the method — recognising that endpoints pair to equal sums — is exactly the engine of formula [3]. Gauss went on to revolutionise number theory, statistics (the Gaussian distribution), geometry, and physics, but the "Gauss sum" of an AP remains the most-told story of mathematical childhood precocity.

🧠 Intuition

Picture a staircase where every step has the same height $d$ . The height of step $n$ above the ground is $a_1 + (n-1)d$ — that's formula [2]. Now imagine you want the total amount of "material" stacked under all the steps (the sum). Lay one identical staircase upside-down on top of the first: every column now has the same total height, $a_1 + a_n$ , and there are $n$ columns. You've built a perfect rectangle of area $n(a_1+a_n)$ from two staircases, so one staircase is half of it — that's formula [3]. The equal step height is what makes the upside-down trick work; for irregular steps the columns wouldn't match.

Figure

An arithmetic progression

a_n = 2 + 3(n-1)

plotted as points lying on a straight line; equal vertical jumps of

d=3

.

```svg

```

ExampleFinding a term and a sum

Given: An AP with first term $a_1 = 5$ and common difference $d = 4$ . Find the 20th term and the sum of the first 20 terms.

Step 1 — 20th term using [2]:

a_{20} = a_1 + (20-1)d = 5 + 19(4) = 5 + 76 = 81.

Step 2 — Sum using [3]:

S_{20} = \frac{20}{2}(a_1 + a_{20}) = 10\,(5 + 81) = 10 \times 86 = 860.

Check with [4]: $S_{20} = \tfrac{20}{2}[2(5) + 19(4)] = 10[10 + 76] = 10 \times 86 = 860.$ ✓

\boxed{a_{20} = 81, \qquad S_{20} = 860}

ExampleRecovering the progression from two facts

Given: In an AP, the 4th term is $a_4 = 14$ and the 9th term is $a_9 = 34$ . Find $a_1$ , $d$ , and the sum of the first 10 terms.

Step 1 — Set up equations from [2]:

a_4 = a_1 + 3d = 14, \qquad a_9 = a_1 + 8d = 34.

Step 2 — Subtract to find $d$ :

(a_1 + 8d) - (a_1 + 3d) = 34 - 14 \;\Rightarrow\; 5d = 20 \;\Rightarrow\; d = 4.

Step 3 — Back-substitute for $a_1$ :

a_1 + 3(4) = 14 \;\Rightarrow\; a_1 = 14 - 12 = 2.

Step 4 — Sum of first 10 terms using [4]:

S_{10} = \frac{10}{2}\bigl[2(2) + 9(4)\bigr] = 5\,[4 + 36] = 5 \times 40 = 200.

\boxed{a_1 = 2,\quad d = 4,\quad S_{10} = 200}

⚠️ Common mistake

An AP is defined by a constant difference, not a constant ratio. If consecutive terms are related by multiplication (e.g. $3, 6, 12, 24$ ), that is a geometric progression, not arithmetic. Always test by subtracting adjacent terms: the sequence is an AP only if $a_2 - a_1 = a_3 - a_2 = \cdots$ Furthermore, do not confuse the index $n$ (a count, starting at 1) with the term value $a_n$ . In formula [2] the multiplier is $(n-1)$ , not $n$ — a classic off-by-one error that shifts every answer by one $d$ .

Counterexample

The sequence $1, 2, 4, 8, 16, \dots$ is not an arithmetic progression. The successive differences are $2-1 = 1$ , $4-2 = 2$ , $8-4 = 4$ — these are not equal, so condition [1] fails. (It is a geometric progression with common ratio 2.) Equally, $1, 4, 9, 16, 25$ (the perfect squares) is not an AP: the differences $3, 5, 7, 9$ are themselves increasing. Notice, however, that those differences $3,5,7,9$ do form an AP — squares are a "second-order" arithmetic sequence, a hint toward Finite Differences.

connection

Arithmetic progressions sit at a crossroads of several topics. They are the discrete analogue of Linear Functions: plotting $a_n$ against $n$ gives points on a straight line of slope $d$ . They contrast with Geometric Progressions, where a constant ratio replaces the constant difference, and with which they combine into Arithmetico-Geometric Sequences. The sum formula is the first nontrivial case of Series and Summation and a gateway to Sigma Notation. The squares-difference observation links APs to Finite Differences and the calculus of finite sums, while the average-of-endpoints property connects to the Arithmetic Mean and, by contrast, to the Inequality of Arithmetic and Geometric Means.

🔬 Where this appears

⏳ History

- c. 1650 BCE — Rhind Papyrus (Egypt): Problem 64 distributes grain in an arithmetic progression, one of the oldest recorded AP problems.

- c. 300 BCE — Euclid's Elements (Book IX): Treats sums of consecutive integers and properties tied to arithmetic sequences geometrically.

- c. 200 BCE — Archimedes: Uses sums of arithmetic-type sequences in quadrature arguments approximating areas.

- 5th–7th century CE — Aryabhata & Brahmagupta (India): Aryabhata's Aryabhatiya gives general rules for the sum and number of terms of an AP, including inverting the sum formula to find

n

.

- 12th century — Bhāskara II (India): In Līlāvatī, presents systematic AP problems and solution recipes used pedagogically for centuries.

- 9th–13th century — Islamic mathematics (al-Karaji, al-Samaw'al): Develop summation of arithmetic and higher-order series with early inductive reasoning.

- c. 1784 — Carl Friedrich Gauss (anecdote): The schoolboy summation of

1

to

100

popularises the end-pairing method.

- 19th century — Formalisation: With rigorous sequence and series theory (Cauchy, Weierstrass), APs become the introductory example of convergence/divergence and finite-difference calculus.

open-problem

While the formulas here are elementary and complete for finite APs, deep questions arise when arithmetic progressions meet number theory. Are there arbitrarily long arithmetic progressions consisting entirely of prime numbers? The answer is yes — proved by Ben Green and Terence Tao in 2004 (the Green–Tao theorem) — but the proof is among the most celebrated in modern mathematics and is highly non-elementary. Related and still-open is the strong form of the Erdős conjecture on arithmetic progressions: any set of positive integers whose reciprocals sum to infinity must contain arbitrarily long APs. Even simpler-sounding: the largest known infinite set with no three-term AP and questions about the densest such sets (Roth's theorem and its refinements) remain active research. These show that the humble AP, fully tamed in finite form, hides profound structure at the frontier.

Formal Statement

Why It Holds / Derivation

Building Intuition

Worked Examples

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also