Thursday, 20 March 2014

Sum of a Series that is relevant to Fourier Transform



I'm currently studying for a test that envelops both Fourier transforms and Fourier Series. This exercise is meant to build knowledge and give me a better understanding of the basics, however I think I might be missing some property of the sum of a series because I am stuck.




The problem is the following:



Be f(t)=n=0bnsin(nt) where $0

Okay, using euler's formula for sin(nt) and manipulation of the summation variables I arrived at the following expression:



f(t)=n=(bnbn)2ieint

and I feel that those b's look a lot like some kind of hyperbolic euler identity, but I am unsure whether that is a good road to go to, or wheter I should have went another way entirely from the beggining.



The answer at the end states that f(t)=bsin(t)12bcos(t)+b2, if that helps anyone.



Answer



f(t)=n=0bnsin(nt)


Converting to exponential:
bnsin(nt)=12ibn(einteint)=12i[(beit)n(beit)n]=

Calculating the sums we have
n=0(beit)n=11beit;n=0(beit)n=11beit

and then
 = 12i(11beit11beit) = 12i1beit1+beit(1beit)(1beit)=

=12ibeitbeit(1beit)(1beit)=bsintb2b(eit+eit)+1=bsintb22bcost+1




Hope this helps


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...