import math


def is_prime_v2(n):
    """Version 2 of finding if number is prime
    it uses
    Runtime: O(sqrt(N))"""
    if n == 1:
        return False
    max_divisor = math.floor(math.sqrt(n))
    for divisor in range(2, 1 + max_divisor):
        if n % divisor == 0:
            return False
    return True