check_for_primes

superfreq.check_for_primes(n, max_prime=41)[source]

Given an integer, n, ensure that it doest not have large prime divisors, which can wreak havok for FFT’s. If needed, will decrease the number.

Parameters:

n : int

Integer number to test.

Returns:

n2 : int

Integer combed for large prime divisors.