Somtoo62

import math

def is_prime(n):
    # Prime numbers must be greater than 1
    if n < 2:
        return False
    # Check for factors from 2 up to the square root of n
    # This is the most efficient basic way to check for primality
    for i in range(2, int(math.sqrt(n)) + 1):
        if n % i == 0: