MHB Trigonometric sum with a product as the argument

Greg
Gold Member
MHB
Messages
1,377
Reaction score
0
Prove

$$\sum_{n=0}^N\cos(nx)=\csc\left(\dfrac x2\right)\sin\left(\dfrac{(N+1)x}{2}\right)\cos\left(\dfrac{Nx}{2}\right)$$

I've tried working from the RHS with various identities but haven't managed to come up with anything that works. I suspect this problem involves some trigonometry that I don't already know; if someone could post a solution or offer guidance on how to get started I'd be grateful. :)
 
Mathematics news on Phys.org
greg1313 said:
Prove

$$\sum_{n=0}^N\cos(nx)=\csc\left(\dfrac x2\right)\sin\left(\dfrac{(N+1)x}{2}\right)\cos\left(\dfrac{Nx}{2}\right)$$

I've tried working from the RHS with various identities but haven't managed to come up with anything that works. I suspect this problem involves some trigonometry that I don't already know; if someone could post a solution or offer guidance on how to get started I'd be grateful. :)

Let $S= \sum_{n=0}^N\cos(nx)$
multiply by $2 \sin \frac{x}{2}$ to get the reason I want it to be reduced to telesopic sum) ( sin x/2 for telescopic sum and 2 times to avoid fraction in result

$2S\sin \frac{x}{2} \sum_{n=0}^N\cos(nx) 2 \sin \frac{x}{2}$

or $2S\sin \frac{x}{2} = \sum_{n=0}^N(\sin(nx + \frac{x}{2}) - \sin(nx - \frac{x}{2}))$

the above can be added as it is telecopic sum and then reduced to RHS
 
That does it! Thank you very much, kaliprasad.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Replies
3
Views
2K
Replies
2
Views
2K
Replies
2
Views
1K
Replies
2
Views
2K
Replies
9
Views
2K
Back
Top