Talk:Iterated digits squaring: Difference between revisions

: Thank you for your comments.

# The original Euler problem ha a limit of 10 millions. I think it's not a good idea to lower the limit too much (like 1 million): the point of having a high limit is to nudge people away from the very short brute-force solutions and toward a little smarter combinatorics-based solutions. To show it can be done I have added a not too much long Python solution that solves the problem with 100 millions in less than half second on a slow PC.

# Regarding the limits, I have used standard mathematical notation, but the current <= < notation is OK.

# Regarding the caching, it can be explained in the task description, but in the solutions I'd like to see less catching and more (simple) combinatorics. --[[User:Bearophile|bearophile]] ([[User talk:Bearophile|talk]]) 08:17, 24 August 2014 (UTC)