Correct answer is (d) \(\frac{1}{N} \sum_{n=0}^{N-1}x(n)e^{-j2πkn/N}\)
To explain: We know that, the Fourier series representation of a discrete signal x(n) is given as
x(n)=\(\sum_{n=0}^{N-1}c_k e^{j2πkn/N}\)
Now multiply both sides by the exponential e^-j2πln/N and summing the product from n=0 to n=N-1. Thus,
\(\sum_{n=0}^{N-1} x(n)e^{-j2πln/N}=\sum_{n=0}^{N-1}\sum_{k=0}^{N-1}c_k e^{j2π(k-l)n/N}\)
If we perform summation over n first in the right hand side of above equation, we get
\(\sum_{n=0}^{N-1} e^{-j2πkn/N}\) = N, for k-l=0,±N,±2N…
= 0, otherwise
Therefore, the right hand side reduces to Nck
So, we obtain ck=\(\frac{1}{N} \sum_{n=0}^{N-1}x(n)e^{-j2πkn/N}\)