4

Fourier series
Exercises 4.2.9
1(a)
a
0
=
1

__
0

dt +
_

0
tdt
_
=
1

_
(t)
0

+
_
t
2
2
_

0
_
=
1

2
+

2
2
_
=

2
a
n
=
1

__
0

cos ntdt +
_

0
t cos ntdt
_
=
1

_
_

n
sin nt
0

+
_
t
n
sin nt +
1
n
2
cos nt

0
_
=
1
n
2
(cos n 1) =
_

2
n
2
, n odd
0, n even
b
n
=
1

__
0

sin ntdt +
_

0
t sin ntdt
_
=
1

_
_

n
cos nt
0

+
_

t
n
cos nt +
1
n
2
sin nt

0
_
=
1
n
(1 2 cos n) =
_

_
3
n
, n odd

1
n
, n even
Thus the Fourier expansion of f(t) is
f(t) =

4
+

n odd
_

2
n
2
_
cos nt +

n odd
3
n
sin nt

n even
1
n
sin nt
i.e. f(t) =

4

2

n=1
cos(2n 1)t
(2 1)
2
+ 3

n=1
sin(2n 1)t
(2n 1)

n=1
sin 2nt
2n
c
Pearson Education Limited 2004
192 Glyn James: Advanced Modern Engineering Mathematics, Third edition
1(b)
a
0
=
1

_
0

(t +)dt =
1

_
t
2
2
+t
_
0

=

2
a
n
=
1

_
0

(t +) cos ntdt =
1

_
(t +)
sin nt
n
+
cos nt
n
2
_
0

=
1
n
2
(1 cos n) =
_
0, n even
2
n
2
, n odd
b
n
=
1

_
0

(t +) sin ntdt =
1

_
(t +)
cos nt
n
+
sin nt
n
2
_
0

=
1
n
Thus the Fourier expansion of f(t) is
f(t) =

4
+

n odd
2
n
2
cos nt

n=1
1
n
sin nt
i.e. f(t) =

4
+
2

n=1
cos(2n 1)t
(2n 1)
2

n=1
sin nt
n
1(c) From its graph we see that f(t) is an odd function so it has Fourier
expansion
f(t) =

n=1
b
n
sin nt
with
b
n
=
2

_

0
f(t) sin nt =
2

_

0
_
1
t

_
sin ntdt
=
2

1
n
_
1
t

_
cos nt
1
n
2
sin nt
_

0
=
2
n
Thus the Fourier expansion of f(t) is
f(t) =
2

n=1
sin nt
n
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 193
1(d) From its graph f(t) is seen to be an even function so its Fourier
expansion is
f(t) =
a
0
2
+

n=1
a
n
cos nt
with
a
0
=
2

_

0
f(t)dt =
2

_
/2
0
2 cos tdt =
2

[2 sin t]
/2
0
=
4

a
n
=
2

_

0
f(t) cos ntdt =
2

_
/2
0
2 cos t cos ntdt
=
2

_
/2
0
[cos(n + 1)t + cos(n 1)t]dt
=
2

_
sin(n + 1)t
(n + 1)
+
sin(n 1)t
(n 1)
_
/2
0
=
2

_
1
(n + 1)
sin(n + 1)

2
+
1
(n 1)
sin(n 1)

2
_
=
_

_
0, n odd

1
(n
2
1)
, n = 4, 8, 12, . . .
4

1
(n
2
1)
, n = 2, 6, 10, . . .
Thus the Fourier expansion of f(t) is
f(t) =
2

+
4

n=1
(1)
n+1
cos 2nt
4n
2
1
1(e)
a
0
=
1

cos
t
2
dt =
1

_
2 sin
t
2
_

=
4

a
n
=
1

cos
t
2
cos ntdt =
1
2
_

_
cos(n +
1
2
)t + cos(n
1
2
)t
_
dt
=
2
2
_
2
(2n + 1)
sin(n +
1
2
) +
2
(2n 1)
sin(n
1
2
)
_
=
_

_
4
(4n
2
1)
, n = 1, 3, 5, . . .

4
(4n
2
1)
, n = 2, 4, 6, . . .
b
n
= 0
c
Pearson Education Limited 2004
194 Glyn James: Advanced Modern Engineering Mathematics, Third edition
Thus the Fourier expansion of f(t) is
f(t) =
2

+
4

n=1
(1)
n+1
cos nt
(4n
2
1)
1(f ) Since f(t) is an even function it has Fourier expansion
f(t) =
a
0
2
+

n=1
a
n
cos nt
with
a
0
=
2

_

0
| t | dt =
2

_

0
tdt =
a
n
=
2

_

0
t cos ntdt =
2

_
t
n
sin nt +
1
n
2
cos nt
_

0
=
2
n
2
(cos n 1) =
_
0, n even

4
n
2
, n odd
Thus the Fourier expansion of f(t) is
f(t) =

2

4

n odd
1
n
2
cos nt
i.e. f(t) =

2

4

n=1
cos(2n 1)t
(2n 1)
2
1(g)
a
0
=
1

_

0
(2t )dt =
1

_
t
2
t

0
= 0
a
n
=
1

_

0
(2t ) cos ntdt =
1

_
(2t )
n
sin nt +
2
n
2
cos nt
_

0
=
2
n
2
(cos n 1) =
_

4
n
2
, n odd
0, n even
b
n
=
1

_

0
(2t ) sin ntdt =
1

(2t )
n
cos nt +
2
n
2
sin nt
_

0
=
1
n
(cos n + 1) =
_
0, n odd

2
n
, n even
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 195
Thus the Fourier expansion of f(t) is
f(t) =

n odd

4
n
2
cos nt +

n even

2
n
sin nt
i.e. f(t) =
4

n=1
cos(2n 1)t
(2n 1)
2

n=1
sin 2nt
n
1(h)
a
0
=
1

__
0

(t +e
t
)dt +
_

0
(t +e
t
)dt
_
=
1

_
_

t
2
2
+e
t

+
_
t
2
2
+e
t

0
_
=
1

2
+ (e

= +
2

sinh
a
n
=
1

__
0

(t +e
t
) cos ntdt +
_

0
(t +e
t
) cos ntdt
_
=
1

_
t
n
sin nt +
1
n
2
cos nt

+
1
(n
2
+ 1)
_
ne
t
sin nt +e
t
cos nt

+
_
t
n
sin nt +
1
n
2
cos nt
_

0
+
1
(n
2
+ 1)
_
ne
t
sin nt +e
t
cos nt

0
_
=
2
n
2
(1 + cos n) +
2 cos n
(n
2
+ 1)
_
e

=
2

_
(cos 1)
n
2
+
cos n
(n
2
+ 1)
sinh
_
, cos n = (1)
n
b
n
=
1

__
0

(t +e
t
) sin ntdt +
_

0
(t +e
t
) sin ntdt
_
=
1

_
_
t
n
cos nt
1
n
2
sin nt

+
_

t
n
cos nt +
1
n
2
sin nt

0
+
n
2

2
+ 1
_

e
t
cos nt
n
+
e
t
sin nt
n
2

_
=
n
(n
2
+ 1)
cos n(e

) =
2n
(n
2
+ 1)
cos n sinh , cos n = (1)
n
c
Pearson Education Limited 2004
196 Glyn James: Advanced Modern Engineering Mathematics, Third edition
Thus the Fourier expansion of f(t) is
f(t) =
_

2
+
1

sinh
_
+
2

n=1
_
(1)
n
1
n
2
+
(1)
n
sinh
n
2
+ 1
_
cos nt

n=1
n(1)
n
n
2
+ 1
sinh sin nt
2 Since the periodic function f(t) is an even function its Fourier expansion is
f(t) =
a
0
2
+

n=1
a
n
cos nt
with
a
0
=
2

_

0
( t)
2
dt =
2

1
3
( t)
3
_

0
=
2
3

2
a
n
=
2

_

0
( t)
2
cos ntdt =
2

_
( t)
2
n
sin nt
2( t)
n
2
cos nt
2
n
3
sin nt
_

0
=
4
n
2
Thus the Fourier expansion of f(t) is
f(t) =

2
3
+ 4

n=1
1
n
2
cos nt
Taking t = gives
0 =

2
3
+ 4

n=1
1
n
2
(1)
n
so that
1
12

2
=

n=1
(1)
n+1
n
2
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 197
3 Since q(t) is an even function its Fourier expansion is
q(t) =
a
0
2
+

n=1
a
n
cos nt
with
a
0
=
2

_

0
Qt

dt = Q
a
n
=
2

_

0
Qt

cos ntdt =
2Q

2
_
t
n
sin nt +
1
n
2
cos nt
_

0
=
2Q

2
n
2
(cos n 1) =
_
0, n even

4Q

2
n
2
, n odd
Thus the Fourier expansion of q(t) is
q(t) = Q
_
1
2

4

n=1
cos(2n 1)t
(2n 1)
2
_
4
a
0
=
1

_

0
5 sin tdt =
1

[5 cos t]

0
=
10

a
n
=
5

_

0
sin t cos ntdt =
5
2
_

0
[sin(n + 1)t sin(n 1)t]dt
=
5
2
_

cos(n + 1)t
(n + 1)
+
cos(n 1)t
(n 1)
_

0
, n = 1
=
5
2
_
_
cos n
n + 1

cos n
(n 1)

1
n + 1
+
1
n 1

_
=
5
(n
2
1)
(cos n + 1) =
_
0, n odd, n = 1

10
(n
2
1)
, n even
Note that in this case we need to evaluate a
1
separately as
a
1
=
1

_

0
5 sin t cos tdt =
5
2
_

0
sin 2tdt = 0
b
n
=
5

_

0
sin t sin ntdt =
5
2
_

0
[cos(n + 1)t cos(n 1)t]dt
=
5
2
_
sin(n + 1)t
(n + 1)

sin(n 1)t
(n 1)
_

0
, n = 1
= 0 , n = 1
c
Pearson Education Limited 2004
198 Glyn James: Advanced Modern Engineering Mathematics, Third edition
Evaluating b
1
separately
b
1
=
5

_

0
sin t sin tdt =
5
2
_

0
(1 cos 2t)dt
=
5
2
_
t
1
2
sin 2t

0
=
5
2
Thus the Fourier expansion of f(t) is
f(t) =
5

+
5
2
sin t
10

n=1
cos 2nt
4n
2
1
5
a
0
=
1

__
0

2
dt +
_

0
(t )
2
dt
_
=
1

_
_

2
t

+
_
1
3
(t )
3

0
_
=
4
3

2
a
n
=
1

__
0

2
cos ntdt +
_

0
(t )
2
cos ntdt
_
=
1

_
_

2
n
sin nt

+
_
(t )
2
n
sin nt +
2(t )
n
2
cos nt
2
n
3
sin nt

0
_
=
2
n
2
b
n
=
1

__
0

2
sin ntdt +
_

0
(t )
2
sin ntdt
_
=
1

_
_

2
n
cos nt

+
_

(t )
2
n
cos nt + 2
(t )
n
2
sin nt +
2
n
3
cos nt

0
_
=
1

_
_

2
n
+

2
n
(1)
n

_
=

n
(1)
n

2
n
3
[1 (1)
n
]
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 199
Thus the Fourier expansion of f(t) is
f(t) =
2
3

2
+

n=1
_
2
n
2
cos nt +
(1)
n
n
sin nt
_

n=1
sin(2n 1)t
(2n 1)
3
5(a) Taking t = 0 gives

2
+
2
2
=
2
3

2
+

n=1
2
n
2
and hence the required result

n=1
1
n
2
=
1
6

2
5(b) Taking t = gives

2
+ 0
2
=
2
3

2
+

n=1
2
n
2
(1)
n
and hence the required result

n=1
(1)
n+1
n
2
=
1
12

2
6(a)
c
Pearson Education Limited 2004
200 Glyn James: Advanced Modern Engineering Mathematics, Third edition
6(b)
The Fourier expansion of the even function (a) is given by
f(t) =
a
0
2
+

n=1
a
n
cos nt
with
a
0
=
2

__
/2
0
tdt +
_

/2
( t)dt
_
=
2

_
_
1
2
t
2

/2
0
+
_

1
2
( t)
2

/2
=

2
a
n
=
2

__
/2
0
t cos ntdt +
_

/2
( t) cos ntdt
_
=
2

_
_
t
n
sin nt +
1
n
2
cos nt

/2
0
+
_
t
n
sin nt
1
n
2
cos nt

/2
_
=
2

_
2
n
2
cos
n
2

1
n
2
(1 + (1)
n
)
_
=
_

_
0, n odd

8
n
2
, n = 2, 6, 10, . . .
0, n = 4, 8, 12, . . .
Thus the Fourier expansion of f(t) is
f(t) =

4

2

n=1
cos(4n 2)t
(2n 1)
2
Taking t = 0 where f(t) = 0 gives the required result.
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 201
7
a
0
=
1

__

0
(2
t

)dt +
_
2

t/dt
_
=
1

_
_
2t
t
2
2

0
+
_
t
2
2

_
= 3
a
n
=
1

__

0
(2
t

) cos ntdt +
_
2

cos ntdt
_
=
1

_
_
2
n
sin nt
t
n
sin nt
1
n
2
cos nt

0
+
_
t
n
sin nt +
1
n
2
cos nt

_
=
2

2
n
2
[1 (1)
n
]
=
_
0, n even
4

2
n
2
, n odd
b
n
=
1

__

0
(2
t

) sin ntdt +
_
2

sin ntdt
_
=
1

_
_

2
n
cos nt +
t
n
cos nt
1
n
2
sin nt

0
+
_

t
n
cos nt +
1
n
2
sin nt

_
= 0
Thus the Fourier expansion of f(t) is
f(t) =
3
2
+
4

n=1
cos(2n 1)t
(2n 1)
2
Replacing t by t
1
2
gives
f(t
1
2
) =
3
2
+
4

n=1
cos(2n 1)(t )
(2n 1)
2
c
Pearson Education Limited 2004
202 Glyn James: Advanced Modern Engineering Mathematics, Third edition
Since
cos(2n 1)(t
1
2
) = cos(2n 1)t cos(2n 1)

2
+ sin(2n 1)t sin(2n 1)

2
= (1)
n+1
sin(2n 1)t
f(t
1
2
)
3
2
=
4

n=1
(1)
n+1
sin(2n 1)t
(2n 1)
2
The corresponding odd function is readily recognised from the graph of f(t).
Exercises 4.2.11
8 Since f(t) is an odd function the Fourier expansion is
f(t) =

n=1
b
n
sin
nt

with
b
n
=
2

_

0
t sin
nt

dt =
2

t
n
cos
nt

+
_

n
_
2
sin
nt

0
=
2
n
cos n
Thus the Fourier expansion of f(t) is
f(t) =
2

n=1
(1)
n+1
n
sin
nt

9 Since f(t) is an odd function (readily seen from a sketch of its graph) its
Fourier expansion is
f(t) =

n=1
b
n
sin
nt

with
b
n
=
2

_

0
K

( t) sin
nt

tdt
=
2

K
n
cos
nt

+
Kt
n
cos
nt

K
(n)
2
sin
nt

0
=
2K
n
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 203
Thus the Fourier expansion of f(t) is
f(t) =
2K

n=1
1
n
sin
nt

10
a
0
=
1
5
_
5
0
3dt = 3
a
n
=
1
5
_
5
0
3 cos
nt
5
dt =
1
5
_
15
n
sin
nt
5
_
5
0
= 0
b
n
=
1
5
_
5
0
3 sin
nt
5
dt =
1
5
_

15
n
cos
nt
5
_
5
0
=
3
n
[1 (1)
n
] =
_
6
n
, n odd
0, n even
Thus the Fourier expansion of f(t) is
f(t) =
3
2
+
6

n=1
1
(2n 1)
sin
(2n 1)
5
t
11
a
0
=
2
2
_
/
0
Asin tdt =

cos t
_
/
0
=
2A

a
n
=
A

_
/
0
sin t cos ntdt =
A
2
_
/
0
[sin(n + 1)t sin(n 1)t]dt
=
A
2
_

cos(n + 1)t
(n + 1)
+
cos(n 1)t
(n 1)
_
/
0
, n = 1
=
A
2
_
2(1)
n+1
n
2
1

2
n
2
1
_
=
A
(n
2
1)
[(1)
n+1
1]
=
_
0, n odd , n = 1

2A
(n
2
1)
, n even
Evaluating a
1
separately
a
1
=
A

_
/
0
sin t cos tdt =
A
2
_
/
0
sin 2tdt = 0
c
Pearson Education Limited 2004
204 Glyn James: Advanced Modern Engineering Mathematics, Third edition
b
n
=
A

_
/
0
sin t sin ntdt =
A
2
_
/
0
[cos(n + 1)t cos(n 1)t]dt
=
A
2
_
sin(n + 1)t
(n + 1)

sin(n 1)t
(n 1)
_
/
0
, n = 1
= 0, n = 1
b
1
=
A

_
/
0
sin
2
tdt =
A
2
_
/
0
(1 cos 2t)dt =
A
2
Thus the Fourier expansion of f(t) is
f(t) =
A

_
1 +

2
sin t 2

n=1
cos 2nt
4n
2
1
_
12 Since f(t) is an even function its Fourier expansion is
f(t) =
a
0
2
+

n=1
a
n
cos
nt
T
with
a
0
=
2
T
_
T
0
t
2
dt =
2
T
_
1
3
t
3
_
T
0
=
2
3
T
2
a
n
=
2
T
_
T
0
t
2
cos
nt
T
dt =
2
T
_
Tt
2
n
sin
nt
T
+
2tT
2
(n)
2
cos
nt
T

2T
3
(n)
3
sin
nt
T
_
T
0
=
4T
2
(n)
2
(1)
n
Thus the Fourier series expansion of f(t) is
f(t) =
T
2
3
+
4T
2

n=1
(1)
n
n
2
cos
nt
T
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 205
13
a
0
=
2
T
_
T
0
E
T
tdt =
2E
T
2
_
1
2
t
2
_
T
0
= E
a
n
=
2
T
_
T
0
E
T
t cos
2nt
T
dt
=
2E
T
2
_
tT
2n
sin
2nt
T
+
_
T
2n
_
2
cos
2nt
T
_
T
0
= 0
b
n
=
2E
T
2
_
T
0
t sin
2nt
T
dt
=
2E
T
2
_

tT
2n
cos
2nt
T
+
_
T
2n
_
2
sin
2nt
T
_
T
0
=
E
n
Thus the Fourier expansion of e(t) is
e(t) =
E
2

E

n=1
1
n
sin
2nt
T
Exercises 4.3.3
14 Half range Fourier sine series expansion is given by
f(t) =

n=1
b
n
sin nt
with
b
n
=
2

_

0
1 sin ntdt =
2

1
n
cos nt
_

0
=
2
n
[(1)
n
1]
=
_
0, n even
4
n
, n odd
Thus the half range Fourier sine series expansion of f(t) is
f(t) =
4

n=1
sin(2n 1)t
(2n 1)
Plotting the graphs should cause no problems.
c
Pearson Education Limited 2004
206 Glyn James: Advanced Modern Engineering Mathematics, Third edition
15 Half range Fourier cosine series expansion is given by
f(t) =
a
0
2
+

n=1
a
n
cos nt
with
a
0
=
2
1
_
1
0
(2t 1)dt = 0
a
n
= 2
_
1
0
(2t 1) cos ntdt
= 2
_
(2t 1)
n
sin nt +
2
(n)
2
cos nt
_
1
0
=
4
(n)
2
[(1)
n
1]
=
_
0, n even

8
(n)
2
, n odd
Thus the half range Fourier cosine series expansion of f(t) is
f(t) =
8

n=1
1
(2n 1)
2
cos(2n 1)t
Again plotting the graph should cause no problems.
16(a)
a
0
= 2
_
1
0
(1 t
2
)dt = 2
_
t
1
3
t
3

1
0
=
4
3
a
n
= 2
_
1
0
(1 t
2
) cos 2ntdt
= 2
_
(1 t
2
)
2n
sin 2nt
2t
(2n)
2
cos 2nt +
2
(2n)
3
sin 2nt
_
1
0
=
1
(n)
2
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 207
b
n
= 2
_
1
0
(1 t
2
) sin 2ntdt
= 2
_

(1 t
2
)
2n
cos 2nt
2t
(2n)
2
sin 2nt
2
(2n)
3
cos 2nt
_
1
0
=
1
n
Thus the full-range Fourier series expansion for f(t) is
f(t) = f
1
(t) =
2
3

1

n=1
1
n
2
cos 2nt +
1

n=1
1
n
sin 2nt
16(b) Half range sine series expansion is
f
2
(t) =

n=1
b
n
sin nt
with
b
n
= 2
_
1
0
(1 t
2
) sin ntdt
= 2
_

(1 t
2
)
n
cos nt
2t
(n)
2
sin nt
2
(n)
3
cos nt
_
1
0
= 2
_

2
(n)
3
(1)
n
+
1
n
+
2
(n)
3
_
=
_

_
2
n
, n even
2
_
1
n
+
4
(n)
3

, n odd
Thus half range sine series expansion is
f
2
(t) =
1

n=1
1
n
sin 2nt +
2

n=1
_
1
(2n 1)
+
4

2
(2n 1)
3
_
sin(2n 1)t
16(c) Half range cosine series expansion is
f
3
(t) =
a
0
2
+

n=1
a
n
cos nt
c
Pearson Education Limited 2004
208 Glyn James: Advanced Modern Engineering Mathematics, Third edition
with
a
0
= 2
_
1
0
(1 t
2
)dt =
4
3
a
n
= 2
_
1
0
(1 t
2
) cos ntdt
= 2
_
(1 t
2
)
n
sin nt
2t
(n)
2
cos nt +
2
(n)
3
sin nt
_
1
0
=
4(1)
n
(n)
2
Thus half range cosine series expansion is
f
3
(t) =
2
3
+
4

n=1
(1)
n+1
n
2
cos nt
Graphs of the functions f
1
(t), f
2
(t), f
3
(t) for 4 < t < 4 are as follows
17 Fourier cosine series expansion is
f
1
(t) =
a
0
2
+

n=1
a
n
cos nt
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 209
with
a
0
=
2

_

0
(t t
2
)dt =
1
3

2
a
n
=
2

_

0
(t t
2
) cos ntdt
=
2

_
(t t
2
)
n
sin nt +
( 2t)
n
2
cos nt +
2
n
3
sin nt
_

0
=
2
n
2
[1 + (1)
n
]
=
_
0, n odd

4
n
2
, n even
Thus the Fourier cosine series expansion is
f
1
(t) =
1
6

n=1
1
n
2
cos 2nt
Fourier sine series expansion is
f
2
(t) =

n=1
b
n
sin nt
with
b
n
=
2

_

0
(t t
2
) sin ntdt
=
2

(t t
2
)
n
cos nt +
( 2t)
n
2
sin nt
2
n
3
cos nt
_

0
=
4
n
3
[1 (1)
n
]
=
_
0, n even
8
n
3
, n odd
Thus the Fourier sine series expansion is
f
2
(t) =
8

n=1
1
(2n 1)
3
sin(2n 1)t
c
Pearson Education Limited 2004
210 Glyn James: Advanced Modern Engineering Mathematics, Third edition
Graphs of the functions f
1
(t) and f
2
(t) for 2 < t < 2 are:
18
f(x) =
2a

x , 0 < x <

2
f(x) =
2a

( x) ,

2
< x <
Fourier sine series expansion is
f(x) =

n=1
b
n
sin
nx

with
b
n
=
2a

__
/2
0
xsin
nx

dx +
_

/2
( x) sin
nx

dx
_
=
4a

2
__

x
n
cos
nx

+

2
(n)
2
sin
nx

_
/2
0
+
_

n
( x) cos
nx

2
(n)
2
sin
nx

/2
_
=
4a

2
_
2
2
(n)
2
sin
n
2
_
=
8a
(n)
2
sin
n
2
=
_

_
0, n even
8a
(n)
2
, n = 1, 5, 9, . . .

8a
(n)
2
, n = 3, 7, . . .
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 211
Thus the required Fourier sine series expansion is
f(x) =
8a

n=1
(1)
n+1
(2n 1)
2
sin
(2n 1)x

19
f(x) =
_

_
x, 0 < x <

4

2
x,

4
< x <
3
4
x ,
3
4
< x <
Fourier sine series expansion is
f(x) =

n=1
b
n
sin
nx

with
b
n
=
2

__
/4
0
xsin
nx

dx +
_
3/4
/4
_

2
x
_
sin
nx

dx +
_

3/4
(x ) sin
nx

dx
_
=
2

_
_

x
n
cos
nx

+

2
(n)
2
sin
nx

/4
0
+
_

n
_

2
x
_
cos
nx

2
(n)
2
sin
nx

_
3/4
/4
+
_

n
(x ) cos
nx

+

2
(n)
2
sin
nx

3/4
_
=
_
sin
n
4
sin
3n
4
_
=
8
(n)
2
cos
n
2
sin
n
4
=
_

_
0, n odd
0, n = 4, 8, 12, . . .
8
(n)
2
, n = 2, 10, 18, . . .

8
(n)
2
, n = 6, 14, 22, . . .
c
Pearson Education Limited 2004
212 Glyn James: Advanced Modern Engineering Mathematics, Third edition
Thus the required Fourier sine series expansion is
f(x) =
2

n=1
(1)
n+1
(2n 1)
2
sin 2(2n 1)
x

20 Fourier sine series expansion is

f(t) =

n=1
b
n
sin nt
with
b
n
=
2

_
/2
0
sin t sin ntdt
=
1

_
/2
0
[cos(n + 1)t cos(n 1)t]dt
=
1

_
1
(n + 1)
sin(n + 1)t
1
(n 1)
sin(n 1)t
_
/2
0
, n = 1
=
1

_
1
(n + 1)
sin(n + 1)

2

1
(n 1)
sin(n 1)

2
_
Using the trigonometric expansions for sin(A+B) and sin(AB) gives
b
n
=
2n
(n
2
1)
cos
n
2
, n = 1
=
_

_
0, n odd
2n
(n
2
1)
, n = 2, 6, . . .

2n
(n
2
1)
, n = 4, 8, 10, . . .
In the case n = 1
b
1
=
2

_
/2
0
sin
2
tdt =
1

_
/2
0
(1 cos 2t)dt =
1
2
Thus, the required Fourier sine series expansion is
f(t) =
1
2
sin t +
4

n=1
(1)
n+1
nsin 2nt
4n
2
1
The corresponding plot presents no problem.
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 213
21 Since f(x) is an even function the Fourier series expansion is
f(x) =
a
0
2
+

n=1
a
n
cos
nx

with
a
0
=
2

_

0
A

(x )dx, since | x |= x for x 0

=
2A

2
_
1
2
x
2
x

0
= A
a
n
=
2

_

0
A

(x ) cos
nx

dx
=
2A

2
_

n
(x ) sin
nx

+

2
(n)
2
cos
nx

0
=
2A
(n)
2
(cos n 1) =
_
0, n even

4A
(n)
2
, n odd
Thus the Fourier series expansion is
f(t) =
A
2

4A

n=1
1
(2n 1)
2
cos
(2n 1)x

The graph represented by the series for 3 x 3 is as follows

22 Fourier sine series expansion is
T(x) =

n=1
b
n
sin
nx
L
c
Pearson Education Limited 2004
214 Glyn James: Advanced Modern Engineering Mathematics, Third edition
with
b
n
=
2
L
_
L
0
Kx(L x) sin
nx
L
dx
=
2K
L
_

Lx(L x)
n
cos
nx
L
+
L
2
(n)
2
(L 2x) sin
nx
L

2L
3
(n)
3
cos
nx
L
_
L
0
=
4KL
2
(n)
3
(1 cos n) =
_
_
_
0, n even
8KL
2
(n)
3
, n odd
Thus the Fourier sine series expansion is
T(x) =
8KL
2

n=1
1
(2n 1)
3
sin
(2n 1)x
L
23
a
0
=
2
2
__
0
1
1dt +
_
1
0
cos tdt
_
= [t]
0
1
+
_
1

sin t
_
1
0
= 1
a
n
=
_
0
1
cos ntdt +
_
1
0
cos t cos ntdt
=
_
1
n
sin nt
_
0
1
+
1
2
_
1
0
cos(n + 1)t + cos(n 1)tdt
=
1
2
_
1
(n + 1)
sin(n + 1)t +
1
(n 1)
sin(n 1)t
_
1
0
, n = 1
= 0
a
1
=
1
2
_
1
0
2 cos
2

tdt =
1
2
_
1
0
(1 + cos 2t)dt =
1
2
b
n
=
_
0
1
sin ntdt +
_
1
0
cos t sin ntdt
=
_

1
n
cos nt
_
0
1
+
1
2
_
1
0
sin(n + 1)t + sin(n 1)tdt
=
1
n
[(1)
n
1] +
1
2
_

1
(n + 1)
cos(n + 1)t
1
(n 1)
cos(n 1)t
_
1
0
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 215
=
1
n
[(1)
n
1] +
1
2
_
2n
(n
2
1)
_
[1 + cos n]
=
_

2
n
, n odd
2n
(n
2
1)
, n even
Thus the Fourier series expansion is
f(t) =
1
2
+
1
2
cos t
2

n=1
1
(2n 1)
sin(2n 1)t +
4

n=1
n
4n
2
1
sin 2nt
Exercises 4.4.4
24 Since f(t) is an odd function its Fourier expansion is of the form
f(t) =

n=1
b
n
sin
n
T
t
with
b
n
=
2
T
_
T
0
t sin
n
T
t
=
2
T
_

Tt
n
cos
n
T
t +
T
2
n
2

2
sin
n
T
t
_
T
0
=
2
T
_

T
2
n
cos n
_
=
2T
n
(1)
n
Thus the Fourier expansion is
f(t) = t =
2T

n=1
1
n
(1)
n+1
sin
n
T
t
Integrating term by term gives
t
2
2
=
2T
2

n=1
1
n
2
(1)
n+1
cos
n
T
t + const.
Taking mean value over a period
1
2T
_
T
T
t
2
2
dt =
2T
2

n=1
(1)
n+1
n
2
_
T
T
cos
n
T
tdt +
1
2T
_
T
T
(const.)dt
c
Pearson Education Limited 2004
216 Glyn James: Advanced Modern Engineering Mathematics, Third edition
so that
T
2
6
= 0 + const.
giving (const.) = T
2
/6
Thus
g(t) = t
2
=
T
2
3

4T
2

(1)
n+1
n
2
cos
n
T
t
25
2
t
2
= h(t) =
2
3

2
+ 4

n=1
(1)
n+1
n
2
cos nt
Since h(t) is continuous within and at the end points of the interval t
we may apply theorem 4.4 to obtain the Fourier series of
f(t) = t, < t < ; f(t + 2) = f(t)
Dierentiating gives
2t = 4

n=1
(1)
n+1
n
sin nt
So that the Fourier series of f(t) is
f(t) = t = 2

n=1
(1)
n+1
n
sin nt
which conrms the series of Exercise 24 when T = .
26(b) Derived series is

n=1
4
n
(1)
n+1
sin nt
n

n=1
2(1)
n
cos nt
This is not a Fourier expansion of g(t) since f(t) is discontinuous at the end points
of t .
26(c) Using the results of (a)
A
0
=
1

[f(

) f(
+
)] =
1

2 = 2
A
n
= (1)
n
A
0
+nb
n
= (1)
n
2
n2
n
(1)
n
= 2(1)
n
2(1)
n
= 0
B
n
= na
n
=
4
n
(1)
n+1
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 217
Thus the Fourier expansion g(t) is
g(t) =
A
0
2
+

n=1
A
n
cos nt +

n=1
B
n
sin nt
= 1 + 4

n=1
(1)
n+1
n
sin nt
Using Eulers formulae
A
0
=
1

(2t + 1)dt =
1

[t
2
+t]

= 2
A
n
=
1

(2t + 1) cos nt dt
=
1

_
(2t + 1)
n
sin nt +
2
n
2
cos nt
_

= 0
B
n
=
1

(2t + 1) sin nt dt
=
1

(2t + 1)
n
cos nt +
2
n
2
sin nt
_

=
1
n
_
(2 + 1)(1)
n
+ (2 + 1)(1)
n

=
4
n
(1)
n+1
thus conrming the values obtained using (a).
27(a)
p
1
(t) =1 p
2
(t) =1
d
1
=2 d
2
=2
p
(1)
1
(t) =0 p
(1)
2
(t) =0
d
(1)
1
=0 d
(1)
2
=0
t
1
= 0, t
2
= and since = 1 using (4.39) gives
a
n
=
1
n
_

s=1
d
s
sin nt
s

1
n
2

s=1
d
(1)
s
cos nt
s
_
=
1
n
_
2 sin 0 + 2 sin n

= 0
c
Pearson Education Limited 2004
218 Glyn James: Advanced Modern Engineering Mathematics, Third edition
b
n
=
1
n
_
2

s=1
d
s
cos nt
s

1
n
2

s=1
d
(1)
s
sin nt
s
_
=
1
n
_
2 cos 0 2 cos

=
2
n
_
1 (1)
n

=
_
0, n even
4
n
, n odd
a
0
=
1

__
0

(1)dt +
_

0
1dt
_
= 0
Thus, Fourier series is
f(t) =
4

n=1
1
(2n 1)
sin(2n 1)t
conrming (4.21).
27(b)
p
1
(t) =t, d
1
=2
p
(1)
1
(t) =1, d
(1)
1
=0
t
1
=0, t
2
=, = 1
Thus from (4.39)
a
n
=
1
n
_
d
1
sin nt
1

=
1
n
_
2 sin 0

= 0
b
n
=
1
n
_
d
1
cos nt
1

=
1
n
_
2 cos 0

=
2
n
a
0
=
1

_
2
0
t at = 2
Thus Fourier series is
f(t) = 2

n=1
1
n
sin nt
conrming the result obtained in Example 4.1.
27(c)
p
1
(t) =t p
2
(t) =
1
2
p
3
(t) =
1
2
t
d
1
=0 d
2
=0 d
3
=0
p
(1)
1
(t) =1 p
(1)
2
(t) =0 p
(1)
3
(t) =
1
2
d
(1)
1
=1 d
(1)
2
=
1
2
d
(1)
3
=
3
2
t
1
=

2
, t
2
= , t
3
= 2, = 1
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 219
Thus from (4.39)
a
n
=
1
n
_

s=1
d
s
sin nt
s

1
n
3

s=1
d
(1)
s
cos nt
s
_
=
1
n
2

_
d
(1)
1
cos n

2
+d
(1)
2
cos n +d
(1)
3
cos 2n
_
since d
s
= 0, s = 1, 2, 3
=
1
n
2

_
1 cos
n
2

1
2
cos n +
3
2
cos 2n
_
=
1
n
2

_
cos
n
2

1
2
(1)
n
+
3
2
_
b
n
=
1
n
_
3

s=1
d
s
cos nt
s

1
n
3

s=1
d
(1)
s
sin nt
s
_
=
1
n
2

_
1 sin
n
2

1
2
sin n +
3
2
sin 2n
_
=
1
n
2

sin
n
2
a
0
=
1

__
/2
0
t dt +
_

/2

2
dt +
_
2

(
1
2
t)dt
_
=
5
8

which agree with the Fourier coecients of Example 4.3.

28(a) Graph of f(t) for < t < as follows and is readily extended to
4 < t < 4
c
Pearson Education Limited 2004
220 Glyn James: Advanced Modern Engineering Mathematics, Third edition
28(b)
p
1
(t) =0 p
2
(t) = + 2t p
3
(t) = 2t p
4
(t) =0
d
1
=0 d
2
=0 d
3
=0 d
4
=0
p
(1)
1
(t)=0 p
(1)
2
(t) =2 p
(1)
3
(t) =2 p
(1)
4
(t) =0
d
(1)
1
=2 d
(1)
2
=4 d
(1)
3
=2 d
(1)
4
=0
p
(2)
1
(t) =0 p
(2)
2
(t) =0 p
(2)
3
(t) =0 p
(2)
4
(t) =0
d
(2)
1
=0 d
(2)
2
=0 d
(2)
3
=0 d
(2)
4
=0
t
1
=

2
, t
2
= 0, t
3
=

2
, t
4
= , = 1
Thus from (4.39)
a
n
=
1
n
_

s=1
d
s
sin nt
s

1
n
4

s=1
d
(1)
s
cos nt
s
+
1
n
2
4

s=1
d
(2)
s
sin t
s
_
=
1
n
2

_
2 cos
n
2
4 cos 0 + 2 cos
n
2
_
=
4
n
2

_
cos
n
2
1
_
b
n
=
1
n
_
4

s=1
d
s
cos nt
s

1
n
4

s=1
d
(1)
s
sin nt
s

1
n
2
4

s=1
d
(2)
s
cos nt
s
_
=
1
n
2

_
2 sin
n
2
4 sin 0 + 2 sin
n
2
_
= 0
a
0
=
1

__
/2

0dt +
_
0
/2
( + 2t)dt +
_
/2
0
( 2t)dt +
_

/2
0dt
_
=

2
Thus Fourier series is
f(t) =

4

4

n=1
1
n
2
_
cos
n
2
1
_
cos nt
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 221
29(a)
p
1
(t) =1 p
2
(t) =t
2
d
1
=0 d
2
=
2
p
(1)
1
(t) =0 p
(1)
2
(t) =2t
d
(1)
1
=0 d
(1)
2
=2
p
(2)
1
(t) =0 p
(2)
2
(t) =2
d
(2)
1
=2 d
(2)
2
=2
p
(3)
1
(t) =0 p
(3)
2
(t) =0
d
(3)
1
=0 d
(3)
2
=0
t
1
= 0, t
2
= , = 1
Thus from (4.39)
a
n
=
1
n
_

s=1
d
s
sin nt
s

1
n
2

s=1
d
(1)
s
cos nt
s
+
1
n
2
2

s=1
d
(2)
s
sin nt
s
_
=
1
n
_

2
sin n +
2
n
cos n

2
n
2
sin n +
2
n
2
sin 0
_
=
2

2
(1)
n
b
n
=
1
n
_

2
cos n +
2
n
sin n

2
n
2
cos 0 +
2
n
2
cos n
_
=
1

2
n
(1)
n

2
n
3
+
2
n
3
(1)
n
_
a
0
=
1

_

0
t
2
dt =

2
3
From which the Fourier series may be readily written down.
c
Pearson Education Limited 2004
222 Glyn James: Advanced Modern Engineering Mathematics, Third edition
29(b)
p
1
(t) =2 p
2
(t) =t
3
p
3
(t) =2
d
1
=(2 +

3
8
) d
2
=(2 +

3
8
) d
3
=4
p
(1)
1
(t) =0 p
(1)
2
(t) =3t
2
p
(1)
3
(t) =0
d
(1)
1
=
3
2
4
d
(1)
2
=
3
2
4
d
(1)
3
=0
p
(2)
1
(t) =0 p
(2)
2
(t) =6t p
(2)
3
(t) =0
d
(2)
1
=3 d
(2)
2
=3 d
(2)
3
=0
p
(3)
1
(t) =0 p
(3)
2
=6 p
(3)
3
(t) =0
d
(3)
1
=6 d
(3)
2
=6 d
(3)
3
=0
p
(4)
1
(t) =0 p
(4)
2
(t) =0 p
(4)
3
(t) =0
d
(4)
1
=0 d
(4)
2
=0 d
(4)
3
=0
t
1
=

2
, t
2
=

2
, t
3
= , = 1
Thus from (4.39)
a
n
=
1
n
_
(2 +

3
8
) sin
n
2
+ (2 +

3
8
) sin
n
2
4 sin n
3
2
4n
cos
n
2
+
3
2
4n
cos
n
2
+
3
n
2
sin
n
2

3
n
2
sin
n
2
+
6
n
3
cos
n
2

6
n
3
cos
n
2
_
= 0 (which is readily conrmed since odd function)
b
n
=
1
n
_
(2 +

3
8
) cos
n
2
(2 +

3
8
) cos
n
2
+ 4 cos n +
3
2
4n
sin
n
2
+
3
2
4n
sin
n
2
+
3
n
2
cos
n
2
+
3
n
2
cos
n
2

6
n
3
sin
n
2

6
n
3
cos
n
2
_
=
4
n
(cos n cos
n
2
) + 2
_
3
4n
2
sin
n
2


2
8n
cos
n
2
+
3
n
3
cos
n
2

6
n
4
sin
n
2
_
a
0
=
1

f(t)dt = 0 since f(t) is even function

Thus Fourier series may be written down.
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 223
29(c)
p
1
(t) =t p
2
(t) =1 t
d
1
=1 d
2
=2
p
(1)
1
(t) =1 p
(1)
2
(t) =1
d
(1)
1
=2 d
(1)
2
=2
p
(2)
1
(t) =0 p
(2)
2
(t) =0
d
(2)
1
=0 d
(2)
2
=0
t
1
= 1, t
2
= 2, =
Thus from (4.39)
a
n
=
1
n
_

s=1
d
s
sin nt
s

1
n
2

s=1
d
(1)
s
cos nt
s
_
=
1
n
_
1 sin n 2 sin 2n
1
n
(2 cos n + 2 cos 2n)
_
=
2
n
2

2
[(1)
n
1] =
_
0, n even
4
n
2

2
, n odd
b
n
=
1
n
_
2

s=1
d
s
cos nt
s

1
n
2

s=1
d
(1)
s
sin nt
s
_
=
1
n
_
cos n + cos 2n 0
_
=
1
n
_
1 (1)
n

=
_
0, n even
2
n
, n odd
a
0
=
2
2
_
2
0
f(t)dt =
_
_
1
0
tdt +
_
2
1
(1 t)dt

= 0
The Fourier series is
f(t) =
4

n=1
cos(2n 1)t
(2n 1)
2
+
2

n=1
sin(2n 1)t
(2n 1)
c
Pearson Education Limited 2004
224 Glyn James: Advanced Modern Engineering Mathematics, Third edition
29(d)
p
1
(t) =
1
2
+t p
2
(t) =
1
2
t
d
1
=0 d
2
=0
p
(1)
1
(t) =1 p
(1)
2
(t) =1
d
(1)
1
=2 d
(1)
2
=2
p
(2)
1
(t) =0 p
(2)
2
(t) =0
d
(2)
1
=0 d
(0)
2
=0
t
1
= 0, t
2
=
1
2
, = 2
Thus from (4.39)
a
n
=
1
n
_

s=1
d
s
sin 2nt
s

1
2n
2

s=1
d
(1)
s
cos 2nt
s
_
=
1
n
_

1
2n
[2 cos 0 + 2 cos n]
_
=
1
(n)
2
(cos n 1) =
_
0, n even
2
(n)
2
, n odd
b
n
=
1
n
_
2

s=1
d
s
cos 2nt
s

1
2n
2

s=1
d
(1)
s
sin 2nt
s
_
= 0
a
0
= 2
__
0

1
2
(
1
2
+t)dt +
_
1
2
0
(
1
2
t)dt
_
=
1
2
Thus Fourier expansion is
f(t) =
1
4
+
2

n=1
1
(2n 1)
2
cos 2(2n 1)t
Exercises 4.5.2
30 Fourier expansion to the voltage e(t) is
e(t) =
a
0
2
+

n=1
a
n
cos nt +

n=1
b
n
sin nt, = 100
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 225
where
a
0
= 100
_
1
100
0
dt = 10
a
n
= 100
_
1
100
0
10 cos 100ntdt = 100
_
100 sin 100nt
100n

1
100
0
= 0
b
n
= 100
_
1
100
0
10 sin 100ntdt = 100
_
10
cos 100nt
100n

1
100
0
=
10
n
[1 (1)
n
] =
_
0, n even
20
n
, n odd
Thus Fourier expansion is
e(t) = 5 +
20

n=1
1
(2n 1)
sin(2n 1)100t
= 5 +

n=1
u
n
(t), where u
n
(t) =
20
(2n 1)
sin(2n 1)100t
By Kirchhos second law charge on the capacitor is given by
0.02
d
2
q
dt
2
+ 300
dq
dt
+ 250000q = e(t)
System transfer function is G(s) =
1
0.02s
2
+300s+250000
giving | G(j) | =
1
_
(250000 0.02
2
)
2
+ (300)
2
argG(j) = tan
1
_
300
250000 0.02
2
_
From (4.42) the steady state response to the nth harmonic u
n
(t) is
q
ssn
(t) =
20
(2n 1)
| G(j(2n1)100) | sin[(2n1)100t +argG(j(2n1)100)]
So steady state current response i
ssn
(t) to nth harmonic is
i
ssn
(t) = 2000 | G(j(2n 1)100) | cos[(2n 1)100t +argG(j(2n 1)100)]
c
Pearson Education Limited 2004
226 Glyn James: Advanced Modern Engineering Mathematics, Third edition
Note that the d.c. term in e(t) gives no contribution to current steady state
response, which becomes
i
ss
=

n=1
i
ssn
(t)
Evaluating the rst few terms gives
i
ss
0.008 cos(100t 1.96) + 0.005 cos(300t 0.33)
31 Since the applied force represents an odd function its Fourier expansion is
f(t) =

n=1
b
n
sin nt
where
b
n
=
4
2
_
1
0
100 sin ntdt = 200
_

1
n
cos nt
_
1
0
=
200
n
(1 (1)
n
) =
_
0, n even
400
n
, n odd
Thus Fourier expansion is
f(t) =
400

n=1
1
(2n 1)
sin(2n 1)t =

n=1
u
n
(t)
where u
n
(t) =
400

sin(2n 1)t
(2n 1)
From Newtons law, the displacement x(t) of the mass is given by
10
d
2
x
dt
2
+ 0.5
dx
dt
+ 1000 = f(t)
The transfer function is G(s) =
1
10s
2
+ 0.5s + 1000
so that G(j) =
1
10
2
+ 0.5j + 1000
=
1000 10
2
D
j
0.5
D
giving | G(j) |=
1

D
=
1
_
(1000 10
2
)
2
+ 0.25
2
argG(j) = tan
1
_
0.5
1000 10
2

c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 227
Thus from (4.42) the steady state response to the nth harmonic u
n
(t) is
x
ssn
=
400
(2n 1)
| G(j(2n 1)) | sin[(2n 1)t +argG(j(2n 1))]
and steady state response to f(t) is x
ss
(t) =

n=1
x
ssn
(t)
Evaluating the rst few terms gives
x
ss
(t) 0.14 sin(t 0.1) + 0.379 sin(3t 2.415)
+ 0.017 sin(5t 2.83)
32 Since the applied force represents an odd function its Fourier expansion is
f(t) =

n=1
b
n
sin nt, = 2
where
b
n
=
4
1
_
1
2
0
100t sin 2ntdt
= 400
_

t
2n
cos 2nt +
1
(2n)
2
sin 2nt
_
1
2
0
=
100
n
cos n =
100
n
(1)
n+1
Thus Fourier expansion is
f(t) =
100

n=1
(1)
n+1
n
sin 2nt =

n=1
u
n
where u
n
(t) =
100(1)
n
n
sin 2nt
From Newtons law the displacement x(t) of the mass is given by
20
d
2
x
dt
2
+ 0.02
dx
dt
+ 80x = f(t)
Transfer function is G(s) =
1
20s
2
+ 0.02s + 80
c
Pearson Education Limited 2004
228 Glyn James: Advanced Modern Engineering Mathematics, Third edition
giving
| G(j) |=
1
_
(80 20
2
)
2
+ (0.02)
2
, argG(j) = tan
1
_
0.02
80 20
2
_
Then from (4.42) the steady state response to the nth harmonic u
n
(t) is
x
ssn
(t) =
100(1)
n
n
| G(j2n) | sin[2nt +argG(jn)]
and the steady state response to f(t) is
x
ss
(t) =

n=1
x
ssn
(t)
Evaluating the rst few terms gives
x
ss
(t) 0.044 sin(2t 3.13) 0.0052 sin(4t 3.14)
33 Taking A = 100 and = 50 in Exercise 11 gives the Fourier expansion of
the applied voltage e(t) as
e(t) =
100

+ 50 sin 50t
200

n=1
cos 100nt
4n
2
1
= u
0
+u
s

n=1
u
n
(t)
By Kirchhos second law the charge q(t) on the capacitor is given by
0.4
d
2
q
dt
2
+ 100
dq
dt
+ 10
5
q = e(t)
System transfer function is G(s) =
1
0.4s
2
+ 100s + 10
5
giving
| G(j) |=
1
_
[(10
5
0.4
2
)
2
+ (100)
2
]
, argG(j) = tan
1
_
100
10
5
0.4
2

From (4.42) the steady state response to u

s
= 50 sin 50t is
q
sss
(t) = 50 | G(j50) | sin(50t +argG(j50))
= 0.005 sin(50t 0.17)
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 229
and the steady state response to u
n
=
200

cos
100nt
4n
2
1
is
q
ssn
(t) =
200

1
4n
2
1
| G(j100n) | cos[100nt +argG(j100n)]
Since the d.c. term u
0
does not contribute to the steady state current this is given
by
i
ss
= 0.785 cos(50t0.17)

n=1
2 10
4
n
4n
2
1
| G(j100n) | sin[100nt+argG(j100n)]
or
i
ss
0.785 cos(50t 0.17) 0.1 sin(100t 0.48)
Exercises 4.6.5
34 Since T = 2 complex form of the Fourier series is
f(t) =

n=
c
n
e
jnt
with
c
n
=
1
2
_

f(t)e
jnt
dt =
1
2
_

t
2
e
jnt
dt
=
1
2
_

t
2
jn
e
jnt

2t
(jn)
2
e
jnt

2
(jn)
3
e
jnt
_

, n = 0
=
1
2
_
(
j
2
n
e
jn
+
2
n
2
e
jn

2j
n
3
e
jn
)
(
j
2
n
e
jn

2
n
2
e
jn

2j
n
3
e
jn
)
_
Since e
jn
= e
jn
= cos n
c
n
=
2
n
2
cos n =
2
n
2
(1)
n
, n = 0
When n = 0, c
0
=
1
2
_

t
2
dt =

2
3
Thus complex form of the Fourier series is
f(t) =

2
3
+

n=
n=0
2
n
2
(1)
n
e
jnt
c
Pearson Education Limited 2004
230 Glyn James: Advanced Modern Engineering Mathematics, Third edition
Using (4.56)
a
0
= 2c
0
=
2
2
3
a
n
jb
n
=
4
n
2
(1)
n
, a
n
+jb
n
=
4
n
2
(1)
n
giving b
n
= 0 and a
n
=
4
n
2
(1)
n
thus conrming the series obtained in Example 4.5.
35 Since T = 4 the complex form of the Fourier series is
f(t) =

n=
c
n
e
jn
2
t
with
c
n
=
1
4
_
2
2
f(t)e

jn
2
t
dt =
1
4
_
2
0
e

jn
2
t
dt
=
1
4
_

2
jn
e

jn
2
t
_
2
0
, n = 0
=
j
2n
[(1)
n
1], n = 0
c
0
=
1
4
_
2
0
1dt =
1
2
Thus the complex form of the Fourier series is
f(t) =
1
2
+

n=
n=0
j
2n
[(1)
n
1]e
jn
2
t
Using (4.56)
a
0
=2c
0
= 1
a
nj
b
n
=
j
n
[(1)
n
1]
a
n
j
+b
n
=
j
n
[1 (1)
n
]
giving a
n
= 0 , b
n
=
1
n
[1 (1)
n
] =
_
0, n even
2
n
, n odd
thus agreeing with series obtained in Example 4.9.
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 231
36(a)
c
n
=
1
2
__
0

e
jnt
dt +
_

0
te
jnt
dt
_
=
1
2
_
_

jn
e
jnt
0

+
_

t
jn
e
jnt

1
(jn)
2
e
jnt

0
_
=
1
2
_
j
n

1
n
2
(1 + (1)
n
)
_
, n = 0
c
0
=
1
2
__
0

dt +
_

0
tdt
_
=
3
4
Thus complex form of Fourier series is
f(t) =
3
4
+

n=
n=0
1
2
_
j
n

1
n
2
[1 + (1)
n
]
_
e
jnt
36(b)
c
n
=
1
T
_
T
0
f(t)e
jnt
dt =
a
T
_
T/2
0
sin te
jnt
dt, T =
2

=
a
2jT
_
T/2
0
(e
jt
e
jt
)e
jnt
dt
=
a
2jT
_

e
j(n1)t
j(n 1)
+
e
j(n+1)t
j(n + 1)
_
T/2
0
=
a
4
_
e
jnt
e
jt
n 1

e
jnt
e
jt
n + 1
_
T/2
0
=
a
4
_
_
e
jn
e
j
n 1

e
jn
e
j
n + 1

_
1
n 1

1
n + 1

_
Since e
j
= e
j
= 1, e
jn
= (1)
n
c
n
=
a
4
_

_
1
n 1

1
n + 1

(1)
n

_
2
n
2
1

_
=
a
2(n
2
1)
[1 + (1)
n
], n = 1
c
1
=
a
T
_
T/2
0
sin t(cos t j sin t)dt
=
a
T
_

1
2
cos 2t
j
2
(t
sin 2t
2
)
_
T/2
0
= ja/2
c
Pearson Education Limited 2004
232 Glyn James: Advanced Modern Engineering Mathematics, Third edition
Thus complex form of Fourier series is
f(t) =
a
2
sin t

n=
n=1
a
2(n
2
1)
[1 + (1)
n
]e
jnt
36(c)
c
n
=
1
2
__
0

2e
jnt
dt +
_

0
1e
jnt
dt
_
=
1
2
_
_

2
jn
e
jnt

+
_

1
jn
e
jnt

0
_
=
1
2jn
_
2 2e
jn
+e
jn
1
_
=
j
2n
[1 (1)
n
], n = 0
c
0
=
1
2
__
0

2dt +
_

0
1dt
_
= 3/2
Thus complex form of Fourier series is
f(t) =
3
2
+

n=
n=0
j
2n
[1 (1)
n
]e
jnt
36(d)
c
n
=
1
2
__
0

sin te
jnt
dt +
_

0
sin te
jnt
dt
_
=
1
4nj
__
0

(e
jt
e
jt
)e
jnt
dt +
_

0
(e
jt
e
jt
)e
jnt
dt
_
=
1
4j
__
0

_
e
j(n1)t
+e
j(n+1)t

dt +
_

0
_
e
j(n1)t
e
j(n+1)t

dt
_
=
1
4j
_
_

e
j(n1)t
j(n 1)
+
e
j(n+1)t
j(n + 1)

+
_
e
j(n1)t
j(n 1)

e
j(n+1)t
j(n + 1)

0
_
=
1
4
_

4
n
2
1

(1)
n
n 1
+
(1)
n
n + 1

(1)
n
n 1
+
(1)
n
n + 1
_
=
1
(n
2
1)
[1 + (1)
n
], n = 1
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 233
By direct calculation c
1
= 0. Thus complex form of Fourier series is
f(t) =

n=
n=1
1
(1 n
2
)
[1 + (1)
n
]e
jnt
=

n=
2
(1 4n
2
)
e
2jnt
By noting that | sin t | is periodic with period we could have obtained the series
from
f(t) =

n=
c
n
e
j2nt
with
c
n
=
1

_

0
sin te
j2nt
dt
=
1
2j
_

0
e
j(2n1)t
e
j(2n+1)t
dt
=
1
2
_
e
j2nt
e
jt
2n 1

e
j2nt
e
jt
2n + 1
_

0
=
2
(4n
2
1)
Giving f(t) =
2

n=
1
(1 4n
2
)
e
j2nt
37
a
0
=
1

_

0
dt = 1
a
n
=
1

_

0
cos ntdt =
1

_
1

sin nt

0
= 0
b
n
=
1

_

0
sin ntdt =
1

1
n
cos nt

0
=
1
n
(1 cos n) =
_
0, n even
2
n
, n odd
c
Pearson Education Limited 2004
234 Glyn James: Advanced Modern Engineering Mathematics, Third edition
Thus, by Parsevals theorem
1
2
_

0
1
2
dt =
1
4
a
2
0
+
1
2

n=1
b
2
n
or
1
2
=
1
4
+
1
2

n=1
4

2
(2n 1)
2
giving

n=1
1
(2n 1)
2
=
1
8

2
38(a) Fourier expansion is
f(t) =
a
0
2
+

n=1
a
n
cos nt +

n=1
b
n
sin nt
with =
2
T
= 100 and
a
0
=
2
T
_
T
0
f(1)dt = 100
_
1
50
0
500tdt = 10
a
n
=
2
T
_
T
0
f(t) cos 100ntdt = 100
_
1
50
0
500t cos 100ntdt
= 100.500
_
1
100n
t sin 100nt +
1
(100n)
2
cos 100nt
_
1
50
0
= 0
b
n
= 100
_
1
50
0
500t sin 100ntdt
= 100.500
_

t
100n
cos 100nt +
1
(100n)
2
sin 100nt
_
1
50
0
=
10
n
cos 2n =
10
n
Thus Fourier series expansion is
f(t) = 5 10

n=1
1
n
sin 100nt
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 235
38(b) From (4.66) RMS value given by
f
2
RMS
=
1
T
_
T
0
[f(t)]
2
dt = 50
_
1
50
0
(500t)
2
dt
=
100
3

2
328.987
f
RMS
= 18.14
Using
1
T
_
T
0
[f(t)]
2
dt =
1
4
a
2
0
+
1
2

n=1
(a
2
n
+b
2
n
)
estimates using
(i) First four terms :
1
4
a
2
0
+
1
2
(b
2
1
+b
2
2
+b
2
3
) 314.79
Thus f
RMS
17.74
(ii) First eight terms :
1
4
a
2
0
+
1
2
(b
2
1
+b
2
2
+b
2
3
+b
2
4
+b
2
5
+b
2
6
+b
2
7
) 322.32
Thus f
RMS
17.95
38(c) True RMS value given by
f
2
RMS
=
1
T
_
T
0
[f(t)]
2
dt = 50
_
1
50
0
(500t)
2
dt
=
100
3

2
328.987
f
RMS
= 18.14
% Error =
Actual - Estimate
Actual
100
giving the estimated percentage error in estimates (i) and (ii) as 2.20% and
1.05% respectively.
39(a)
c
n
=
1
5
_
5/4
0
60e
j
2n
5
t
dt
= 12
_

5
j2n
e
j
2n
5
t

5/4
0
=
30
jn
[1 e

jn
2
], n = 0
c
0
=
1
5
60
5
4
= 15
c
Pearson Education Limited 2004
236 Glyn James: Advanced Modern Engineering Mathematics, Third edition
First ve non-zero terms are :
c
0
=15 c
1
=
30
j
(1 +j) =
30

(1 j)
c
2
=
30
j
=
30

j c
3
=
10
j
(1 j) =
10

(1 j)
c
4
=0 c
5
=
6
j
(1 +j) =
6

(1 j)
39(b) Power associated with the ve non-zero terms are
P
0
=
15
2
15
= 15W
P
1
=
1
15
[2 | c
1
|
2
] =
2
15
(13.50)
2
= 24.30W
P
2
=
1
15
[2 | c
2
|
2
] =
2
15
(9.55)
2
= 12.16W
P
3
=
1
15
[2 | c
3
|
2
] =
2
15
(4.50)
2
= 2.70W
P
4
= 0
P
5
=
1
15
[2 | c
5
|
2
] =
2
15
(2.70)
2
= 0.97W
Total power delivered by the rst ve terms is
P = P
0
+P
1
+P
2
+P
3
+P
5
= 55.13W
39(c) Total power delivered by 15 resistor is
P =
1
15
_
1
5
_
5/4
0
60
2
dt

=
1
15

1
5
60
2

5
4
= 60W
39(d) % of total power delivered by the rst ve non-zero terms is
55.13
60
100 = 91.9%
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 237
Exercises 4.7.4
40
MSE =
1
2
__

[f(t)]
2
dt

n=1
b
2
n
_
Based on one term
(MSE)
1
=
1
2
_
2 (
4

)
2
_
= 0.19
Based on two terms
(MSE)
2
=
1
2
_
2 (
4

)
2
(
4
3
)
2
_
= 0.10
Based on three terms
(MSE)
3
=
1
2
_
2 (
4

)
2
(
4
3
)
2
(
4
5
)
2
_
= 0.0675
41(a) From given formula
P
0
(t) = 1
P
1
(t) =
1
2
d
dt
(t
2
1) = t
P
2
(t) =
1
8
d
2
dt
2
(t
2
1)
2
=
1
2
(3t
2
1)
or from given recurrence relationship
2P
2
(t) = 3tP
1
(t) P
0
(t) = 3t
2
1
Also from the relationship
3P
3
(t) = 5tP
2
(t) 2P
1
(t) =
5t
2
(3t
2
1) 2t
giving P
3
(t) =
1
2
(5t
3
3t)
41(b)
_
1
1
P
m
(t)P
n
(t)dt =
1
2
m+n
m!n!
_
1
1
D
m
(t
2
1)
m
D
n
(t
2
1)
n
dt, D
d
dt
=
1
2
m+n
m!n!
I
m,n
c
Pearson Education Limited 2004
238 Glyn James: Advanced Modern Engineering Mathematics, Third edition
Integrating by parts m times
I
m,n
= (1)
_
1
1
D
m1
(t
2
1)
m
D
n+1
(t
2
1)
n
dt
.
.
.
= (1)
m
_
1
1
D
0
(t
2
1)
m
D
n+m
(t
2
1)
n
dt
If m = n suppose m > n then m+n > 2n which implies that
D
n+m
(t
2
1)
n
= 0
so that I
m,n
= 0
If m = n then
I
m,n
= I
n,n
= (1)
n
_
1
1
(t
2
1)
n
D
2n
(t
2
1)
n
dt
= (2n)!(1)
n
_
1
1
(t
2
1)
n
dt
= 2(2n)!
_
1
0
(1 t
2
)
n
dt
Making the substitution t = sin then gives
I
n,n
= 2(2n)!
_
/2
0
cos
2n+1
d = 2(2n)!
2
2n + 1
. . .
2
3
=
2
2n+1
2n + 1
(n!)
2
and the result follows.
41(c) f(t) = c
0
P
0
(t) +c
1
P
1
(t) +c
2
P
2
(t) +. . .
Multiplying by P
0
(t)
_
1
1
f(t)P
0
(t)dt = c
0
_
1
1
P
2
0
(t)dt = 2c
0
giving
_
1
1
(1)1dt +
_
1
0
(1)1dt = 0 = 2c
0
so that c
0
= 0
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 239
Multiplying by P
1
(t)
_
1
1
f(t)P
1
(t)dt = c
1
_
1
1
P
2
1
(t)dt =
2
3
a
1
giving
_
0
1
(1)tdt +
_
1
0
(1)tdt = 1 =
2
3
c
1
so that c
1
=
3
2
Likewise
_
1
1
f(t)P
2
(t)dt = c
2
_
1
1
P
2
2
(t)dt =
2
5
c
2
giving
1
2
_
0
1
(1)(3t
2
1)dt +
1
2
_
0
1
(1)(3t
2
1)dt = 0 =
2
5
c
2
so that c
2
= 0
and
_
1
1
f(t)P
3
(t)dt = c
3
_
1
1
P
2
3
(t)dt =
2
7
c
3
giving
1
2
_
0
1
(1)(5t
3
3t)dt +
1
2
_
1
0
(1)(5t
3
3t)dt =
1
4
=
2
7
c
3
so that c
3
=
7
8
42 Taking
f(x) = c
0
P
0
(x) +c
1
P
1
(x) +c
2
P
2
(x) +c
3
P
3
(x) +. . .
and adopting same approach as in 41(c) gives
_
1
1
f(x)P
0
(x)dx = c
0
_
1
1
P
2
0
(x)dx = 2c
0
giving
_
1
0
xdx =
1
2
= 2c
0
so that c
0
=
1
4
_
1
1
f(x)P
1
(x)dx = c
1
_
1
1
P
2
1
(x)dx =
2
3
c
1
c
Pearson Education Limited 2004
240 Glyn James: Advanced Modern Engineering Mathematics, Third edition
giving
_
1
0
x
2
dx =
1
3
=
2
3
c
1
so that c
1
=
1
2
_
1
1
f(x)P
2
(x)dx = c
2
_
1
1
P
2
2
(x)dx =
2
5
c
2
giving
1
2
_
1
0
x(3x
2
1)dx =
1
8
=
2
5
c
2
so that c
2
=
5
16
_
1
1
f(x)P
3
(x)dx = c
3
_
1
1
P
2
3
(x)dx =
2
7
c
3
giving
1
2
_
1
0
x(5x
3
3x)dx = 0 =
2
7
c
3
so that c
3
= 0
43(a)
L
0
(t) = e
t
(t
0
e
t
) = 1
L
1
(t) = e
t
(te
t
+e
t
) = 1 t
Using the recurrence relation
L
2
(t) = (3 t)L
1
(t) L
0
(t) = t
2
4t + 2
L
3
(t) = (5 t)L
2
(t) 4L
1
(t)
= (5 t)(t
2
4t + 2) 4(1 t)
= 6 18t + 9t
2
t
3
43(b) This involves evaluating the integral
_

0
e
t
L
m
(t)L
n
(t)dt for the 10
combinations of m and n.
43(c) If f(t) =

r=0
c
r
L
r
(t) to determine c
n
multiply throughout by e
t
L
n
(t)
and integrate over (0, )
_

0
e
t
L
n
(t)f(t)dt =
_

0

r=0
c
r
e
t
L
r
(t)L
n
(t)dt
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 241
Using the orthogonality property then gives
_

0
e
t
L
n
(t)f(t)dt = c
n
_

0
e
t
L
n
(t)L
n
(t)dt
= c
n
(n!)
2
giving c
n
=
1
(n!)
2
_

0
e
t
L
n
(t)f(t)dt, n = 0, 1, 2, . . .
44(a) By direct use of formula
H
0
(t) = (1)
0
e
t
2
/2
e
t
2
/2
= 1
H
1
(t) = (1)e
t
2
/2
d
dt
e
t
2
/2
= t
Using recurrence relation
H
n
(t) = tH
n1
(t) (n 1)H
n2
(t)
H
2
(t) = t.t 1.1 = t
2
1
H
3
(t) = t(t
2
1) 2(t) = t
3
3t
H
4
(t) = t(t
3
3t) 3(t
2
1) = t
4
6t
2
+ 3
44(b) This involves evaluating the integral
_

e
t
2
/2
H
n
(t)H
m
(t)dt for the 10
combinations of n and m.
44(c) If f(t) =

r=0
c
r
H
r
(t) to determine c
n
multiply throughout by e
t
2
/2
H
n
(t)
and integrate over (, ) giving
_

e
t
2
/2
H
n
(t)f(t)dt =
_

r=0
c
r
e
t
2
/2
H
n
(t)H
r
(t)dt
= c
n
_

e
t
2
/2
H
n
(t)H
n
(t)dt
= c
n
_
(2)n!
c
Pearson Education Limited 2004
242 Glyn James: Advanced Modern Engineering Mathematics, Third edition
so that
c
n
=
1
n!
_
(2)
_

e
t
2
/2
f(t)H
n
(t)dt
45(a) Directly from the formula
T
0
(t) = cos 0 = 1
T
1
(t) = cos(cos
1
t) = t
then from the recurrence relationship
T
2
(t) = 2t(t) 1 = 2t
2
1
T
3
(t) = 2t(2t
2
1) t = 4t
3
3t
T
4
(t) = 2t(4t
3
3t) (2t
2
1) = 8t
4
8t
2
+ 1
T
5
(t) = 2t(8t
4
8t
2
+ 1) (4t
3
3t) = 16t
5
20t
3
+ 5t
45(b) Evaluate the integral
_
1
1
T
n
(t)T
m
(t)
_
(1 t
2
)
dt for the 10 combinations of n
and m.
45(c) If f(t) =

r=0
c
r
T
r
(t) to obtain c
n
multiply throughout by
c
n
T
n
(t)/
_
(1 t
2
) and integrate over (1, 1) giving
_
1
1
T
n
(t)f(t)
_
(1 t
2
)
dt =
_
1
1

r=0
c
r
T
n
(t)T
r
(t)
_
(1 t)
2
dt
= c
n
_
1
1
T
n
(t)T
n
(t)
_
(1 t
2
)
dt T
n
= 0, 1, 2, 3, . . .
=
_
c
0
, n = 0
c
n

2
, n = 0
Hence the required results.
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 243
46(a)
To show they are orthonormal on (0, T) evaluate the integral
_
T
0
W
n
(t)W
m
(t)dt
for the ten combinations of n and m. For example
_
T
0
W
0
(t)W
0
(t)dt =
_
T
0
1
T
at = 1
and it is readily seen that this extends to
_
T
0
W
2
n
(t)dt = 1
_
T
0
W
1
(t)W
2
(t)dt =
_
T/4
0
1
T
dt +
_
T/2
T/4
(1)
T
dt +
_
3T/4
T/2
1
T
dt +
_
T
3T/4
(1)
T
dt = 0
c
Pearson Education Limited 2004
244 Glyn James: Advanced Modern Engineering Mathematics, Third edition
46(b) f(t) = c
0
W
0
(t) + c
1
W
1
(t) + c
2
W
2
(t) + . . . where f(t) is the square wave
of Exercise 40. In this case T = 2. Multiplying throughout by the appropriate
Walsh function and integrating over (0, 2) gives
_
2
0
W
0
(t)f(t)dt = c
0
_
2
0
W
2
0
(t)dt = c
0
, W
0
(t) =
1

2
giving
c
0
=
1

2
_
2
0
1f(t)dt =
1

2
_
_

0
dt
_
2

dt

= 0
_
2
0
W
1
(t)f(t)dt = c
1
_
2
0
W
2
1
(t)dt = c
1
, W
1
(t) =
_
1

2
, 0 < t <

2
, < t < 2
giving
c
1
=
1

2
_
_

0
dt +
_
2

(1)(1)dt

2
_
2
0
W
2
(t)f(t)dt = c
2
, W
2
(t) =
_
1

2
, 0 < t <

2
,
3
2
< t < 2

2
,

2
< t <
3
2

giving
c
2
=
1

2
_
_
/2
0
(1)(1)dt +
_

2
(1)(1)dt +
_
3
2

(1)(1)dt +
_
2
3
2
(1)(1)dt

= 0
Mean square error based on three terms is
1
2
_
_
2
0
[f(t)]
2
dt
3

n=0
c
2
n

=
1
2
_
_
2
0
dt (

2)
2

= 0
This is zero in this case simply because the series based on three terms is exact as
W
2
(t) exactly matches the given square wave f(t).
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 245
Review Exercises 4.9
1
a
0
=
1

_

0
t
2
dt =
1

_
1
3
t
3
_

0
=

2
3
a
n
=
1

_

0
t
2
cos ntdt =
1

_
t
2
n
sin nt +
2t
n
2
cos nt
2
n
3
sin nt
_

0
=
2
n
2
cos n = 2
b
n
=
1

_

0
t
2
sin ntdt =
1

t
2
n
cos nt +
2t
n
2
sin nt +
2
n
3
cos nt
_

0
=
1

_
2
n
3
[(1)
n
1]

2
n
(1)
n
_
=
_

n
, n even
1

4
n
3
+

2
n
_
, n odd
Thus, Fourier series expansion is
f(t) =

2
6
+

n=1
2
n
2
(1)
n
cos nt +

n=1
_

2n 1

4
(2n 1)
3
_
sin(2n 1)t

n=1

2n
sin 2nt
Taking t = when the series converges to
2
/2 gives

2
2
=

2
6
+

n=1
2
n
2
(1)
n
(1)
n
=

n=1
2
n
2
i.e.

n=1
1
n
2
=

2
6
c
Pearson Education Limited 2004
246 Glyn James: Advanced Modern Engineering Mathematics, Third edition
2
a
0
=
2

__
/3
0
2
3
tdt +
1
3
_

/3
( t)dt
_
=
2

__
1
3
t
2
_
/3
0
+
1
3
_

1
2
( t)
2
_

/3
_
=
2
9
a
n
=
2

__
/3
0
2
3
t cos ntdt +
1
3
_

/3
( t) cos ntdt
_
=
2

__
2t
3n
sin nt +
2
3n
2
cos nt
_
/3
0
+
1
3
_
( t)
n
sin nt
1
n
2
cos nt
_

/3
_
=
2

_
1
n
2
cos
n
3

1
3n
2
[2 + cos n]
_
Thus the Fourier expansion of the even function is
f(t) =

9
+
2

n=1
1
n
2
_
cos
n
3

1
3
(2 + (1)
n
)
_
cos nt
At t =
1
3
the series converges to
2
9
.
3 Sketches of odd function f
1
(t) and even function f
2
(t), having period T and
equal to f(t), a t
1
2
T , are plotted for T t T below:
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 247
3(a) Half range Fourier sine series is
f(t) =

n=1
b
n
sin
2nt
T
with
b
n
=
4
T
__
/4
0
t sin
2nt
T
dt +
_
/2
/4
_
1
2
T t
_
sin
2nt
T
dt
_
=
4
T
__

Tt
2n
cos
2nt
T
+
T
2
(2n)
2
sin
2nt
T
_
t/4
0
+
_

T
2n
_
1
2
T t
_
cos
2nt
T

T
2
(2n)
2
sin
2nt
T
_
T/2
T/4
_
=
8T
(2n)
2
sin
n
2
=
_

_
0 , n even
2T
n
2

2
, n = 1, 5, 9, . . .

2T
n
2

2
, n = 3, 7, 11, . . .
Thus Fourier sine series expansion is
f(t) =
2T

n=1
(1)
n+1
(2n 1)
2
sin
2(2n 1)t
T
3(b) From the sketch of f
1
(t) the series converges to T/4 at t =
1
4
T .
3(c) Taking t =
1
4
T then sin
2(2n1)
T
t = (1)
n+1
giving
1
4
T =
2T

n=1
1
(2n 1)
3
so that the sum of the series

n=1
1
(2n1)
3
is

2
8
.
4
g(x)[c +f(x)] = cg(x) +g(x)f(x)
= cg(x) cg(x)f(x) from the given information
= g(x)[c +f(x)]
c
Pearson Education Limited 2004
248 Glyn James: Advanced Modern Engineering Mathematics, Third edition
Thus the product is an odd function.
Since y = is an odd function and y =
2
is an even function it follows from the
above that F() is an odd function. Thus it has a Fourier series of the form
F() =

n=1
b
n
sin n
with
b
n
=
2

_

0
1
12
(
2

2
) sin nd
=
1
6
_

2
_

n
cos n +
1
n
2
sin n

3
n
cos n +
3
2
n
2
sin n
6
n
3
cos n +
6
n
4
sin n

0
_
=
1
6
_

6
n
3
cos n
_
=
1
n
3
(1)
n+1
Thus the Fourier expansion is
F() =

n=1
(1)
n+1
n
3
sin n
5
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 249
Clearly f(t) is an odd function so it has a Fourier expansion of the form
f(t) =

n=1
b
n
sin nt
with
b
n
=
2

__
/2
0
t sin ntdt +
_

/2
(t ) sin ntdt
_
=
2

__
t
n
cos nt
1
n
2
sin nt
_
/2
0
+
_

(t )
n
cos nt +
1
n
2
sin nt
_

/2
_
=
2

2
n
2
sin
n
2
_
Thus Fourier expansion is
f(t) =
4

n=1
(1)
n
(2n 1)
2
sin(2n 1)t
6
f(x)
1/2
1 1 0 x
Since f(x) is an even function, over the interval 1 x 1, it may be represented
within this range by the Fourier cosine expansion
f(x) =
a
0
2
+

n=1
a
n
cos nx
c
Pearson Education Limited 2004
250 Glyn James: Advanced Modern Engineering Mathematics, Third edition
with
a
0
=
2
1
_

0
1
2
dx = 2
_
1
2
x
_

0
= 1
a
n
=
2
2
_

0
cos nxdx =
1

_
1
n
sin nx
_

0
=
1
n
sin n
Thus Fourier expansion is
f(x) =
1
2
+

n=1
sin n
n
cos nx
valid in the interval 1 x 1
7 Half range Fourier sine expansion is
f(t) =

n=1
b
n
sin nt
with
b
n
=
2

_

0
_
1
t

_
2
sin ntdt
=
2

1
n
_
1
t

_
2
cos nt
2
n
2

_
1
t

_
sin nt +
2
n
3

2
cos nt
_

0
=
2
n
+
4
n
3

3
[(1)
n
1]
Thus Fourier expansion is
f(t) =

n=1
2
n
_
1
2
n
2

2
[1 (1)
n
] sin nt
_
8 Half range Fourier sine expansion is
f(x) =

n=1
b
n
sin nxdx
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 251
with
b
n
=
2

__
/2
0
xsin nxdx +
_

/2
( x) sin nxdx
_
=
2

__

x
n
cos nx +
1
n
2
sin nx
_
/2
0
+
_

( x)
n
cos nx
1
n
2
sin nx
_

/2
_
=
4
n
2

sin
n
2
Thus half range Fourier sine expansion is
f(x) =
4

n=1
(1)
n+1
(2n 1)
2
sin(2n 1)x
Half range Fourier cosine expansion is
f(x) =
a
0
2
+

n=1
a
n
cos nx
with
a
0
=
2

__
/2
0
xdx +
_

/2
( x)dx
_
=

2
a
n
=
2

__
/2
0
xcos nxdx +
_

/2
( x) cos nxdx
_
=
2

__
x
n
sin nx +
1
n
2
cos nx
_
/2
0
+
_
x
n
sin nx
1
n
2
cos nx
_

/2
_
=
2

_
2
n
2
cos
n
2

2
n
2

2
n
2
cos n
_
=
_
0, n odd
4
n
2
_
(1)
n/2
1

, n even
Thus Fourier cosine expansion is
f(x) =

4

2

n=1
cos 2(2n 1)x
(2n 1)
2
c
Pearson Education Limited 2004
252 Glyn James: Advanced Modern Engineering Mathematics, Third edition
Sketches of the functions represented by the two Fourier series are:
9
a
0
=
1

e
x
dx =
1

[e

] =
2

sinh
a
n
=
1

e
x
cos nxdx =
n
2
n
2
+ 1

_
1
n
e
x
sin nx +
1
n
2
e
x
cos nx
_

=
(1)
n
(n
2
+ 1)
[e

] =
2(1)
n
(n
2
+ 1)
sinh
b
n
=
1

e
x
sin nxdx =
n
2
(n
2
+ 1)
_

e
x
n
cos nx +
e
x
n
2
sin nx
_

=
n(1)
n
(n
2
+ 1)
sinh
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 253
Thus Fourier expansion is
f(x) =
1

sinh +
2

n=1
(1)
n
n
2
+ 1
sinh cos nx
2

n=1
(1)
n
n
2
+ 1
sinh cos nx
=
2

2
sinh
_
1
2
+

n=1
(1)
n
n
2
+ 1
(cos nx nsin x)
_
10(a) Half range Fourier sine expansion is
f(t) =

n=1
b
n
sin nt
with
b
n
=
2

_

0
( t) sin ntdt
=
2

( t)
n
cos nt
1
n
2
sin nt
_

0
=
2
n
Thus Fourier sine expansion is
f(t) =

n=1
2
n
sin nt
10(b) Half range Fourier cosine expansion is
f(t) =
a
0
2
+

n=1
a
n
cos nt
with
a
0
=
2

_

0
( t)dt =
a
n
=
2

_

0
( t) cos ntdt =
2

_
( t)
n
sin nt
1
n
2
cos nt
_

0
=
2
n
2
[1 (1)
n
] =
_
0, n even
4
n
2
, n odd
c
Pearson Education Limited 2004
254 Glyn James: Advanced Modern Engineering Mathematics, Third edition
Thus Fourier cosine expansion is
f(t) =
1
2
+
4

n=1
1
(2n 1)
2
cos(2n 1)t
Graphs of the functions represented by the two series are:
(a)
(b)
11 Since f(t) is an even function it has a Fourier series expansion
f(t) =
a
0
2
+

n=1
a
n
cos nt
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 255
where
a
0
=
1

f(t)dt =
1

__
0

tdt +
_

0
tdt
_
=
a
n
=
1

__
0

t cos ntdt +
_

0
t cos ntdt
_
=
1

_
_

t
n
sin nt
cos nt
n
2

+
_
t
n
sin nt +
1
n
2
cos nt

0
_
=
2
n
2
(cos n 1) =
_
0, n even

4
n
2
, n odd
Thus the Fourier expansion of f(t) is
f(t) =

2

4

n=1
1
(2n 1)
2
cos(2n 1)t
Since
dx
dt
+x = f(t) is linear, response is sum individual responses.
Steady state response corresponds to the Particular Integral. For f
0
(t) =

2
steady
state response is x
0
(t) =

2
.
When f(t) = cos t then steady state response is of the form x = Acos t +
Bsin t. Substituting back and comparing coecients of sint and cos t gives
A =
1
1 +
2
, B =

1 +
2
Taking = (2n 1) then required steady state response is
x =
1
2

4

n=1
1
(2n 1)
2
_
cos(2n 1)t + (2n 1) sin(2n 1)t
1 + (2n 1)
2
_
12 Since f(t) is an even function Fourier series expansion is
f(t) =
a
0
2
+

n=1
a
n
cos nt
c
Pearson Education Limited 2004
256 Glyn James: Advanced Modern Engineering Mathematics, Third edition
where
a
0
=
1

_
2
0
f(t)dt =
1

__

0
t

dt +
_
2

(2 t)

dt
_
=
1

2
_
_
1
2
t
2

0
+
_
2t
1
2
t
2

_
= 1
a
n
=
1

2
__

0
t cos ntdt +
_
2

(2 t) cos ntdt
_
=
1

2
_
_
t
n
sin nt +
1
n
2
cos nt

0
+
_
(2 t)
n
sin nt
1
n
2
cos nt

_
=
2

2
n
2
(cos n 1) =
_

4
n
2

2
, n odd
0, n even
Thus Fourier series expansion is
f(t) =
1
2

4

n=0
cos(2n + 1)t
(2n + 1)
2
It can be shown by direct substitution that this satises the given dierential
equation. Alternatively we solve the dierential equation
d
2
y
dt
2
+
2
y =
1
2

n=0

n
cos
n
t, not integer
Solving the unforced system gives the complementary function as
y
1
= Acos t +Bsin t
The particular integral is the sum of the PIs for the individual terms in f(t).
In the case of the
1
2
on the RHS response is
y
2
=
1
2
2
For the term
n
cos
n
t the PI is of the form
y

n
= C cos
n
t +Dsin
n
t
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 257
Substituting in
d
2
y
dt
2
+
2
y =
n
cos
n
t and comparing coecients gives
C =
n
/(
2

2
n
), D = 0 so that
y

n
=

n

2
n
cos
n
t
Thus, the solution of the dierential equation is
y = Acos t +Bsin t +
1
2
2

n=0

2
n
cos
n
t
From the given initial condition y = dy/dt = 0 at t = 0 so that
B = 0 and A =
1
2
2
+

n=0

2
n
giving on taking
n
= 4/[
2
(2n + 1)
2
],
n
= (2n + 1)
y =
1
2
2
(1 cos t)
4

n=0
cos(2n + 1)t cos t
(2n + 1)
2
[
2
(2n + 1)
2
]
13(a) Since f(t) is an even function Fourier expansion is
f(t) =
a
0
2
+

n=1
a
n
cos nt
where
a
0
=
1

f(t)dt =
1

__
0

tdt +
_

0
tdt
_
=
a
n
=
1

__
0

t cos ntdt +
_

0
t cos ntdt
_
=
1

_
_

t
n
sin nt
cos nt
n
2

+
_
t
n
sin nt +
cos nt
n
2

0
_
=
2
n
2
(cos n 1) =
_
0, n even

4
n
2
, n odd
Thus Fourier expansion f(t) is
f(t) =

2

4

n=1
1
(2n 1)
2
cos(2n 1)t
c
Pearson Education Limited 2004
258 Glyn James: Advanced Modern Engineering Mathematics, Third edition
Since b
n
= 0 Parsevals theorem gives
1
2
_

[f(t)]
2
dt =
1
4
a
2
0
+
1
2

n=1
a
2
n
i.e.

2
3
=

2
4
+
1
2

16

n=1
1
(2n 1)
4
or, rearranging,

n=1
1
(2n 1)
4
=

4
96
13(b) Dierentiating formally term by term we obtain the Fourier expansion of
the square wave at
g(t) =
4

n=1
1
(2n 1)
sin(2n 1)t
Check. Since g(t) is an odd function it has Fourier expansion
g(t) =

n=1
b
n
sin nt
where
b
n
=
1

_
_
0

sin ntdt +
_

0
sin ntdt

=
1

_
_
1
n
cos nt

+
_

1
n
cos nt

0
_
=
2
n
[1 cos n] =
_
4
n
, n odd
0, n even
conrming the Fourier expansion as
g(t) =
4

n=1
1
(2n 1)
sin(2n 1)t
14 Complex form of the Fourier series is
f(t) =

n=
c
n
e
jnt
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 259
where
c
n
=
1
2
_

sin
t
2
e
jnt
dt
=
1
4j
_

_
e
1
2
jt
e

1
2
jt

e
jnt
dt
=
1
4j
_

_
e
j(n
1
2
)t
e
j(n+
1
2
)t

dt
=
1
4j
_
e
j(n
1
2
)t
j(n
1
2
)

e
j(n+
1
2
)t
j(n +
1
2
)
_

Using the results e

jn
= cos n +j sin n = (1)
n
= e
jn
e
1
2
j
= cos

2
+j sin

2
= j, e
j

2
= j
gives
c
n
=
1
4
_
j
(n
1
2
)
+
j
(n +
1
2
)
+
j
(n
1
2
)
+
j
(n +
1
2
)
_
(1)
n
=
j(1)
n

_
4n
4n
2
1
_
Thus, the complex form of the Fourier series is
f(t) =

n=
4nj(1)
n
(4n
2
1)
e
jnt
15(a) Following the same procedure as in Exercise 11 gives
a
0
=
20

a
n
=
_
0, n odd, n = 1
20
(n
2
1)
, n even
a
1
= 0
b
n
= 0, n = 1
b
1
= 5
so that the Fourier representation is
v(t) =
10

+ 5 sin
0
t
20

n=1
cos 2n
0
t
4n
2
1
,
0
=
2
T
c
Pearson Education Limited 2004
260 Glyn James: Advanced Modern Engineering Mathematics, Third edition
15(b)
Total power =
1
T
_
T/2
0
100. sin
2

0
tdt
=
50
T
_
T/2
0
(1 cos 2
0
t)dt = 25
Thus total average power delivered to 10 resistor is
P
av
=
25
10
= 2.5W
Coecient second harmonic in series expansion v(t) is a
2
=
20
3
When applied to 10 resistor power associated with this harmonic is
1
2
_
20
3
_
2
1
10
=
20
9
2
W
Thus % of the total power carried by the second harmonic is
100
P
av

20
9
2
=
800
9
2
9.01
16(a) A sketch of g(t) is
16(b) Over the period < t < g(t) is dened by
g(t) = 1, < t < 0
g(t) = 1, 0 < t <
Since g(t) is an odd function it has a Fourier series expansion of the form
g(t) =

n=1
b
n
sin nt
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 261
with b
n
=
2

_

0
1. sin ntdt
=
2

1
n
cos nt

0
=
2
n
[1 (1)
n
] =
_
0, n even
4
n
, n odd
Thus the Fourier expansion of g(t) is
g(t) =
4

n=1
sin(2n 1)t
(2n 1)
giving the Fourier expansion of f(t) = 1 +g(t) as
f(t) = 1 +
4

n=1
sin(2n 1)t
(2n 1)
17 Complex form of Fourier expansion is
f(t) =

n=
c
n
e
jnt
where c
n
=
1
2
_
2
0
f(t)e
jnt
dt =
1
2
_
2
0
te
jnt
dt
=
1
2
_

t
jn
e
jnt
+
1
n
2
e
jnt
_
2
0
Using the results e
j2n
= cos 2n j sin 2n = 1, e
o
= 1 or have
c
n
=
1
2
_

2
jn

=
1
jn
=
j
n
, n = 0
When n = 0, c
0
=
1
2
_
2
0
tdt =
Hence complex Fourier series is
f(t) = +

n=
n=0
j
n
e
jnt
c
Pearson Education Limited 2004
262 Glyn James: Advanced Modern Engineering Mathematics, Third edition
18(a) Since v(t) is an odd function its Fourier expansion is of the form
v(t) =

n=1
b
n
sin
2nt
T
with b
n
=
4
T
_
T/2
0
1. sin
2nt
T
dt
=
4
T
_

T
2n
cos
2nt
T
_
T/2
0
=
2
n
[1 cos n]
i.e. b
n
=
_
0, n even
4
n
, n odd
Thus Fourier expansion is
v(t) =
4

n=1
1
(2n 1)
sin
2(2n 1)t
T
18(b) Response i

(t) of the circuit is given by

di

(t)
dt
+i

(t) = v

(t) = sin t
Taking Laplace transforms with i

(0) = 1 gives
I

(s) =

(s + 1)(s
2
+
2
)
=

2
+ 1

1
(s + 1)

2
+ 1

s
s
2
+
2
+
1

2
+ 1

2
s
2
+
2
which on taking inverse transforms gives the response as
i

(t) =

2
+ 1
e
t

2
+ 1
cos t +
1

2
+ 1
sin t
Since the rst term decays to zero the steady state response is
i
ss
=
1

2
+ 1
(sin t cos t)
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 263
As the system is linear steady state response i
s
(t) to the square wave v(t) is
i
s
(t) =

n=1
i

n
(t)
where i

n
(t) is the steady state response to v

n
(t) with

n
= 2(2n 1)/T
Thus
i
s
(t) =
4

n=1
1
(2n 1)
_
1

2
n
+ 1

(sin
n
t
n
cos
n
t)
19(a)
cos
n
=
_
1
2
(e
j
+e
j
)

n
=
1
2
n
_
e
nj
+
_
n
1
_
e
(n2)j
+. . . +e
nj

=
1
2
n
_
(e
nj
+e
nj
) +
_
n
1
_
(e
(n2)j
+e
(n2)j
) +. . .

Hence
cos
2
=
1
2
2
_
2 cos 2 +
_
2
1
_
2 cos(2 2) +. . . +
_
2
1
_
2 cos 2 +
_
2

Putting cos = t
t
2
=
1
2
1
_
T
2
(t) +
_
2
1
_
T
22
(t) +. . . +
_
2
1
_
T
2
(t) +
1
2
_
2

_
T
0
(t)

t
21
=
1
2

_
T
2+1
(t) +
_
2 + 1
1
_
T
21
(t) +. . . +
_
2 + 1

_
T
1
(t)

Note that T
0
(t) may be omitted.
c
Pearson Education Limited 2004
264 Glyn James: Advanced Modern Engineering Mathematics, Third edition
19(b) cos n + cos(n 2) = 2 cos(n 1) cos Hence putting = cos
1
t
T
n
(t) +T
n2
(t) = 2tT
n1
(t)
19(c)
T
0
(t) = cos(0. cos
1
t) = cos 0 = 1
T
1
(t) = cos(1. cos
1
t) = cos(cos
1
t) = t
T
2
(t) = 2tT
1
(t) T
0
(t) = 2t
2
1
T
3
(t) = 2t(2t
2
1) t = 4t
3
3t
19(d)
t
5
5t
4
+ 7t
3
+ 6t 8 =
1
2
4
(T
5
(t) + 5T
3
(t) + 10T
1
(t))

5
2
3
(T
4
(t) + 4T
2
(t) + 3) +
7
2
2
(T
3
(t) + 3T
1
(t))
+ 6T
1
(t) 8
=
1
16
T
5
(t)
5
8
T
4
(t) +
33
16
T
3
(t)

5
2
T
2
(t) +
95
8
T
1
(t)
79
8
T
0
(t)
19(e) The required cubic polynomial is obtained by omitting the rst two terms.
It is therefore
33
16
(4t
3
3t)
5
2
(2t
2
1) +
95
8
t
79
8
or
33
4
t
3
5t
2
+
91
16
t
59
8
Since | T
n
(t) | 1 over (1, 1) the error can nowhere exceed
1
16
+
5
8
=
11
16
in
absolute value. An error of this magnitude occurs at t = 1, since T
n
(1) =
cos n = (1)
n
.
c
Pearson Education Limited 2004
Glyn James: Advanced Modern Engineering Mathematics, Third edition 265
20
If the input is x(t) = X
i
sin t then the input and output y(t) waveforms to the
nonlinear element are shown in the gure. Clearly the output waveform is an odd
function of period / and over the interval 0 < t < /
y(t) =
_
_
_
0, 0 < t < t
1
M, t
1
< t <

t
1
0,

t
1
< t <

The amplitude of the fundamental harmonic is

b
1
=
2
/
_
/
0
y(t) sin tdt
=
2

_
/t
1
t
1
M sin tdt
=
2M

[cos( t
1
) cos t
1
]
=
4M

cos t
1
Since sin t
1
=

2X
i
we obtain cos t
1
=
_
1
_

2X
i
_
2
c
Pearson Education Limited 2004
266 Glyn James: Advanced Modern Engineering Mathematics, Third edition
Thus the required describing function is
N(X
i
) =
4M
X
i
_
1
_

2X
i
_
2
_
1
2
Limit cycle will occur if N(X
i
)
1
KG(j)
N(X
i
) will have a maximum value when
dN
dX
i
= 0; that is, when X
i
= /

2.
Maximum value is N(X
i
)
max
=
4M

. Since this is real we are only interested in

real values of 1/(KG(j)).
In this case
1
KG(j)
=
1
K
j(T
1
j + 1)(T
2
j + 1)
=
1
K
[T
1
T
2
j
3
(T
1
+T
2
)
2
+j]
and for this to be real
T
1
T
2

3
+ = 0 giving
2
= 1/(T
1
T
2
)
At this frequency
magnitude
1
KG(j)
=
_
T
1
+T
2
K
_

2
=
(T
1
+T
2
)
KT
1
T
2
and the required result follows, namely that limit cycles will not occur if
>
4MK

T
1
T
2
T
1
+T
2
c
Pearson Education Limited 2004