Prime factorization – list
A simple trial division: def primes(n): primfac = [] d = 2 while d*d <= n: while (n % d) == 0: primfac.append(d) # supposing you want multiple factors repeated n //= d d += 1 if n > 1: primfac.append(n) return primfac with O(sqrt(n)) complexity (worst case). You can easily improve it by special-casing … Read more