generally whitout that plus one the function will return True for all square of prime numbers. :)

I'll fork it, and test for that.

for i in range(2,int(sqrt(x))):
should be:
for i in range(2,int(sqrt(x))+1):
otherwise prime(4) will return True

Question asks for a recursive approach :/