A note on exact discrete Fourier transforms

It is proved that the z transform of a sequence of data values cannot be exactly computed using a binary number representation for values of z on the unit circle, except z =±1, z = ±j. It is also proved that the discrete Fourier transform (DFT) of a sequence of data values cannot be evaluated with rational numbers.