import math
prime_numbers = []
num =2
end =Falsewhile not end:
num_sqrt = math.ceil(math.sqrt(num))
is_prime =Truefor prime_num in prime_numbers:if prime_num < num_sqrt +1:if num % prime_num ==0:
is_prime =Falseelse:breakif is_prime:
prime_numbers.append(num)
num +=1iflen(prime_numbers) ==10001:breakprint(prime_numbers[-1])