def double_base_palindromes(pInt): lSum = 0 for i in range(0, pInt): if is_palindrome(i) and is_palindrome_binary(i): lSum += i return lSum
def largest_palindrome_product(pInt): lMax = 0 for i in range(pInt, 1, -1): for k in range(pInt, 1, -1): if is_palindrome(i * k): if i * k > lMax: lMax = i * k return lMax