find_next_prime.py

# Test if a number is prime
def is_prime(x):      
        for n in range(2, x - 1):
            if x % n == 0:
                return False
                
        else:
            return True
        
# test # print is_prime(17)

# find the next prime number
def find_next_prime(x):
    while is_prime(x) == False:
        x += 1
    else:
        return x
        
print find_next_prime(6)