Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Possible Duplicate:
Proving that the sequence $F_{n}(x)=\sum\limits_{k=1}^{n} \frac{\sin{kx}}{k}$ is boundedly convergent on $\mathbb{R}$

From Stewart, we cannot find a calculus 2 easy way to prove this:

$$\sum^{\infty}_{n=1}\frac{\sin[n]}{n}=\frac{1}{2}(\pi-1)$$

share|improve this question

marked as duplicate by Marvis, Austin Mohr, TMM, Cameron Buie, Arkamis Nov 2 '12 at 21:02

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

    
What's $[n]$ suppose to be? perhaps the question has a typo? –  Jean-Sébastien Nov 2 '12 at 19:05
    
Kerry just means $\sin(n)$ –  user17762 Nov 2 '12 at 19:12
    
@BabakSorouh: But floor of a natural would be quite redundant. –  Hagen von Eitzen Nov 2 '12 at 19:12
    
Yeah floor or $n$ is just $n$, but this may just be it because sum of $\sin(n)/n$ is $1/2(\pi-1)$ –  Jean-Sébastien Nov 2 '12 at 19:16
1  
Also look here math.stackexchange.com/questions/161960/… –  user17762 Nov 2 '12 at 19:25
show 1 more comment

1 Answer 1

$\sum\limits^{\infty}_{n=1}\dfrac{\sin{n\theta}}{n}$ is the Fourier series for $f(\theta)=\dfrac{\pi-\theta}{2}, \;\; 0<\theta<2\pi,$ and converges uniformly on every closed interval $[\alpha, \beta], \;\; 0<\alpha<\beta<2\pi$ by Dirichlet's test.

share|improve this answer
add comment

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