Prime number factorization function

prime-factorization.py

import os
import sys
from typing import *

def is_prime(n: int) -> bool:
	if n < 2:
		return False
	return all(n % i for i in range(2, int(math.sqrt(n)) + 1))

def get_prime_factors(n: int) -> List[int]:
	prime_factors: List[int] = []
	d = 2
	while d * d <= n:
		while n % d == 0:
			n //= d
			prime_factors.append(d)
		d += 1
	if n > 1:  # to avoid 1 as a factor
		assert d <= n
		prime_factors.append(n)
	return prime_factors