10001st prime - Project Euler Soution

Deepak Raj - Aug 1 '20 - - Dev Community

10001st prime - Project Euler Soution

Topic: 10001st prime

Problem Statement:

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 10 001st prime number?

You can find the original question here -> Project Euler

10001st prime - Project Euler Solution in Python

import itertools

def is_prime(n):
    for i in range(2, n//2 + 1):
        if n % i == 0:
            return False
        else:
            continue
    return True

p = 0
for x in itertools.count(1):
    if is_prime(x):
        if p == 10001:
            print(x)
            break
        p += 1        
Enter fullscreen mode Exit fullscreen mode

Share Your Solutions for 10001st prime

Checkout the optimized solution in the comment section.

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Terabox Video Player