We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.

# Project Euler #55: Lychrel numbers

# Project Euler #55: Lychrel numbers

+ 1 comment a couple more testcases

you may notice that the counts of 79497 are different for N=10000 and N=50000, think about why

N=1000 -> 1111 25 N=5000 -> 12221 88 N=10000 -> 79497 215 N=50000 -> 79497 295 N=100000 -> 4964444694 583

+ 1 comment With palindromic numbers excluded I get wrong answer for TC #0 but success for all other TCs, still get 100 points. When I include palindromic numbers, I got success only for TC #0. My solution says that count for 121 should be 17.

+ 1 comment Doesn't 55 also converge to 121, because 55+55 (reverse of 55)+11 (reverse of 110)=121?

+ 2 comments Should the palindrome we are looking for be less than N? I am confused about whether the palidrome returned can be greater than N or not.

+ 0 comments **HINT**: For Python you should use dictionary instead of list to store values because it saves a lot of running time and space!

Load more conversations

Sort 21 Discussions, By:

Please Login in order to post a comment