This lesson's interactive features are locked, please to keep using them
Prime Factoring Review
Consider the code from the last assignment:
def prime_factors(n: int) -> list[int]:
prime_factors = []
while n % 2 == 0:
n /= 2
prime_factors.append(2)
for i in range(3, int(math.sqrt(n)) + 1, 2):
while n % i == 0:
n /= i
prime_factors.append(i)
if n > 2:
prime_factors.append(int(n))
return prime_factors