Answer 1

i=2
def isprime( n ) :
if n%i==0 :
return " not prime "
else :
if i== int( n**0.5 )+1 :
return "prime"
i+=1
isprime( n )

#### prime check with recursion####