Arithmetico-geometric sequence

In mathematics, an arithmetico-geometric sequence is the result of element-by-element multiplication of the elements of a geometric progression with the corresponding elements of an arithmetic progression. The nth element of an arithmetico-geometric sequence is the product of the nth element of an arithmetic sequence and the nth element of a geometric sequence. An arithmetico-geometric series is a sum of terms that are the elements of an arithmetico-geometric sequence. Arithmetico-geometric sequences and series arise in various applications, such as the computation of expected values in probability theory, especially in Bernoulli processes.

For instance, the sequence

$\frac{0}{1},\frac{1}{2},\frac{2}{4},\frac{3}{8},\frac{4}{16},\frac{5}{32},\cdots$

is an arithmetico-geometric sequence. The arithmetic component appears in the numerator (in Template:Color), and the geometric one in the denominator (in Template:Color). The series summation of the infinite elements of this sequence has been called Gabriel's staircase and it has a value of 2. In general,

$\sum _{k=1}^{\mathrm{\infty }}k{r}^k=\frac{r}{(1-r{)}^2}\text{for }-1<r<1.$

The label of arithmetico-geometric sequence may also be given to different objects combining characteristics of both arithmetic and geometric sequences. For instance, the French notion of arithmetico-geometric sequence refers to sequences that satisfy recurrence relations of the form $u_{n+1}=r{u}_n+d$, which combine the defining recurrence relations $u_{n+1}=u_n+d$ for arithmetic sequences and $u_{n+1}=r{u}_n$ for geometric sequences. These sequences are therefore solutions to a special class of linear difference equation: inhomogeneous first order linear recurrences with constant coefficients.

Elements

The elements of an arithmetico-geometric sequence $(A_n{G}_n{)}_{n\ge 1}$ are the products of the elements of an arithmetic progression $(A_n{)}_{n\ge 1}$ (in blue) with initial value $a$ and common difference $d$, $A_n=a+(n-1)d,$ with the corresponding elements of a geometric progression $(G_n{)}_{n\ge 1}$ (in green) with initial value $b$ and common ratio $r$, $G_n=b{r}^{n-1},$ so that

$\begin{array}{cc}{A}_1{G}_1& =ab\\ A_2{G}_2& =(a+d)br\\ A_3{G}_3& =(a+2d)b{r}^2\\ & ⋮\\ A_n{G}_n& =(a+(n-1)d)b{r}^{n-1}.\end{array}$

These four parameters are somewhat redundant and can be reduced to three: $ab,$ $bd,$ and $r.$

Example

The sequence

$\frac{0}{1},\frac{1}{2},\frac{2}{4},\frac{3}{8},\frac{4}{16},\frac{5}{32},\cdots$

is the arithmetico-geometric sequence with parameters $d=b=1$, $a=0$, and $r=\frac{1}{2}$.

Series

Partial sums

The sum of the first Template:Math terms of an arithmetico-geometric series has the form

$\begin{array}{cc}{S}_n& =\sum _{k=1}^n{A}_k{G}_k\\ & =\sum _{k=1}^n(a+(k-1)d)b{r}^{k-1}\\ & =b\sum _{k=0}^{n-1}(a+kd)r^k\\ & =ab+(a+d)br+(a+2d)b{r}^2+\cdots +(a+(n-1)d)b{r}^{n-1}\end{array}$

where $A_i$ and $G_i$ are the Template:Mvarth elements of the arithmetic and the geometric sequence, respectively.

This partial sum has the closed-form expression

$\begin{array}{cc}{S}_n& =\frac{ab-(a+nd)b{r}^n}{1-r}+\frac{dbr(1-r^n)}{(1-r{)}^2}\\ & =\frac{A_1{G}_1-A_{n+1}{G}_{n+1}}{1-r}+\frac{dr}{(1-r{)}^2}(G_1-G_{n+1}).\end{array}$

son

Derivation

Multiplying

$S_n=ab+(a+d)br+(a+2d)b{r}^2+\cdots +(a+(n-1)d)b{r}^{n-1}$

by Template:Math gives

$r{S}_n=abr+(a+d)b{r}^2+(a+2d)b{r}^3+\cdots +(a+(n-1)d)b{r}^n.$

Subtracting Template:Math from Template:Math, dividing both sides by $b$, and using the technique of telescoping series (second equality) and the formula for the sum of a finite geometric series (fifth equality) gives

$\begin{array}{cc}\frac{(1-r)S_n}{b}& =(a+(a+d)r+(a+2d)r^2+\cdots +(a+(n-1)d\left)r^{n-1}\right)-(ar+(a+d)r^2+(a+2d)r^3+\cdots +(a+(n-1)d\left)r^n\right)\\ & =a+d(r+r^2+\cdots +r^{n-1})-(a+(n-1)d)r^n\\ & =a+d(r+r^2+\cdots +r^{n-1}+r^n)-(a+nd)r^n\\ & =a+dr(1+r+r^2+\cdots +r^{n-1})-(a+nd)r^n\\ & =a+\frac{dr(1-r^n)}{1-r}-(a+nd)r^n,\\ S_n& =\frac{b}{1-r}(a-(a+nd)r^n+\frac{dr(1-r^n)}{1-r})\\ & =\frac{ab-(a+nd)b{r}^n}{1-r}+\frac{dr(b-b{r}^n)}{(1-r{)}^2}\\ & =\frac{A_1{G}_1-A_{n+1}{G}_{n+1}}{1-r}+\frac{dr(G_1-G_{n+1})}{(1-r{)}^2}\end{array}$

as claimed.

Infinite series

If Template:Math, then the sum Template:Math of the arithmetico-geometric series, that is to say, the limit of the partial sums of the elements of the sequence, is given by

$\begin{array}{cc}S& =\sum _{k=1}^{\mathrm{\infty }}{t}_k=\underset{n\to \mathrm{\infty }}{lim}{S}_n\\ & =\frac{ab}{1-r}+\frac{dbr}{(1-r{)}^2}\\ & =\frac{A_1{G}_1}{1-r}+\frac{dr{G}_1}{(1-r{)}^2}.\end{array}$

If Template:Math is outside of the above range, Template:Math is not zero, and Template:Math and Template:Math are not both zero, the limit does not exist and the series is divergent.

Example

The sum

$S=\frac{0}{1}+\frac{1}{2}+\frac{2}{4}+\frac{3}{8}+\frac{4}{16}+\frac{5}{32}+\cdots$,

is the sum of an arithmetico-geometric series defined by $d=b=1$, $a=0$, and $r=\frac{1}{2}$, and it converges to $S=2$. This sequence corresponds to the expected number of coin tosses required to obtain "tails". The probability $T_k$ of obtaining tails for the first time at the kth toss is as follows:

$T_1=\frac{1}{2},T_2=\frac{1}{4},\dots ,T_k=\frac{1}{2^k}$.

Therefore, the expected number of tosses to reach the first "tails" is given by

$\sum _{k=1}^{\mathrm{\infty }}k{T}_k=\sum _{k=1}^{\mathrm{\infty }}\frac{k}{2^k}=2.$

Similarly, the sum

$S=\frac{0\cdot \frac{1}{6}}{\frac{5}{6}}+\frac{1\cdot \frac{1}{6}}{1}+\frac{2\cdot \frac{1}{6}}{\frac{6}{5}}+\frac{3\cdot \frac{1}{6}}{{\left(\frac{6}{5}\right)}^2}+\frac{4\cdot \frac{1}{6}}{{\left(\frac{6}{5}\right)}^3}+\frac{5\cdot \frac{1}{6}}{{\left(\frac{6}{5}\right)}^4}+\cdots$

is the sum of an arithmetico-geometric series defined by $d=1$, $a=0$, $b=\frac{1/6}{5/6}=\frac{1}{5}$, and $r=\frac{5}{6}$, and it converges to 6. This sequence corresponds to the expected number of six-sided dice rolls required to obtain a specific value on a die roll, for instance "5". In general, these series with $d=1$, $a=0$, $b=\frac{p}{1-p}$, and $r=1-p$ give the expectations of "the number of trials until first success" in Bernoulli processes with "success probability" $p$. The probabilities of each outcome follow a geometric distribution and provide the geometric sequence factors in the terms of the series, while the number of trials per outcome provides the arithmetic sequence factors in the terms.

Further reading

• Template:Cite book
• Template:Cite book

Template:Calculus topics Template:Series (mathematics)