Nick Volynets nvdv

## det_prof.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

## stat_prof_full.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
	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