mirror of
https://github.com/autistic-symposium/master-algorithms-py.git
synced 2025-04-30 12:46:11 -04:00
33 lines
686 B
Python
33 lines
686 B
Python
#!/usr/bin/python3
|
|
# mari von steinkirch @2013
|
|
# steinkirch at gmail
|
|
|
|
import math
|
|
|
|
def is_prime(number, prime_set):
|
|
if number in prime_set: return True
|
|
for i in range(2, int(math.sqrt(number)) + 1):
|
|
if not number%i: return False
|
|
return True
|
|
|
|
|
|
def findstprime(n):
|
|
count = 0
|
|
candidate = 1
|
|
prime_set = set()
|
|
while count < n:
|
|
candidate +=1
|
|
if is_prime(candidate, prime_set):
|
|
prime_set.add(candidate)
|
|
count += 1
|
|
return candidate
|
|
|
|
def main():
|
|
assert(findstprime(6 == 13))
|
|
print(findstprime(10001))
|
|
print('Tests Passed!')
|
|
|
|
if __name__ == '__main__':
|
|
main()
|
|
|