Typos in FFT

[Planet6174]

http://jeffe.cs.illinois.edu/teaching/algorithms/notes/A-fft.pdf

Page 6:

At first glance, this result seems pointless;

Page 9:

The innermost sum in this expression is one coefficient of a discrete Fourier transform of order q , and the outermost sum is one coefficient of a discrete Fourier transform of order q p

Page 10:

C[j,·] ← FFT(C[j,·]) ==> C[j,·] ← FFT(B[j,·])

[raenye]

Two more typos (same file as above).
Page 3 line 3: "O(n^{1+epsilon}) for your favorite e>0". Both should be epsilon.
Page 3 line 4: "these algorithms not worth the trouble". Missing verb ("are").