daily log 12.08.20
less than 1 minute read
is prime function
def is_prime(num):
even_num = True if num%2==0 else False
if even_num and num != 2:
return False
for i in range(3, int((num+1)/2) ):
if num%i==0:
return False
return True
REFACTORED is prime function
def is_prime(num):
if num < 2:
return False
if num%2==0 and num != 2:
return False
for i in range(3, int((num+1)/2) ):
if num%i==0:
return False
return True
def get_nth_prime(n):
primes = []
counter = 2
while len(primes) < n:
if is_prime(counter):
primes.append(counter)
counter += 1
return primes[n-1]
get_nth_prime(6)
get_nth_prime(10001)