Question

I want a python code using recursion ONLY.

I cannot use any loops, dictionaries or modules.

Only math module is allowed.

I want a function that creates a list of the first N prime numbers:

for eg create_primes(2) = [2,3]

create_primes(5) = [2,3,5,7,11]

def create_primes(N):

pass

Answer 1

import sys
sys.setrecursionlimit(5000) # set the recusion limit by default it is 1000
list=[] # store the N prime numbers
k=2
count=2
# method to check the given number is prime or not
def isprime(n,count):
if count==n:
return True
elif n%count==0:
return False
else:
return isprime(n,count+1)
# method return the list containing the first N prime numbers
def create_primes(N):
global list,k
if N==0:
return list
else:
if isprime(k,count):
list.append(k)
k+=1
return create_primes(N-1)
else:
k+=1
return create_primes(N)
# Take input from users
N=int(input("Enter the Number "))
#printing the prime number list
print("The First ",N," prime numbers are ---->",create_primes(N))