def main(): palindromes = {} for i in range(1000): for j in range(1000): pal = i * j if ispalindrome(pal): palindromes[pal] = str(i) + "x" + str(j) print max(palindromes.keys()), palindromes[max(palindromes.keys())]
def isLychrel(n): for i in range(50): n = n + int(str(n)[::-1]) if ispalindrome(n): return True return False
#/usr/bin/env python from common import ispalindrome sum = 0 for n in xrange(1, 1000000): if ispalindrome(n) and ispalindrome(str(bin(n))[2:]): print n, bin(n) sum = sum + n print "sum = ", sum