#Lab #8
#Due Date: 02/22/2019, 11:59PM
########################################
#
# Name: Hunter Schuler
# Collaboration Statement: I neither sought nor gave assistance
#
########################################
def isPrime(n, i = 2):
    # i is a preloaded divisor
    # If n is 0 or 1, return false
    if n < 2:
        return False
    if n == 2:
        return True
    # If n is evenly divisible by the divisor, return false
    if n % i == 0:
        return False
    # If i^2 is greater than n, it must be a prime number
    if n < i**2:
        return True
    # Recursively increase i until a condition is met
    return isPrime(n, i+1)
