Arithmetic progression – Wikipedia

Sequence of numbers

An arithmetic progression or arithmetic sequence is a sequence of numbers such that the difference between the consecutive terms is constant. For instance, the sequence 5, 7, 9, 11, 13, 15, . . . is an arithmetic progression with a common difference of 2.

If the initial term of an arithmetic progression is

${displaystyle a_{1}}$

and the common difference of successive members is

${displaystyle d}$

, then the

${displaystyle n}$

-th term of the sequence (

${displaystyle a_{n}}$

) is given by:

${displaystyle a_{n}=a_{1}+(n-1)d}$

,

and in general

${displaystyle a_{n}=a_{m}+(n-m)d}$

.

A finite portion of an arithmetic progression is called a finite arithmetic progression and sometimes just called an arithmetic progression. The sum of a finite arithmetic progression is called an arithmetic series.

 2 + 5 + 8 + 11 + 14 = 40 14 + 11 + 8 + 5 + 2 = 40 16 + 16 + 16 + 16 + 16 = 80

Computation of the sum 2 + 5 + 8 + 11 + 14. When the sequence is reversed and added to itself term by term, the resulting sequence has a single repeated value in it, equal to the sum of the first and last numbers (2 + 14 = 16). Thus 16 × 5 = 80 is twice the sum.

The sum of the members of a finite arithmetic progression is called an arithmetic series. For example, consider the sum:

${displaystyle 2+5+8+11+14}$

This sum can be found quickly by taking the number n of terms being added (here 5), multiplying by the sum of the first and last number in the progression (here 2 + 14 = 16), and dividing by 2:

${displaystyle {frac {n(a_{1}+a_{n})}{2}}}$

In the case above, this gives the equation:

${displaystyle 2+5+8+11+14={frac {5(2+14)}{2}}={frac {5times 16}{2}}=40.}$

This formula works for any real numbers

${displaystyle a_{1}}$

and

${displaystyle a_{n}}$

. For example:

${displaystyle left(-{frac {3}{2}}right)+left(-{frac {1}{2}}right)+{frac {1}{2}}={frac {3left(-{frac {3}{2}}+{frac {1}{2}}right)}{2}}=-{frac {3}{2}}.}$

Derivation

Animated proof for the formula giving the sum of the first integers 1+2+…+n.

To derive the above formula, begin by expressing the arithmetic series in two different ways:

${displaystyle S_{n}=a_{1}+(a_{1}+d)+(a_{1}+2d)+cdots +(a_{1}+(n-2)d)+(a_{1}+(n-1)d)}$

${displaystyle S_{n}=(a_{n}-(n-1)d)+(a_{n}-(n-2)d)+cdots +(a_{n}-2d)+(a_{n}-d)+a_{n}.}$

Adding both sides of the two equations, all terms involving d cancel:

${displaystyle 2S_{n}=n(a_{1}+a_{n}).}$

Dividing both sides by 2 produces a common form of the equation:

${displaystyle S_{n}={frac {n}{2}}(a_{1}+a_{n}).}$

An alternate form results from re-inserting the substitution:

${displaystyle a_{n}=a_{1}+(n-1)d}$

:

${displaystyle S_{n}={frac {n}{2}}[2a_{1}+(n-1)d].}$

Furthermore, the mean value of the series can be calculated via:

${displaystyle S_{n}/n}$

:

${displaystyle {overline {a}}={frac {a_{1}+a_{n}}{2}}.}$

The formula is very similar to the mean of a discrete uniform distribution.

Product

The product of the members of a finite arithmetic progression with an initial element a1, common differences d, and n elements in total is determined in a closed expression

${displaystyle a_{1}a_{2}a_{3}cdots a_{n}=a_{1}(a_{1}+d)(a_{1}+2d)…(a_{1}+(n-1)d)=prod _{k=0}^{n-1}(a_{1}+kd)=d^{n}{frac {Gamma left({frac {a_{1}}{d}}+nright)}{Gamma left({frac {a_{1}}{d}}right)}}}$

where

${displaystyle Gamma }$

denotes the Gamma function. The formula is not valid when

${displaystyle a_{1}/d}$

is negative or zero.

This is a generalization from the fact that the product of the progression

${displaystyle 1times 2times cdots times n}$

is given by the factorial

${displaystyle n!}$

and that the product

${displaystyle mtimes (m+1)times (m+2)times cdots times (n-2)times (n-1)times n}$

for positive integers

${displaystyle m}$

and

${displaystyle n}$

is given by

${displaystyle {frac {n!}{(m-1)!}}.}$

Derivation

{displaystyle {begin{aligned}a_{1}a_{2}a_{3}cdots a_{n}&=prod _{k=0}^{n-1}(a_{1}+kd)&=prod _{k=0}^{n-1}dleft({frac {a_{1}}{d}}+kright)=dleft({frac {a_{1}}{d}}right)dleft({frac {a_{1}}{d}}+1right)dleft({frac {a_{1}}{d}}+2right)cdots dleft({frac {a_{1}}{d}}+(n-1)right)&=d^{n}prod _{k=0}^{n-1}left({frac {a_{1}}{d}}+kright)=d^{n}{left({frac {a_{1}}{d}}right)}^{overline {n}}end{aligned}}}

where

${displaystyle x^{overline {n}}}$

denotes the rising factorial.

By the recurrence formula

${displaystyle Gamma (z+1)=zGamma (z)}$

, valid for a complex number

${displaystyle z>0}$

${displaystyle Gamma (z+2)=(z+1)Gamma (z+1)=(z+1)zGamma (z)}$

,

${displaystyle Gamma (z+3)=(z+2)Gamma (z+2)=(z+2)(z+1)zGamma (z)}$

,

so that

${displaystyle {frac {Gamma (z+m)}{Gamma (z)}}=prod _{k=0}^{m-1}(z+k)}$

for

${displaystyle m}$

a positive integer and

${displaystyle z}$

a positive complex number.

Thus, if

${displaystyle a_{1}/d>0}$

${displaystyle prod _{k=0}^{n-1}left({frac {a_{1}}{d}}+kright)={frac {Gamma left({frac {a_{1}}{d}}+nright)}{Gamma left({frac {a_{1}}{d}}right)}}}$

,

and, finally,

${displaystyle a_{1}a_{2}a_{3}cdots a_{n}=d^{n}prod _{k=0}^{n-1}left({frac {a_{1}}{d}}+kright)=d^{n}{frac {Gamma left({frac {a_{1}}{d}}+nright)}{Gamma left({frac {a_{1}}{d}}right)}}}$

Examples

Example 1

Taking the example

${displaystyle 3,8,13,18,23,28,ldots }$

, the product of the terms of the arithmetic progression given by

${displaystyle a_{n}=3+5(n-1)}$

up to the 50th term is

${displaystyle P_{50}=5^{50}cdot {frac {Gamma left(3/5+50right)}{Gamma left(3/5right)}}approx 3.78438times 10^{98}.}$

Example 2

The product of the first 10 odd numbers

${displaystyle (1,3,5,7,9,11,13,15,17,19)}$

is given by

${displaystyle 1.3.5cdots 19=prod _{k=0}^{9}(1+2k)=2^{10}cdot {frac {Gamma left({frac {1}{2}}+10right)}{Gamma left({frac {1}{2}}right)}}}$

= 654,729,075

Standard deviation

The standard deviation of any arithmetic progression can be calculated as

${displaystyle sigma =|d|{sqrt {frac {(n-1)(n+1)}{12}}}}$

where

${displaystyle n}$

is the number of terms in the progression and

${displaystyle d}$

is the common difference between terms. The formula is very similar to the standard deviation of a discrete uniform distribution.

Intersections

The intersection of any two doubly infinite arithmetic progressions is either empty or another arithmetic progression, which can be found using the Chinese remainder theorem. If each pair of progressions in a family of doubly infinite arithmetic progressions have a non-empty intersection, then there exists a number common to all of them; that is, infinite arithmetic progressions form a Helly family.[1] However, the intersection of infinitely many infinite arithmetic progressions might be a single number rather than itself being an infinite progression.

History

According to an anecdote of uncertain reliability,[2] young Carl Friedrich Gauss in primary school reinvented this method to compute the sum of the integers from 1 through 100, by multiplying n/2 pairs of numbers in the sum by the values of each pair n + 1.[clarification needed] However, regardless of the truth of this story, Gauss was not the first to discover this formula, and some find it likely that its origin goes back to the Pythagoreans in the 5th century BC.[3] Similar rules were known in antiquity to Archimedes, Hypsicles and Diophantus;[4] in China to Zhang Qiujian; in India to Aryabhata, Brahmagupta and Bhaskara II;[5] and in medieval Europe to Alcuin,[6]Dicuil,[7]Fibonacci,[8]Sacrobosco[9]
and to anonymous commentators of Talmud known as Tosafists.[10]