mead_maths.py

def is_prime(n: int) -> int:
    '''
    Returns True if the number 'n' is prime
    '''
    prime = True
    for i in range(2, n):
        if n % i == 0:
            prime = False
            break
    return prime


def sum_of_digits(n: int) -> int:
    '''
    Calculates the sum of the digits of a number
    '''
    tot = 0
    for digit in str(n):
        tot += int(digit)
    return tot


def product_of_digits(n: int) -> int:
    '''
    Calculates the product of the digits of a number
    '''
    tot = 1
    for digit in str(n):
        tot *= int(digit)
    return tot


def is_even(num: int) -> bool:
    '''
    Returns true if integer is even
    '''
    if num % 2 == 0:
        return True
    else:
        return False


def is_odd(num: int) -> bool:
    '''
    Returns true if integer is odd
    '''
    return not is_even(num)


def ceiling(a: float, b: float) -> int:
    '''
    Ceiling division a/b
    TODO: Could also use math.ceiling
    TODO: What about floor?
    '''
    return -(-a // b)


def reverse_digits(old_number: int) -> int:
    '''
    Reverses the digits of integer n
    '''
    new_number = 0
    n = old_number
    while n != 0:
        last_digit = n % 10  # Isolate the final digit using modulus
        n = n//10  # Floor division to remove the final digit
        new_number = new_number*10+last_digit  # Construct new number
    return new_number
    # return int(str(n)[::-1]) # Easy using strings


def remainder_division(a: int, b: int) -> tuple:
    '''
    Returns the whole division and remainder of a/b
    '''
    whole = a//b
    remainder = a % b
    return whole, remainder