Intereting Posts

Finding the $n$-th derivatives of $x^n \ln x$ and $\frac{\ln x}{x}$.
Does the series $\sum_{n=1}^{\infty}|x|^\sqrt n$ converge pointwise? If it then what would be the sum?
Determining Laurent Series
Can the general septic be solved by infinitely nested radicals?
Is ergodic markov chain both irreducible and aperiodic or just irreducible?
Points of discontinuity of a bijective function $f:\mathbb{R} \to [0,\infty)$
Does $\wp(A \cap B) = \wp(A) \cap \wp(B)$ hold? How to prove it?
Showing the following sequence of functions are uniformly convergent
When can a function not be factored?
How to “abstractly” differentiate function, expressed in terms of itself
Is $\mathbb Z$ Euclidean under some other norm?
If the dot product between two vectors is $0$, are the two linearly independent?
Show that $\frac{(3^{77}-1)}{2}$ is odd and composite
Group where every element is order 2
Characterization of the Subsets of Euclidean Space which are Homeomorphic to the Space Itself

$$f(n)=\sum_{i=1}^n\frac{1}{i}$$

diverges slower than

$$g(n)=\sum_{i=1}^n\frac{1}{\sqrt{i}}$$

, by which I mean $\lim_{n\rightarrow \infty}(g(n)-f(n))=\infty$. Similarly, $\ln(n)$ diverges as fast as $f(n)$, as $\lim_{n \rightarrow \infty}(f(n)-\ln(n))=\gamma$, so they ‘diverge at the same speed’.

I think there are an infinite number of ‘speeds of divergence’ (for example, $\sum_{i=1}^n\frac{1}{i^k}$ diverge at different rates for different $k<1$). However, is there a slowest speed of divergence?

That is, does there exist a divergent series, $s(n)$, such that for any other divergent series $S(n)$, the limit $\lim_{n \rightarrow \infty}(S(n)-s(n))=\infty$ or $=k$? If so, are there an infinite number of these slowest series?

- Positive integers $k = p_{1}^{r_{1}} \cdots p_{n}^{r_{n}} > 1$ satisfying $\sum_{i = 1}^{n} p_{i}^{-r_{i}} < 1$
- An extrasensory perception strategy ðŸ™‚
- Calculate the leading order asymptotic behaviour (with two maxima)
- Are there straightforward methods to tell which function has fastest asymptotic growth without a calculator?
- What's the most efficient way to mow a lawn?
- Asymptotic behavior of system of differential equations

- Asymptotic behavior of $\sum\limits_{k=2}^{m}\frac{1}{\ln(k!)}$
- A question on the Stirling approximation, and $\log(n!)$
- Comparing average values of an arithmetic function
- Divergent series and $p$-adics
- When do regularization methods for divergent series disagree?
- Strange Recurrence: What is it asymptotic to?
- Limit of $\sqrt{(x+1)…(x+n)} - x$ as $x \to +\infty$
- Sum of infinite divergent series
- Using Limits to Determine Big-O, Big-Omega, and Big-Theta
- Asymptotic expansion of the complete elliptic integral of the first kind

The proof in the paper “Neither a worst convergent series nor a best divergent series exists” by J. Marshall Ash that I referenced above is so nice that I wanted to reproduce it below before it gets lost on the Internet.

$\bf{Theorem: }$ Let $\sum_{n=1}^{\infty} c_n$ be any convergent series with positive terms. Then, there exists a convergent series $\sum_{n=1}^{\infty} C_n$ with much bigger terms in the sense that $\lim_{n\rightarrow\infty} C_n/c_n = \infty$. Similarly, for any divergent series $\sum_{n=1}^{\infty} D_n$ with positive terms, there exists a divergent series $\sum_{n=2}^{\infty} d_n$ with much smaller terms in the sense that $\lim_{n\rightarrow\infty} \frac{d_n}{D_n} = 0$.

$\bf{Proof: }$ For each $n$, let $r_n = c_n + c_{n+1}+\cdots$ and $s_n = D_1 + \cdots + D_n$. Letting $C_n = \frac{c_n}{\sqrt{r_n}}$ and $d_n = \frac{D_n}{s_{n-1}}$, then $\lim_{n\rightarrow\infty} \frac{C_n}{c_n} = \lim_{n\rightarrow\infty} \frac{1}{\sqrt{r_n}}=\infty$ and $\lim_{n\rightarrow\infty} \frac{d_n}{D_n} = \lim_{n\rightarrow\infty} \frac{1}{s_{n-1}} = 0$, so it only remains to check $\sum C_n$ converges and that $\sum d_n$ diverges. To see that this is indeed the case, simply write $C_n = (1/\sqrt{r_n})(r_n-r_{n+1})$ and $d_n = 1/s_{n-1}(s_n-s_{n-1})$; observe that $\int_0^{r_1} 1/\sqrt{x}dx<\infty$ and $\int_{s_1}^{\infty} 1/xdx = \infty$; and note that the $n$th term of series $\sum C_n$ is the area of the gray rectangle in Figure 1a, while the $n$th term of series $\sum d_n$ is the area of the gray rectangle in Figure 1b.

Just to expand on Raymond Manzoni and to partially answer your question with one of the coolest things I ever learned in my early childhood (as a math undergrad),

consider the family of series,

$$\begin{eqnarray}

\sum \frac{1}{n}&=&\infty \\

\sum \frac{1}{n\ln(n)}&=&\infty \\

\sum \frac{1}{n\ln(n)\ln(\ln(n))}&=&\infty

\end{eqnarray}$$

and so on. They all diverge and you can use the integral test to easily prove this. But here is the kicker. The third series actually requires a googolplex numbers of terms before the partial terms exceed 10. It is only natural that if natural log is a slowly increasing function, then log of log diverges even slower.

On the other hand, consider the family,

$$\begin{eqnarray}

\sum \frac{1}{n^2}&<&\infty \\

\sum \frac{1}{n(\ln(n))^2}&<&\infty \\

\sum \frac{1}{n\ln(n)(\ln(\ln(n)))^2}=38.43…&<&\infty

\end{eqnarray}$$

all converge which can be easily verified easily again using the integral test. But the third series converges so slowly that it requires $10^{3.14\times10^{86}}$ terms before obtaining two digit accuracy presented. Talking about getting closer to the “boundary” between convergence and divergence. Using this you can easily make up a series to converge or to diverge as slow as you want. So to answer your question, no there is no such thing as “the slowest diverging series”. Any slowly diverging series you pick, we can come up with one diverging even slower.

Reference:

Zwillinger, D. (Ed.). CRC Standard Mathematical Tables and Formulae, 30th

ed. Boca Raton, FL: CRC Press, 1996.

The Cauchy condensation test allows to find an infinity of slower divergent series :

- $\displaystyle \sum \frac 1n\;$ behaves like $\;\displaystyle \sum 2^n \frac 1{2^n}=\sum 1\;$ which diverges
- $\displaystyle \sum \frac 1{n\ln(n)}\;$ behaves like $\;\displaystyle \sum 2^n \frac 1{2^n\;n}=\sum \frac 1n\;$ which diverges
- $\displaystyle \sum \frac 1{n\ln(n)\ln(\ln(n))}\;$ behaves like $\;\displaystyle \sum 2^n \frac 1{2^n\;n\ln(n)}=\sum \frac 1{n\ln(n)}\;$ which diverges… QED.

(from Chaitin’s book ‘Algorithmic Information Theory’)

If you have $(a_n)_{n\in\mathbb{N}}$ a divergent series:

$$\sum_{n=0}^N a_n \xrightarrow[N\to\infty]{}\infty$$ with $a_n > 0$ for all $n\in\mathbb{N}$), consider the series with term $$b_n\stackrel{\rm{}def}{=}\frac{a_n}{\sum_{k=0}^n a_k}.$$

One can show that the series $\sum b_n$ diverges.

Let A(n) be an Ackermann function, let $1_{A} $

be its indicator function (i.e $1_{A} (x)$=1 if A(n)=x for some n ; 0 otherwise). Then $\sum1_{A}^{}$ diverges. A one that diverges faster but more interesting is $ s(0)=1, s(n+1)= s(n)+ \frac{1}{p_{n}s(n)}$ where $p_{n}$ is the nth prime.

Suppose there is a slowest-diverging series. Call it $(a_n)$.

Define $A(n)=\sum a_n$. Thus, $A(n)$ is a slowly-diverging function.

Define $B(n)=\ln A(n)$. Thus, $B(n)$ diverges even slower than $A(n)$.

Define $b_n=B(n)-B(n-1)$. Thus, $(b_n)$ is an even slower diverging series. Contradiction.

- Closed subsets of compact sets are compact
- What is the use of moments in statistics
- Ideal generated by 3 and $1+\sqrt{-5}$ is not a principal ideal in the ring $\Bbb Z$
- Endomorphism Rings of finite length Modules are semiprimary
- Find the integral closure of an integral domain in its field of fractions
- A matrix is similar to its transpose
- Does $\sum_{n\ge1} \sin (\pi \sqrt{n^2+1}) $ converge/diverge?
- PDE $(\partial_{tt}+a\partial_t-b\nabla^2)f(r,t)=0$
- Prove that the integral operator has no eigenvalues
- Is there a function $f\colon\mathbb{R}\to\mathbb{R}$ such that every non-empty open interval is mapped onto $\mathbb{R}$?
- Is the empty set an open ball in a metric space?
- Is an ideal which is maximal with respect to the property that it consists of zero divisors necessarily prime?
- circles, power of point, cross ratios
- n tasks assigned to n computers, what is the EX value of a computer getting 5 or more tasks?
- Proving there are infinitely many pairs of square-full consecutive integers