I’d be interested to see that research, but I guess the story isn’t _too_ incredible.

]]>Thanks.

(let ((max-lisp-eval-depth 10000)

(max-specpdl-size 10000))

(length (primes 1 10000)))

(let ((max-lisp-eval-depth 1000)) (primes 2 997))

:)

No, it wouldn’t have found it if the answer hadn’t been in that range. However, I originally ran it on all the numbers (not just prime) between 2 and 999. It took a few seconds to run and determined the correct result. It wasn’t really necessary to restrict the search to just primes.

I actually solved the problem a few months ago so I forget why I chose a range of 900 to 1000. Could it be because recursion is extremely limited in emacs and it was unable to generate primes from 2 to 999?

]]>