pe7.py

############################################################################################################################
#
# Problem 7
#
# By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
#
# What is the 10001st prime number?
#
# Ans: 104743
############################################################################################################################

def isPrime(num: int) -> bool:
    '''
    Args:
        num (int): number to check if prime
    Returns:
        (bool): True if prime, false if not
    '''
    if num == 1:
        return False
    elif num == 2:
        return True
    elif num % 2 == 0:
        return False
    else:
        # Check if i divides the first half of num
        for i in range(2, num//2+1):
            if num % i == 0:
                return False
        return True

def nPrimes(n: int) -> list:
    '''
    Args:
        n (int > 0): The index of the prime number to return
    
    Returns:
        primes (List[int]): A list of the first n primes
    '''
    i = 2 
    primes = []
    while len(primes) <= n-1:
        if isPrime(i):
            primes.append(i)
        i += 1
    return primes


if __name__ == "__main__":        
    print(nPrimes(10001)[-1])