project_euler_07.py

#python3
def is_prime_num(num) :
    for i in range(2, int(num**0.5) + 1):
        if num % i==0:
            return False
    return True

def find_prime_num(seq_range_to) :
    num = 3
    prime_seq = 1
    prime_num = 0
    while prime_seq < seq_range_to :
        if is_prime_num(num) == True :
            prime_seq += 1
            prime_num = num
        num += 2
    return prime_num

print(find_prime_num(10001))