# Does |n2cosn||n^2 \cos n| diverge to +∞+\infty?

I was recently exposed to the problem of deciding whether

where the limit is taken over the integers. As $|\cos n|$ oscillates throughout the interval $[0,1]$, it seems plausible that every real number ought to be a limit point of this sequence. But to show the limit doesn’t exist, it’s enough to show the sequence is less than $2$ infinitely often, and this can be done with continued fractions: we can find arbitrarily large $p$ and $q$ with $q$ odd such that

which implies

making $p$ a good approximation of $\pi/2$ modulo $\pi$, and thus

This method fails if we consider instead the sequence $n^{1+\epsilon} \cos n$, since the final inequality is an increasing function of $n$. In fact, a heuristic statistical argument suggests that

really does hold: imagine the $n$'s are actually uniformly randomly selected from $[0, \pi]$, there is a roughly $2p/\pi$ chance that $|\cos n| < p$. For any positive constant $B$, the expected number of terms of $n^{1 + \epsilon} |\cos n|$ which are less than $B$ is

which, in particular, is finite.

Of course, this is just heuristic. Does anyone know of a proof or disproof of the conjecture

for positive real numbers $\epsilon$, where the limit is taken only over integers?

EDIT: Since there have been a few erroneous answers, I'll point out that observing $|\cos n|$ oscillates from 0 to 1 is not enough to show the limit does not exist. Consider the sequence $g(n)$ defined by

• $g(0) = 1$
• $g(n) = \max\{ g(n-1), n / |\cos n| \} + 1$

Then $g(n)$ is an unbounded increasing sequence such that $|g(n) \cos n| > n$ for all $n$, and thus

Roughly speaking, $g(n)$ diverges to $+\infty$ faster than $n \pmod \pi$ can approximate $\pi / 2$.

The question of this post is whether $n^2$ (or $n^{1 + \epsilon}$) also diverges to $+\infty$ fast enough.

(editor's note: I've moved the original second section to the top, since the original first section answered the wrong question)

Edit: I missed the exponent of $2$.

Obviously $(6)$ implies, $\displaystyle\limsup_{n\to\infty}|n^2\cos(n)|=\infty$. However, evaluating $\displaystyle\liminf_{n\to\infty}|n^2\cos(n)|$ is much more difficult. A difficult result is that the irrationality measure of $\frac\pi2$ is less than $8.01604539$. This means that for all but a finite number of rational approximations,

To make the estimate in $(3)$ yield an infinite limit, we would need to show that the irrationality measure of $\frac\pi2$ is less than $3$. Wikipedia says that "The exact irrationality measure of $\pi$ is not known, however in $2008$ Salikhov has given the approximation $7.6063$." This would mean that $\displaystyle\lim_{n\to\infty}|n^2\cos(n)|$ does not exist.

As was shown in this answer, we can find an infinite number of continued fraction approximations of $\frac\pi2=\frac{p}{q}$ with $q$ odd and so that

For approximations as in $(1)$, we have, by Maclaurin Expansion,

Taking $\liminf$, we get

In a similar fashion, we can find an infinite number of continued fraction approximations of $\pi=\frac{p}{q}$ so that

For approximations as in $(4)$, we have, by Maclaurin Expansion,

Taking $\limsup$, we get

Thus, $\displaystyle\liminf_{n\to\infty}|n\cos(n)|\le\frac\pi2$ and $\displaystyle\limsup_{n\to\infty}|n\cos(n)|=\infty$. Therefore, the limit does not exist.