Thursday, March 14, 2013

project euler problem 037

Truncatable primes

I am a little bit upset I used emacs to figure out how to "continuously remove digits from left to right". Maybe I was watching TV while coding. It is an easy
problem, but I was wondering how to prove that there is only 11 such numbers.

Discussion thread!!!

Zef enlightened me why there are only 11 such numbers, and I learned another way of expressing decimal numbers. It is really interesting! Please read it if you have no idea what I am talking about.

To help others to focus on the discussion thread is one of my goals to write the blog.

No comments:

Post a Comment