Euler 55: Lychrel numbers

gistfile1.txt

# http://projecteuler.net/problem=56

# first, a few functions we'll use- i particularly like the reverse

def reverse(string):
	string = string[::-1]
	return string

def is_pali(string):
 	if string==reverse(string):
 		return True
 	else:
 		return False

# is_lychrel is a recursive function! i wrote it without any help!
 
def is_lychrel(x,y):
	sum = x + int(reverse(str(x)))
	if is_pali(str(sum)) == True:
		return False
	if y > 50:
		return True
	else:
		y = y + 1
		return is_lychrel(sum,y)

# now we simply ask if each number is lychrel and count
count = 0
for i in range (0,10000):
	if is_lychrel(i,0):
		count += 1
print "Answer:",count