Skip to content

Instantly share code, notes, and snippets.

@BedirYilmaz
Last active October 22, 2016 01:39
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save BedirYilmaz/1bd2dab68dec1d1b1c094fb5ebaddb1e to your computer and use it in GitHub Desktop.
Save BedirYilmaz/1bd2dab68dec1d1b1c094fb5ebaddb1e to your computer and use it in GitHub Desktop.
Find 10001 nth prime number
# Special thanks to Ceyhan Yılmaz and cosinus
def nthPrime(n):
number = 3
primemultiples = []
primes = []
primes.append(2)
prime = True
while (len(primes)<=n):
prime = True
if number in primemultiples:
prime = False
number +=2
continue
for i in range (3, number):
if number%i == 0:
prime = False
break
if(prime):
multiple = number
while multiple <= n:
multiple *= 2
primemultiples.append(multiple)
primes.append(number)
number += 2
return primes[n-1]
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment