def is_prime(number):
    """Check if a number is prime."""
    
    # In case the number is in the range [0, 3], then the result happens to be the same as the logical expression: N > 1.
    if number <= 3:
        return number > 1

    # Check if said number is divisible by either two or three.
    if not number % 2 or not number % 3:
        return False


    # This is a prime number in the form 6k +/- 1, where k = {1, 2, 3,...}.
    i = 5 # This is the smallest number in said form for k = 1.

    while i**(2) <= number:
        if not number % i or not number % (i + 2): # This is the smallest number in said form for k = 1.
            return False

        i += 6 # This is the same as incrementing the value of k.

    # In case the number has no divisors in the range [2, sqrt(N)], then it must be prime.
    return True