1
0
www.mikescher.com/www/statics/euler/Euler_Problem-037_explanation.md

2 lines
353 B
Markdown
Raw Normal View History

2017-11-08 17:39:50 +01:00
The approach for this problem is to first iterate through the left-truncatable primes and test if these are right-truncatable. All with the help of our trusty companion the *sieve of Eratosthenes*.
Tricky was that the generation of left-truncatable primes, my original algorithm was recursive and I had to transform it to an iterative one for befunge.