exercise1.py

def is_prime(n):
    prime = False
    for divisor in range(2, n):
        if n % divisor == 0:
            return prime
        else:
            continue
    prime = True
    return prime

def next_prime(n):
    prime_found = False
    while prime_found == False:
        n = n + 1
        if is_prime(n) == True:
            prime_found == True
            return n