import math


def isPrimeTrialDiv(num: int) -> bool:
    """Is prime trial division

    Uses the `trial division`_ algorithm for testing if a given number is prime.

    Args:
         num: Integer to determine if prime.

    Returns:
        True if num is a prime number, otherwise False.

    .. _trial division:
        https://en.wikipedia.org/wiki/Trial_division
    """
    # All numbers less than 2 are not prime:
    if num < 2:
        return False

    # See if num is divisible by any number up to the square root of num:
    for i in range(2, int(math.sqrt(num)) + 1):
        if num % i == 0:
            return False
    return True