pub fn next_fast_fft_size(size: usize) -> usize
Find next size that is efficient for FFT
FFT is most efficient when the size factors into small primes (2, 3, 5). This finds the smallest n >= size that satisfies this.