def main():
sum = 0
for i in xrange(1, 10**6):
di, bi = '{:d}'.format(i), '{:b}'.format(i)
if is_palindromic(di) and is_palindromic(bi):
sum += i
return sum
def main():
"""
>>> main()
872187
"""
numbers = xrange(1, 10 ** 6, 2)
palindroms = [n for n in numbers if is_palindromic(str(n))]
palindroms = [n for n in palindroms if is_palindromic(bin(n)[2:])]
print(sum(palindroms))
def is_lychrel(i):
for c in xrange(50):
i += int(''.join(reversed(str(i))))
if is_palindromic(str(i)):
return False
else:
return True
def isLychrel(n): number = n for i in range(1, 51): number = reverseAdd(number) if is_palindromic(number): return False return True
def main():
"""
>>> main()
249
"""
count = 0
for i in range(1, 10000):
for _ in range(50):
i = i + reverse(i)
if is_palindromic(i):
break
if not is_palindromic(i):
count += 1
print(count)
def is_lychrel(number, max_iterations=50): tmp_number = number for iteration in xrange(1, max_iterations+1): tmp_number += int(str(tmp_number)[::-1]) if is_palindromic(tmp_number): return False return True
def main():
"""
>>> main()
906609
"""
max_palindrom_number = 0
for multiplier in range(100, 1000):
for multiplicand in range(multiplier, 1000):
product = multiplier * multiplicand
if is_palindromic(product) and product > max_palindrom_number:
max_palindrom_number = product
print(max_palindrom_number)
def is_lychrel(d): for i in range(iterations): d = d + reverse_digits(d) if is_palindromic(d): return False return True
import itertools from euler import is_palindromic print max(a*b for a in xrange(100,1000) for b in xrange(100,1000) if is_palindromic(a*b))
