How profilers work - prime generator

primes.py

def is_prime(n):
    for i in range(2, n):
        if n % i == 0:
            return False
    return True

def sum_of_digits(n):
    s = 0
    while n:
        s += n % 10
        n //= 10
    return s

def get_primes(n):
    primes = []
    candidate = 2
    while len(primes) < n:
        if is_prime(candidate) and sum_of_digits(candidate) % 2 == 0:
            primes.append(candidate)
        candidate += 1
    return primes