
Methods of Mathemetical Physics I
Assignment II
Due on Friday, September 29, 2023.
Solve all the problems. Each problem carries 10 marks.
Problem 1. Find the discrete Fourier transform (DFT)
˜
A(p) of the following function, with
2N + 1 points
A(n) =
1 0 ≤ n ≤ W −1
1 2N + 1 − W ≤ n ≤ 2N
0 otherwise
Figure 1. Sketch of the function A(n)
Apply the appropriate theorem if required to simplify the evaluation of the DFT. Take the limit
of this DFT when N → ∞ and W = x
√
2
N
+ 1
and
p
=
k
√
2
N
+ 1
.
Problem 2. Derive the convolution theorem for discrete Fourier transforms, dened as
A(n) =
1
√
N
N−1
X
p=0
˜
A(p)e
2πi
N
pn
a) That is, if
˜
C(p) =
˜
A(p)
˜
B(p), express C(n) in terms of A(n) and B(n).
b) Use this to derive the discrete Fourier transform (DFT) of the following array:
C(n) =
(
1 −
|n|
5
for|n| ≤ 5
0 otherwise
Figure 2. Sketch of C(n)