isPrimeNumber() by Recursion in Python

In the pursuit to optimize some code In was writing I had to write this isPrime() by recursion.

	import math
	def isprime_raw(n,i,limit):
	if(n == 1):
	return False
	elif (i >= limit):
	return True
	elif ((n%i) != 0):
	return (True and isprime_raw(n,i+1,limit))
	return False
	def isPrime(x):
	return isprime_raw(x,2,int(math.sqrt(x))+1)

view raw gistfile1.py hosted with ❤ by GitHub