00:03
Okay, folks, so today we're going to be looking at the following question.
00:09
So we're looking at a finite fourier series of a function.
00:14
So that is, we're expressing the function in this form.
00:19
And we're trying to find a1, a2, and a .n.
00:22
So we're trying to find the coefficients.
00:25
Okay, so the way we're going to do this is we're going to use these facts.
00:32
These facts are actually proven in another question.
00:36
So we're not going to prove them here because that's not really what this question is all about, but we're going to make use of them.
00:43
So then all we need to do is we multiply both sides of this equation by sine of mx.
00:53
So let's do that.
00:54
So we have sine of mx multiplied by f of x, and then that will equal to a1, sine x, sine mx, plus a2, sine 2x, sign, mx, all the way up until a .n, sine nx, sign mx.
01:27
Then we integrate both sides with respect, then we integrate both sides from pi to negative pi...