smallest_multiple.py
def isPrime(num):
    '''
    num: number to check -> integer
    :return: if the number is a prime number
    :rtype: boolean
    '''
    isPrime = True # initially set to True

    for factor in range(2, round(sqrt(num))+1): # range of two to the approximate square root of the number, anything after that would be duplicate factor pairs and therefore redundant
        if num % factor == 0: # if divisible 
            isPrime = False # set prime to False

    return isPrime

    num: number to check -> integer
    :return: if the number is a prime number
    :rtype: boolean
    
number to check -> integer
number to check - > integer
def isPrime(num):
    isPrime = True 
    for factor in range(2, round(sqrt(num))+1): 
        if num % factor == 0: 
            isPrime = False 
    return isPrime
def isPrime ( num ) : isPrime = True for factor in range ( 2 , round ( sqrt ( num ) ) + 1 ) : if num % factor == 0 : isPrime = False return isPrime
num: number to check -> integer
num : number to check - > integer
'''
    num: number to check -> integer
    :return: if the number is a prime number
    :rtype: boolean
    ''' # initially set to True # range of two to the approximate square root of the number, anything after that would be duplicate factor pairs and therefore redundant # if divisible  # set prime to False
if the number is a prime number
if the number is a prime number
boolean
num