human
Recursive program for prime number | Returns true if n is prime , else return false . i is current divisor to check ..
Base cases.
Check for next divisor.
Driver Program"
How can the above be solved in Python?
assistant
#Here is code to recursive program for prime number and the other steps required.
 def isPrime ( n , i = 2 ) :
	if ( n <= 2 ) :
		return True if ( n == 2 ) else False
	if ( n % i == 0 ) :
		return False
	if ( i * i > n ) :
		return true
	return isPrime ( n , i + 1 )
n = 15
if ( isPrime ( n ) ) :
	print ( " Yes " )
else :
	print ( " No " )