[Project Euler] Problem 3: Largest prime factor (incomplete)

https://projecteuler.net/problem=3

from typing import List

def is_prime(my_target: int, my_primes: List[int]) -> bool:

for prime in my_primes:

if my_target % prime == 0:

return False

return True

def get_primes(my_target: int) -> List[int]:

my_primes: List[int] = []

for number in range(2, my_target + 1):

if is_prime(number, my_primes):

my_primes.append(number)

return my_primes

def get_factors(my_target: int, my_numbers: List[int]) -> List[int]:

my_factors: List[int] = []

for number in my_numbers:

if my_target % number == 0:

my_factors.append(number)

return my_factors

target: int = 600851475143

primes: List[int] = get_primes(target)

print('primes:', primes)

prime_factors: List[int] = get_factors(target, primes)

print('prime factors', prime_factors)