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:
and in general
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 
The sum of the members of a finite arithmetic progression is called an arithmetic series. For example, consider the sum:
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:
In the case above, this gives the equation:
This formula works for any real numbers
${displaystyle a_{1}}$and
${displaystyle a_{n}}$. For example:
Derivation[edit]
To derive the above formula, begin by expressing the arithmetic series in two different ways:
Adding both sides of the two equations, all terms involving d cancel:
Dividing both sides by 2 produces a common form of the equation:
An alternate form results from reinserting the substitution:
${displaystyle a_{n}=a_{1}+(n1)d}$:
Furthermore, the mean value of the series can be calculated via:
${displaystyle S_{n}/n}$:
The formula is very similar to the mean of a discrete uniform distribution.
Product[edit]
The product of the members of a finite arithmetic progression with an initial element a_{1}, common differences d, and n elements in total is determined in a closed expression
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
for positive integers
${displaystyle m}$and
${displaystyle n}$is given by
Derivation[edit]
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)}$
,
so that
for
${displaystyle m}$a positive integer and
${displaystyle z}$a positive complex number.
Thus, if
${displaystyle a_{1}/d>0}$${displaystyle prod _{k=0}^{n1}left({frac {a_{1}}{d}}+kright)={frac {Gamma left({frac {a_{1}}{d}}+nright)}{Gamma left({frac {a_{1}}{d}}right)}}}$
,
and, finally,
Examples[edit]
 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(n1)}$up to the 50th term is
 Example 2
The product of the first 10 odd numbers
${displaystyle (1,3,5,7,9,11,13,15,17,19)}$is given by
Standard deviation[edit]
The standard deviation of any arithmetic progression can be calculated as
where
${displaystyle n}$ is the number of terms in the progression and
is the common difference between terms. The formula is very similar to the standard deviation of a discrete uniform distribution.
Intersections[edit]
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 nonempty 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[edit]
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]}
See also[edit]
References[edit]
 ^ Duchet, Pierre (1995), “Hypergraphs”, in Graham, R. L.; Grötschel, M.; Lovász, L. (eds.), Handbook of combinatorics, Vol. 1, 2, Amsterdam: Elsevier, pp. 381–432, MR 1373663. See in particular Section 2.5, “Helly Property”, pp. 393–394.
 ^ Hayes, Brian (2006). “Gauss’s Day of Reckoning”. American Scientist. 94 (3): 200. doi:10.1511/2006.59.200. Archived from the original on 12 January 2012. Retrieved 16 October 2020.
 ^ Høyrup, J. The “Unknown Heritage”: trace of a forgotten locus of mathematical sophistication. Arch. Hist. Exact Sci. 62, 613–654 (2008). https://doi.org/10.1007/s004070080025y
 ^ Tropfke, Johannes (1924). Analysis, analytische Geometrie. Walter de Gruyter. pp. 3–15. ISBN 9783111080628.
 ^ Tropfke, Johannes (1979). Arithmetik und Algebra. Walter de Gruyter. pp. 344–354. ISBN 9783110048933.
 ^ Problems to Sharpen the Young, John Hadley and David Singmaster, The Mathematical Gazette, 76, #475 (March 1992), pp. 102–126.
 ^ Ross, H.E. & Knott,B.I (2019) Dicuil (9th century) on triangular and square numbers, British Journal for the History of Mathematics, 34:2, 7994, https://doi.org/10.1080/26375451.2019.1598687
 ^ Sigler, Laurence E. (trans.) (2002). Fibonacci’s Liber Abaci. SpringerVerlag. pp. 259–260. ISBN 0387954198.
 ^ Katz, Victor J. (edit.) (2016). Sourcebook in the Mathematics of Medieval Europe and North Africa. Princeton University Press. pp. 91, 257. ISBN 9780691156859.
 ^ Stern, M. (1990). 74.23 A Mediaeval Derivation of the Sum of an Arithmetic Progression. The Mathematical Gazette, 74(468), 157159. doi:10.2307/3619368
External links[edit]
Recent Comments