Files
pythonprimes/simplefindprime.py
ducoterra 0a652e8f4c init
2018-08-14 00:20:31 -04:00

37 lines
606 B
Python

from addit import timeit, printit, threadit, processit
def isprime(number):
"""
checks if a number is prime by dividing it into every number less than it
"""
for i in range(2,number):
if number % i == 0:
return False
return True
@timeit
def findprimesto(primecap):
for i in range(0, primecap):
isprime(i)
@timeit
def findxprimes(x):
primelist = []
current_num = 2
while len(primelist) < x:
if isprime(current_num):
primelist.append(current_num)
current_num += 1
return primelist
findxprimes(1000)