Jump to content

Science:Math Exam Resources/Courses/MATH307/April 2013/Question Section 202 06 (b)/Solution 1

From UBC Wiki

From part (a) the coefficients of the Fourier series were found to be:

c0=12cn={0if n is even, n=0iπnif n is odd

This yields: f(x)=c0+n odd, n=iπne2πinx

Parseval’s Theorem states:

ab|f(x)|2=n=|cn|2

Computing the left side:

LHS=ab|f(x)|2=01/212=12

Computing the right side:

RHS=n=|cn|2=(12)2+n odd, n=11π2n2+n odd, n=11π2(n)2

Here the sum of odds from to was split into two sums from 1 to and -1 to . It can be observed that the second sum is the same as the first where n=n and since (n)2=n2, these two sums are equivalent.

RHS=(12)2+2(n odd, n=11π2n2)

To get the expression that we want we can make a substitution of variables to remove the odd restriction in our sum. Let n=2k+1. It can be seen that for k=0,1,2,3,..., n will always be odd.

Note: Making this substitution will change summation range.

At n=1,1=2k+1k=0. So the new summation range will be k=0 to .

RHS=14+2(k=01π2(2k+1)2)

Using the left side that was computed above we get:

12=14+2π2(k=01(2k+1)2)

Rearranging this to get the final answer:

k=01(2k+1)2=π28