I've had no luck with this one. None of the convergence tests pop into mind.

I tried looking at it in this form $\sum \sin n\frac{1+\frac{1}{2}+\cdots+\frac{1}{n}}{n}$ and apply Dirichlets test. I know that $\frac{1+\frac{1}{2}+\cdots+\frac{1}{n}}{n} \to 0$ but not sure if it's decreasing.

Regarding absolute convergence, I tried:

$$|\sin n\frac{1+\frac{1}{2}+\cdots+\frac{1}{n}}{n}|\geq \sin^2 n\frac{1+\frac{1}{2}+\cdots+\frac{1}{n}}{n}=$$

$$=\frac{1}{2}\frac{1+\frac{1}{2}+\cdots+\frac{1}{n}}{n}-\frac{1}{2}\cos 2n\frac{1+\frac{1}{2}+\cdots+\frac{1}{n}}{n}$$

But again I'm stuck with $\cos 2n\frac{1+\frac{1}{2}+\cdots+\frac{1}{n}}{n}$.
Assuming it converges then I've shown that $\sum \sin n\frac{1+\frac{1}{2}+\cdots+\frac{1}{n}}{n}$ doesn't converge absolutely.

  • $\begingroup$ Perhaps there's something useful to be done with the fact that $\log n<1+\frac{1}{2}+\cdots+\frac{1}{n}<\log n+1$? $\endgroup$
    – Isaac
    Dec 31 '10 at 11:14
  • $\begingroup$ Also, Mathematica seems to think that it does in fact converge, giving a result of 1/2 I E^-I (E^I EulerGamma Log[1-E^I]-E^I EulerGamma Log[(-1+E^I) E^-I]-(Hypergeometric2F1Regularized^(0,0,1,0))[1,1,2,E^-I]+E^(2 I) (Hypergeometric2F1Regularized^(0,0,1,0))[1,1,2,E^I]), which is approximately $1.05895$. $\endgroup$
    – Isaac
    Dec 31 '10 at 11:19
  • $\begingroup$ Just a comment, $$\sum_{n=1}^{\infty} \frac{\sin n}{n} = \frac{\pi}{2} - \frac{1}{2}$$Maybe this might help... $\endgroup$ Dec 31 '10 at 11:38
  • $\begingroup$ My older copy (5.2) of Mathematica yields the result $$\frac{i}{2}\left(\mathrm{Li}_2\left(1+\frac1{\exp(i)-1}\right)-\mathrm{Li}_2\left(\frac1{1-\exp(i)}\right)\right)$$ where $\mathrm{Li}_2(x)$ is the dilogarithm. Numerically, it agrees with @Isaac's result. I am away from my refs so I cannot analytically prove the equivalence of the two. $\endgroup$ Dec 31 '10 at 11:53

The sequence $$a_n=\frac{1+\frac{1}{2}+\cdots +\frac{1}{n}}{n}$$ is decreasing because proving $a_{n+1}<a_n$ reduces to proving $$\frac{n}{n+1}<1+\frac{1}{2}+\cdots +\frac{1}{n}$$ which is clearly true.

Also the sums $$s_k=\sum_{n=1}^k \sin n$$ are bounded. (This can be easily proved by writing $\sin n$ in its complex form and using finite geometric formula; in fact $|s_k|$ are bounded by $\frac{1}{|1-e^i|}+\frac{1}{|1-e^{-i}|}$).

Furthermore $a_n\to 0$ as $n\to \infty$ because $1+\frac{1}{2}+\cdots +\frac{1}{n}\approx \log n$.

So the series converges by Dirichlet test. As Shai shows below, the convergence is not absolute.

  • $\begingroup$ Are you sure about that first claim? I'm convinced that sequence is indeed decreasing, but I don't see how it reduces to the inequality you have there. $\endgroup$ Nov 13 '11 at 16:24
  • $\begingroup$ Just write out $a_{n+1}<a_n$ and multiply both sides by $n(n+1)$. $\endgroup$
    – TCL
    Nov 13 '11 at 16:32
  • $\begingroup$ Oh yeah. Thanks. =) $\endgroup$ Nov 13 '11 at 16:44

To show that the series does not converge absolutely, it suffices to show that $\sum\nolimits_{n = 1}^\infty {|\frac{{\sin n}}{n}|} = \infty $. For this purpose, see this: the paragraph starting with "It's not absolutely convergent" as well as the one starting with "This series exhibits rather irregular behaviour" (two different approaches).

  • $\begingroup$ How does one show the two inequalities needed on the page you referenced? $\min(|\sin(n)|,|\sin(n+1)|) \geq m > 0$ and $|\sin(x)| + |\sin(x-1)| \geq \sin(1)$ $\endgroup$
    – admchrch
    Mar 26 '11 at 22:00
  • $\begingroup$ @admchrch: thanks for pointing this out. $\endgroup$
    – Shai Covo
    Mar 27 '11 at 20:58
  • $\begingroup$ @admchrch: For the first, there should have been $\max$ instead of $\min$; for the second, at least it can be confirmed by plotting the difference $|\sin(x)| + |\sin(x-1)| - \sin(1)$. $\endgroup$
    – Shai Covo
    Mar 27 '11 at 21:25
  • $\begingroup$ The method that uses the first bound is invalid if it is max instead of min. I guess the second can be proved by considering the functions $\sin(x) + \sin(x-1) - \sin(1)$, $\sin(x) - \sin(x-1) - \sin(1)$, $-\sin(x) + \sin(x-1) - \sin(1)$, and $-\sin(x) - \sin(x-1) - \sin(1)$ in appropriate regions and using calculus. A more elegant method of proof does not occur to me. $\endgroup$
    – admchrch
    Mar 28 '11 at 3:48
  • 1
    $\begingroup$ Link's down.... $\endgroup$ Jun 21 '18 at 5:37

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.