In the introduction of the recusion step, there was the assumption chosen that *n=2m*, so an even number.

Questions

0) If the *m* is a odd number the recursion would end just end after one recusive step, which will not be the idea, right?

1)Will the fast fourier transformation still work with only one or none (or n is a odd number) recursiv step with Dept=O(log(N)) and Work=O(N*log (N))?

2)Is it okay to extend the F(w,n) Matrix to a F(w,2^{l}) Matrix where 2^{l }is the next potence of 2 by adding (0,0,....,0) rows and extend x by 2^{l }-n '0' rows?