ratio test

{{Short description|Criterion for the convergence of a series}}

{{Calculus|Series}}

In mathematics, the ratio test is a test (or "criterion") for the convergence of a series

:\sum_{n=1}^\infty a_n,

where each term is a real or complex number and {{mvar|an}} is nonzero when {{mvar|n}} is large. The test was first published by Jean le Rond d'Alembert and is sometimes known as d'Alembert's ratio test or as the Cauchy ratio test.{{mathworld|title=Ratio Test|urlname=RatioTest}}

The test

File:Decision diagram for the ratio test.svg

The usual form of the test makes use of the limit

{{NumBlk|:|L = \lim_{n\to\infty}\left|\frac{a_{n+1}}{a_n}\right|.|{{EquationRef|1}}}}

The ratio test states that:

  • if L < 1 then the series converges absolutely;
  • if L > 1 then the series diverges;
  • if L = 1 or the limit fails to exist, then the test is inconclusive, because there exist both convergent and divergent series that satisfy this case.

It is possible to make the ratio test applicable to certain cases where the limit L fails to exist, if limit superior and limit inferior are used. The test criteria can also be refined so that the test is sometimes conclusive even when L = 1. More specifically, let

:R = \lim\sup \left|\frac{a_{n+1}}{a_n}\right|

:r = \lim\inf \left|\frac{a_{n+1}}{a_n}\right|.

Then the ratio test states that:{{harvnb|Rudin|1976|loc=§3.34}}{{harvnb|Apostol|1974|loc=§8.14}}

  • if R < 1, the series converges absolutely;
  • if r > 1, the series diverges; or equivalently if \left|\frac{a_{n+1}}{a_n}\right|> 1 for all large n (regardless of the value of r), the series also diverges; this is because |a_n| is nonzero and increasing and hence {{mvar|an}} does not approach zero;
  • the test is otherwise inconclusive.

If the limit L in ({{EquationNote|1}}) exists, we must have L = R = r. So the original ratio test is a weaker version of the refined one.

Examples

= Convergent because ''L'' < 1 =

Consider the series

:\sum_{n=1}^\infty\frac{n}{e^n}

Applying the ratio test, one computes the limit

:L = \lim_{n\to\infty} \left| \frac{a_{n+1}}{a_n} \right| = \lim_{n\to\infty} \left| \frac{\frac{n+1}{e^{n+1}}}{\frac{n}{e^n}}\right| = \frac{1}{e} < 1.

Since this limit is less than 1, the series converges.

= Divergent because ''L'' > 1 =

Consider the series

:\sum_{n=1}^\infty\frac{e^n}{n}.

Putting this into the ratio test:

:L = \lim_{n\to\infty} \left| \frac{a_{n+1}}{a_n} \right| = \lim_{n\to\infty} \left| \frac{\frac{e^{n+1}}{n+1}}{\frac{e^n}{n}} \right|

= e > 1.

Thus the series diverges.

= Inconclusive because ''L'' = 1 =

Consider the three series

:\sum_{n=1}^\infty 1,

:\sum_{n=1}^\infty \frac{1}{n^2},

:\sum_{n=1}^\infty \frac{(-1)^{n+1}}{n}.

The first series (1 + 1 + 1 + 1 + ⋯) diverges, the second (the one central to the Basel problem) converges absolutely and the third (the alternating harmonic series) converges conditionally. However, the term-by-term magnitude ratios \left|\frac{a_{n+1}}{a_n}\right| of the three series are 1,   \frac{n^2}{(n+1)^2}    and   \frac{n}{n+1}. So, in all three, the limit \lim_{n\to\infty}\left|\frac{a_{n+1}}{a_n}\right| is equal to 1. This illustrates that when L = 1, the series may converge or diverge: the ratio test is inconclusive. In such cases, more refined tests are required to determine convergence or divergence.

Proof

File:Ratio test proof.svg

Below is a proof of the validity of the generalized ratio test.

Suppose that r=\liminf_{n\to\infty}\left|\frac{a_{n+1}}{a_n}\right|>1. We also suppose that (a_n) has infinite non-zero members, otherwise the series is just a finite sum hence it converges. Then there exists some \ell\in(1;r) such that there exists a natural number n_0\ge2 satisfying a_{n_0}\ne0 and \left|\frac{a_{n+1}}{a_n}\right|>\ell for all n\ge n_0, because if no such \ell exists then there exists arbitrarily large n satisfying \left|\frac{a_{n+1}}{a_n}\right|<\ell for every \ell\in(1;r), then we can find a subsequence \left(a_{n_k}\right)_{k=1}^\infty satisfying \limsup_{n\to\infty}\left|\frac{a_{n_k+1}}{a_{n_k}} \right|\le\ell, but this contradicts the fact that r is the limit inferior of \left|\frac{a_{n+1}}{a_n}\right| as n\to\infty, implying the existence of \ell. Then we notice that for n\ge n_0+1, |a_n|> \ell|a_{n-1}|>\ell^2|a_{n-2}|>...>\ell^{n-n_0}\left|a_{n_0}\right|. Notice that \ell>1 so \ell^n\to\infty as n\to\infty and \left|a_{n_0}\right|>0, this implies (a_n) diverges so the series \sum_{n=1}^\infty a_n diverges by the n-th term test.

Now suppose R=\limsup_{n\to\infty}\left|\frac{a_{n+1}}{a_n}\right|<1. Similar to the above case, we may find a natural number n_1 and a c\in(R;1) such that |a_n|\le c^{n-n_1}\left|a_{n_1}\right| for n\ge n_1. Then

\sum_{n=1}^\infty |a_n|=\sum_{k=1}^{n_1-1}|a_k|+\sum_{n=n_1}^\infty |a_n|\le\sum_{k=1}^{n_1-1}|a_k|+\sum_{n=n_1}^\infty c^{n-n_1}|a_{n_1}|=\sum_{k=1}^{n_1-1}|a_k|+\left|a_{n_1}\right|\sum_{n=0}^\infty c^n.

The series \sum_{n=0}^\infty c^n is the geometric series with common ratio c\in(0;1), hence \sum_{n=0}^\infty c^n=\frac{1}{1-c} which is finite. The sum \sum_{k=1}^{n_1-1}|a_k| is a finite sum and hence it is bounded, this implies the series \sum_{n=1}^\infty |a_n| converges by the monotone convergence theorem and the series \sum_{n=1}^\infty a_n converges by the absolute convergence test.

When the limit \left|\frac{a_{n+1}}{a_n}\right| exists and equals to L then r=R=L, this gives the original ratio test.

Extensions for ''L'' = 1

As seen in the previous example, the ratio test may be inconclusive when the limit of the ratio is 1. Extensions to the ratio test, however, sometimes allow one to deal with this case.{{cite book |last=Bromwich |first=T. J. I'A |date=1908 |title=An Introduction To The Theory of Infinite Series |publisher=Merchant Books |author-link= Thomas John I'Anson Bromwich}}{{cite book |last=Knopp |first=Konrad |date=1954 |title=Theory and Application of Infinite Series |url=https://archive.org/details/theoryandapplica031692mbp/page/n5 |location=London |publisher=Blackie & Son Ltd. |author-link=Konrad Knopp }}

{{cite journal |last1=Tong |first1=Jingcheng|date=May 1994|title=Kummer's Test Gives Characterizations for Convergence or Divergence of all Positive Series|jstor=2974907|journal=The American Mathematical Monthly |volume=101 |issue=5 |pages=450–452 |doi=10.2307/2974907 }}

{{cite journal |last1=Ali |first1=Sayel A.|date=2008 |title=The mth Ratio Test: New Convergence Test for Series |url= https://www.tandfonline.com/doi/abs/10.1080/00029890.2008.11920558 |journal=The American Mathematical Monthly |volume=115 |issue=6 |pages=514–524 |doi= 10.1080/00029890.2008.11920558|s2cid=16336333|access-date=4 September 2024 |url-access=subscription }}

{{cite journal |last1=Samelson |first1=Hans|date=November 1995|title=More on Kummer's Test|jstor=2974510|journal=The American Mathematical Monthly |volume=102 |issue=9 |pages=817–818 |doi=10.2307/2974510 }}{{cite web |url= http://sites.math.washington.edu/~morrow/336_12/papers/kyle.pdf|title= The mth Ratio Convergence Test and Other Unconventional Convergence Tests|last= Blackburn|first=Kyle |date=4 May 2012 |publisher=University of Washington College of Arts and Sciences |access-date= 27 November 2018 }}{{cite thesis |last1=Ďuriš |first1=František |date=2009 |title=Infinite series: Convergence tests |type=Bachelor's thesis |publisher=Katedra Informatiky, Fakulta Matematiky, Fyziky a Informatiky, Univerzita Komenského, Bratislava |url= http://www.dcs.fmph.uniba.sk/bakalarky/obhajene/Detail.php?id=90|access-date= 28 November 2018 }}{{cite arXiv |last1=Ďuriš |first1=František |date= 2 February 2018 |title=On Kummer's test of convergence and its relation to basic comparison tests |eprint=1612.05167 |class=math.HO }}

In all the tests below one assumes that Σan is a sum with positive an. These tests also may be applied to any series with a finite number of negative terms. Any such series may be written as:

:\sum_{n=1}^\infty a_n = \sum_{n=1}^N a_n+\sum_{n=N+1}^\infty a_n

where aN is the highest-indexed negative term. The first expression on the right is a partial sum which will be finite, and so the convergence of the entire series will be determined by the convergence properties of the second expression on the right, which may be re-indexed to form a series of all positive terms beginning at n=1.

Each test defines a test parameter (ρn) which specifies the behavior of that parameter needed to establish convergence or divergence. For each test, a weaker form of the test exists which will instead place restrictions upon limn->∞ρn.

All of the tests have regions in which they fail to describe the convergence properties of Σan. In fact, no convergence test can fully describe the convergence properties of the series. This is because if Σan is convergent, a second convergent series Σbn can be found which converges more slowly: i.e., it has the property that limn->∞ (bn/an) = ∞. Furthermore, if Σan is divergent, a second divergent series Σbn can be found which diverges more slowly: i.e., it has the property that limn->∞ (bn/an) = 0. Convergence tests essentially use the comparison test on some particular family of an, and fail for sequences which converge or diverge more slowly.

= De Morgan hierarchy =

Augustus De Morgan proposed a hierarchy of ratio-type tests

The ratio test parameters (\rho_n) below all generally involve terms of the form D_n a_n/a_{n+1}-D_{n+1}. This term may be multiplied by a_{n+1}/a_n to yield D_n-D_{n+1}a_{n+1}/a_n. This term can replace the former term in the definition of the test parameters and the conclusions drawn will remain the same. Accordingly, there will be no distinction drawn between references which use one or the other form of the test parameter.

==1. d'Alembert's ratio test==

The first test in the De Morgan hierarchy is the ratio test as described above.

==2. Raabe's test==

This extension is due to Joseph Ludwig Raabe. Define:

:\rho_n \equiv n\left(\frac{a_n}{a_{n+1}}-1\right)

(and some extra terms, see Ali, Blackburn, Feld, Duris (none), Duris2){{Clarify|date=September 2024}}

The series will:

  • Converge when there exists a c>1 such that \rho_n \ge c for all n>N.
  • Diverge when \rho_n \le 1 for all n>N.
  • Otherwise, the test is inconclusive.

For the limit version,{{mathworld|title=Raabe's Test|urlname=RaabesTest}} the series will:

  • Converge if \rho=\lim_{n\to\infty}\rho_n>1 (this includes the case ρ = ∞)
  • Diverge if \lim_{n\to\infty}\rho_n<1.
  • If ρ = 1, the test is inconclusive.

When the above limit does not exist, it may be possible to use limits superior and inferior. The series will:

  • Converge if \liminf_{n \to \infty} \rho_n > 1
  • Diverge if \limsup_{n \rightarrow \infty} \rho_n < 1
  • Otherwise, the test is inconclusive.

===Proof of Raabe's test===

Defining \rho_n \equiv n\left(\frac{a_n}{a_{n+1}}-1\right), we need not assume the limit exists; if \limsup\rho_n<1, then \sum a_n diverges, while if \liminf \rho_n>1 the sum converges.

The proof proceeds essentially by comparison with \sum1/n^R. Suppose first that \limsup\rho_n<1. Of course

if \limsup\rho_n<0 then a_{n+1}\ge a_n for large n, so the sum diverges; assume then that 0\le\limsup\rho_n<1. There exists R<1 such that \rho_n\le R for all n\ge N, which is to say that a_{n}/a_{n+1}\le \left(1+\frac Rn\right)\le e^{R/n}. Thus a_{n+1}\ge a_ne^{-R/n}, which implies that

a_{n+1}\ge a_Ne^{-R(1/N+\dots+1/n)}\ge ca_Ne^{-R\log(n)}=ca_N/n^R for n\ge N; since R<1 this shows that \sum a_n diverges.

The proof of the other half is entirely analogous, with most of the inequalities simply reversed. We need a preliminary inequality to use

in place of the simple 1+t that was used above: Fix R and N. Note that

\log\left(1+\frac Rn\right)=\frac Rn+O\left(\frac 1{n^2}\right). So \log\left(\left(1+\frac RN\right)\dots\left(1+\frac Rn\right)\right)

=R\left(\frac 1N+\dots+\frac 1n\right)+O(1)=R\log(n)+O(1); hence \left(1+\frac RN\right)\dots\left(1+\frac Rn\right)\ge cn^R.

Suppose now that \liminf\rho_n>1. Arguing as in the first paragraph, using the inequality established in the previous paragraph, we see that there exists R>1 such that a_{n+1}\le ca_Nn^{-R} for n\ge N; since R>1 this shows that \sum a_n converges.

== 3. Bertrand's test ==

This extension is due to Joseph Bertrand and Augustus De Morgan.

Defining:

:\rho_n \equiv n \ln n\left(\frac{a_n}{a_{n+1}}-1\right)-\ln n

Bertrand's test asserts that the series will:

  • Converge when there exists a c>1 such that \rho_n \ge c for all n>N.
  • Diverge when \rho_n \le 1 for all n>N.
  • Otherwise, the test is inconclusive.

For the limit version, the series will:

  • Converge if \rho=\lim_{n\to\infty}\rho_n>1 (this includes the case ρ = ∞)
  • Diverge if \lim_{n\to\infty}\rho_n<1.
  • If ρ = 1, the test is inconclusive.

When the above limit does not exist, it may be possible to use limits superior and inferior.{{mathworld|title=Bertrand's Test|urlname=BertrandsTest}} The series will:

  • Converge if \liminf \rho_n > 1
  • Diverge if \limsup \rho_n < 1
  • Otherwise, the test is inconclusive.

== 4. Extended Bertrand's test ==

This extension probably appeared at the first time by Margaret Martin in 1941.{{cite journal|url=https://www.ams.org/journals/bull/1941-47-06/S0002-9904-1941-07477-X/S0002-9904-1941-07477-X.pdf |last1=Martin |first1=Margaret |date=1941 |title=A sequence of limit tests for the convergence of series |journal=Bulletin of the American Mathematical Society |volume=47 |issue=6|pages=452–457 |doi=10.1090/S0002-9904-1941-07477-X |doi-access=free }} A short proof based on Kummer's test and without technical assumptions (such as existence of the limits, for example) was provided by Vyacheslav Abramov in 2019.{{cite journal|last1=Abramov |first1=Vyacheslav M. |date=May 2020 |title=Extension of the Bertrand–De Morgan test and its application |journal=The American Mathematical Monthly |volume=127 |issue=5 |pages=444–448 |doi=10.1080/00029890.2020.1722551 |arxiv=1901.05843 |s2cid=199552015 }}

Let K\geq1 be an integer, and let \ln_{(K)}(x) denote the Kth iterate of natural logarithm, i.e. \ln_{(1)}(x)=\ln (x) and for any 2\leq k\leq K,

\ln_{(k)}(x)=\ln_{(k-1)}(\ln (x)).

Suppose that the ratio a_n/a_{n+1}, when n is large, can be presented in the form

:\frac{a_n}{a_{n+1}}=1+\frac{1}{n}+\frac{1}{n}\sum_{i=1}^{K-1}\frac{1}{\prod_{k=1}^i\ln_{(k)}(n)}+\frac{\rho_n}{n\prod_{k=1}^K\ln_{(k)}(n)}, \quad K\geq1.

(The empty sum is assumed to be 0. With K=1, the test reduces to Bertrand's test.)

The value \rho_{n} can be presented explicitly in the form

:\rho_{n} = n\prod_{k=1}^K\ln_{(k)}(n)\left(\frac{a_n}{a_{n+1}}-1\right)-\sum_{j=1}^K\prod_{k=1}^j\ln_{(K-k+1)}(n).

Extended Bertrand's test asserts that the series

  • Converge when there exists a c>1 such that \rho_n \geq c for all n>N.
  • Diverge when \rho_n \leq 1 for all n>N.
  • Otherwise, the test is inconclusive.

For the limit version, the series

  • Converge if \rho=\lim_{n\to\infty}\rho_n>1 (this includes the case \rho = \infty)
  • Diverge if \lim_{n\to\infty}\rho_n<1.
  • If \rho = 1, the test is inconclusive.

When the above limit does not exist, it may be possible to use limits superior and inferior. The series

  • Converge if \liminf \rho_n > 1
  • Diverge if \limsup \rho_n < 1
  • Otherwise, the test is inconclusive.

For applications of Extended Bertrand's test see birth–death process.

== 5. Gauss's test ==

This extension is due to Carl Friedrich Gauss.

Assuming an > 0 and r > 1, if a bounded sequence Cn can be found such that for all n:

:\frac{a_n}{a_{n+1}}=1+\frac{\rho}{n}+\frac{C_n}{n^r}

then the series will:

  • Converge if \rho>1
  • Diverge if \rho \le 1

== 6. Kummer's test ==

This extension is due to Ernst Kummer.

Let ζn be an auxiliary sequence of positive constants. Define

:\rho_n \equiv \left(\zeta_n \frac{a_n}{a_{n+1}} - \zeta_{n+1}\right)

Kummer's test states that the series will:

  • Converge if there exists a c>0 such that \rho_n \ge c for all n>N. (Note this is not the same as saying \rho_n > 0)
  • Diverge if \rho_n \le 0 for all n>N and \sum_{n=1}^\infty 1/\zeta_n diverges.

For the limit version, the series will:{{mathworld|title=Kummer's Test|urlname=KummersTest}}

  • Converge if \lim_{n\to\infty}\rho_n>0 (this includes the case ρ = ∞)
  • Diverge if \lim_{n\to\infty}\rho_n<0 and \sum_{n=1}^\infty 1/\zeta_n diverges.
  • Otherwise the test is inconclusive

When the above limit does not exist, it may be possible to use limits superior and inferior. The series will

  • Converge if \liminf_{n \to \infty} \rho_n >0
  • Diverge if \limsup_{n \to \infty} \rho_n <0 and \sum 1/\zeta_n diverges.

=== Special cases ===

All of the tests in De Morgan's hierarchy except Gauss's test can easily be seen as special cases of Kummer's test:

  • For the ratio test, let ζn=1. Then:

::\rho_\text{Kummer} = \left(\frac{a_n}{a_{n+1}}-1\right) = 1/\rho_\text{Ratio}-1

  • For Raabe's test, let ζn=n. Then:

::\rho_\text{Kummer} = \left(n\frac{a_n}{a_{n+1}}-(n+1)\right) = \rho_\text{Raabe}-1

  • For Bertrand's test, let ζn=n ln(n). Then:

::\rho_\text{Kummer} = n \ln(n)\left(\frac{a_n}{a_{n+1}}\right)-(n+1)\ln(n+1)

:Using \ln(n+1)=\ln(n)+\ln(1+1/n) and approximating \ln(1+1/n)\rightarrow 1/n for large n, which is negligible compared to the other terms, \rho_\text{Kummer} may be written:

::\rho_\text{Kummer} = n \ln(n)\left(\frac{a_n}{a_{n+1}}-1\right)-\ln(n)-1 = \rho_\text{Bertrand}-1

  • For Extended Bertrand's test, let \zeta_n=n\prod_{k=1}^K\ln_{(k)}(n). From the Taylor series expansion for large n we arrive at the approximation

::\ln_{(k)}(n+1)=\ln_{(k)}(n)+\frac{1}{n\prod_{j=1}^{k-1}\ln_{(j)}(n)}+O\left(\frac{1}{n^2}\right),

where the empty product is assumed to be 1. Then,

::\rho_\text{Kummer} = n\prod_{k=1}^K\ln_{(k)}(n)\frac{a_n}{a_{n+1}}-(n+1)\left[\prod_{k=1}^K\left(\ln_{(k)}(n)+\frac{1}{n\prod_{j=1}^{k-1}\ln_{(j)}(n)}\right)\right]+o(1)

=n\prod_{k=1}^K\ln_{(k)}(n)\left(\frac{a_n}{a_{n+1}}-1\right)-\sum_{j=1}^K\prod_{k=1}^j\ln_{(K-k+1)}(n)-1+o(1).

Hence,

::\rho_\text{Kummer} = \rho_\text{Extended Bertrand}-1.

Note that for these four tests, the higher they are in the De Morgan hierarchy, the more slowly the 1/\zeta_n series diverges.

===Proof of Kummer's test===

If \rho_n>0 then fix a positive number 0<\delta<\rho_n. There exists

a natural number N such that for every n>N,

:\delta\leq\zeta_{n}\frac{a_{n}}{a_{n+1}}-\zeta_{n+1}.

Since a_{n+1}>0, for every n> N,

:0\leq \delta a_{n+1}\leq \zeta_{n}a_{n}-\zeta_{n+1}a_{n+1}.

In particular \zeta_{n+1}a_{n+1}\leq \zeta_{n}a_{n} for all n\geq N which means that starting from the index

N

the sequence \zeta_{n}a_{n}>0 is monotonically decreasing and

positive which in particular implies that it is bounded below by 0. Therefore, the limit

:\lim_{n\to\infty}\zeta_{n}a_{n}=L exists.

This implies that the positive telescoping series

:\sum_{n=1}^{\infty}\left(\zeta_{n}a_{n}-\zeta_{n+1}a_{n+1}\right) is convergent,

and since for all n>N,

:\delta a_{n+1}\leq \zeta_{n}a_{n}-\zeta_{n+1}a_{n+1}

by the direct comparison test for positive series, the series

\sum_{n=1}^{\infty}\delta a_{n+1} is convergent.

On the other hand, if \rho<0, then there is an N such that \zeta_n a_n is increasing for n>N. In particular, there exists an \epsilon>0 for which \zeta_n a_n>\epsilon for all n>N, and so \sum_n a_n=\sum_n \frac{a_n\zeta_n}{\zeta_n} diverges by comparison with \sum_n \frac \epsilon {\zeta_n}.

= Tong's modification of Kummer's test=

A new version of Kummer's test was established by Tong. See also {{cite arXiv |last1=Abramov |first1=Vyacheslav, M. |date= 21 June 2021 |title=A simple proof of Tong's theorem |eprint=2106.13808 |class=math.HO }}

for further discussions and new proofs. The provided modification of Kummer's theorem characterizes

all positive series, and the convergence or divergence can be formulated in the form of two necessary and sufficient conditions, one for convergence and another for divergence.

  • Series \sum_{n=1}^\infty a_n converges if and only if there exists a positive sequence \zeta_n, n=1,2,\dots, such that \zeta_n\frac{a_n}{a_{n+1}}-\zeta_{n+1}\geq c>0.
  • Series \sum_{n=1}^\infty a_n diverges if and only if there exists a positive sequence \zeta_n, n=1,2,\dots, such that \zeta_n\frac{a_n}{a_{n+1}}-\zeta_{n+1}\leq0, and \sum_{n=1}^{\infty}\frac{1}{\zeta_n}=\infty.

The first of these statements can be simplified as follows:

{{cite journal |last1=Abramov |first1=Vyacheslav M.|date=May 2022|title=Evaluating the sum of convergent positive series|url=http://elib.mi.sanu.ac.rs/files/journals/publ/131/publn131p41-53.pdf | journal=Publications de l'Institut Mathématique |series=Nouvelle Série |volume=111 |issue=125 |pages=41–53 |doi=10.2298/PIM2225041A|s2cid=237499616 }}

  • Series \sum_{n=1}^\infty a_n converges if and only if there exists a positive sequence \zeta_n, n=1,2,\dots, such that \zeta_n\frac{a_n}{a_{n+1}}-\zeta_{n+1}=1.

The second statement can be simplified similarly:

  • Series \sum_{n=1}^\infty a_n diverges if and only if there exists a positive sequence \zeta_n, n=1,2,\dots, such that \zeta_n\frac{a_n}{a_{n+1}}-\zeta_{n+1}=0, and \sum_{n=1}^{\infty}\frac{1}{\zeta_n}=\infty.

However, it becomes useless, since the condition \sum_{n=1}^{\infty}\frac{1}{\zeta_n}=\infty in this case reduces to the original claim \sum_{n=1}^{\infty}a_n=\infty.

= Frink's ratio test =

Another ratio test that can be set in the framework of Kummer's theorem was presented by Orrin Frink{{cite journal |last1=Frink |first1=Orrin |date=October 1948|title=A ratio test |journal=Bulletin of the American Mathematical Society |url=https://projecteuclid.org/journals/bulletin-of-the-american-mathematical-society/volume-54/issue-10/A-ratio-test/bams/1183512386.full |volume=54 |issue=10 |pages=953-953}} 1948.

Suppose a_n is a sequence in \mathbb{C}\setminus\{0\},

  • If \limsup_{n\rightarrow\infty}\Big(\frac
    a_{n+1}
    a_n
    \Big)^n<\frac1e , then the series \sum_na_n converges absolutely.
  • If there is N\in\mathbb{N} such that \Big(\frac
    a_{n+1}
    a_n
    \Big)^n\geq\frac1e for all n\geq N, then \sum_n|a_n| diverges.

This result reduces to a comparison of \sum_n|a_n| with a power series \sum_n n^{-p}, and can be seen to be related to Raabe's test.{{cite journal |date=1949|last1=Stark |first1=Marceli |title=On the ratio test of Frink |journal=Colloquium Mathematicum | volume=2 |issue=1 |pages=46-47 }}

= Ali's second ratio test =

A more refined ratio test is the second ratio test:

For a_n>0 define:

L_0\equiv\lim_{n\rightarrow \infty} \frac{a_{2n}}{a_n}
L_1\equiv\lim_{n\rightarrow \infty} \frac{a_{2n+1}}{a_n}
L\equiv\max(L_0,L_1)

By the second ratio test, the series will:

  • Converge if L<\frac{1}{2}
  • Diverge if L>\frac{1}{2}
  • If L=\frac{1}{2} then the test is inconclusive.

If the above limits do not exist, it may be possible to use the limits superior and inferior. Define:

L_0\equiv\limsup_{n\rightarrow \infty} \frac{a_{2n}}{a_n}

|

|L_1\equiv\limsup_{n\rightarrow \infty} \frac{a_{2n+1}}{a_n}

\ell_0\equiv\liminf_{n\rightarrow \infty} \frac{a_{2n}}{a_n}

|

|\ell_1\equiv\liminf_{n\rightarrow \infty} \frac{a_{2n+1}}{a_n}

L\equiv\max(L_0,L_1)

|

|\ell\equiv\min(\ell_0,\ell_1)

Then the series will:

  • Converge if L<\frac{1}{2}
  • Diverge if \ell>\frac{1}{2}
  • If \ell \le \frac{1}{2} \le L then the test is inconclusive.

= Ali's ''m''th ratio test =

This test is a direct extension of the second ratio test. For 0\leq k\leq m-1, and positive a_n define:

L_k\equiv\lim_{n\rightarrow \infty} \frac{a_{mn+k}}{a_n}
L\equiv\max(L_0,L_1,\ldots,L_{m-1})

By the mth ratio test, the series will:

  • Converge if L<\frac{1}{m}
  • Diverge if L>\frac{1}{m}
  • If L=\frac{1}{m} then the test is inconclusive.

If the above limits do not exist, it may be possible to use the limits superior and inferior. For 0\leq k\leq m-1 define:

L_k\equiv\limsup_{n\rightarrow \infty} \frac{a_{mn+k}}{a_n}
\ell_k\equiv\liminf_{n\rightarrow \infty} \frac{a_{mn+k}}{a_n}
L\equiv\max(L_0,L_1,\ldots,L_{m-1})

|

|\ell\equiv\min(\ell_0,\ell_1,\ldots,\ell_{m-1})

Then the series will:

  • Converge if L<\frac{1}{m}
  • Diverge if \ell>\frac{1}{m}
  • If \ell \leq \frac{1}{m} \leq L, then the test is inconclusive.

= Ali--Deutsche Cohen φ-ratio test =

This test is an extension of the mth ratio test.{{cite journal|url=https://www.ems-ph.org/journals/show_abstract.php?issn=0013-6018&vol=67&iss=4&rank=2|last1=Ali |first1=Sayel |last2=Cohen |first2=Marion Deutsche |date=2012 |title=phi-ratio tests |journal=Elemente der Mathematik |volume=67 |issue= 4|pages=164–168 |doi=10.4171/EM/206 |doi-access=free }}

Assume that the sequence a_n is a positive decreasing sequence.

Let \varphi:\mathbb{Z}^+\to\mathbb{Z}^+ be such that \lim_{n\to\infty}\frac{n}{\varphi(n)} exists. Denote \alpha=\lim_{n\to\infty}\frac{n}{\varphi(n)}, and assume 0<\alpha<1.

Assume also that \lim_{n\to\infty}\frac{a_{\varphi(n)}}{a_n}=L.

Then the series will:

  • Converge if L<\alpha
  • Diverge if L>\alpha
  • If L=\alpha, then the test is inconclusive.

See also

Footnotes

{{reflist}}

References

  • {{citation | last1=d'Alembert| first1=J.|author-link=Jean le Rond d'Alembert| year=1768 | title=Opuscules |volume=V|pages=171–183| url=http://gallica.bnf.fr/ark:/12148/bpt6k62424s.image.f192}}.
  • {{Citation | last1=Apostol | first1=Tom M. | author1-link=Tom M. Apostol | title=Mathematical analysis | publisher=Addison-Wesley | edition=2nd | isbn=978-0-201-00288-1 | year=1974}}: §8.14.
  • {{citation|last=Knopp|first=Konrad|title=Infinite Sequences and Series|location=New York |publisher=Dover Publications|year=1956|isbn=978-0-486-60153-3|bibcode=1956iss..book.....K}}: §3.3, 5.4.
  • {{citation|last=Rudin|first=Walter|author-link=Walter Rudin|title=Principles of Mathematical Analysis|edition=3rd|publisher=McGraw-Hill, Inc.|location=New York|year=1976|isbn=978-0-07-054235-8}}: §3.34.
  • {{springer|title=Bertrand criterion|id=p/b015780}}
  • {{springer|title=Gauss criterion|id=p/g043420}}
  • {{springer|title=Kummer criterion|id=p/k055950}}
  • {{citation|last2=Whittaker|first2=E. T.|last1=Watson|first1=G. N.|title=A Course in Modern Analysis|edition=4th|publisher=Cambridge University Press|year=1963|isbn=978-0-521-58807-2}}: §2.36, 2.37.

{{Calculus topics}}

Category:Convergence tests

Category:Articles containing proofs

it:Criteri di convergenza#Criterio del rapporto (o di d'Alembert)