On Thu, Dec 30, 2010 at 9:03 AM, David Nolen <dnolen.li...@gmail.com> wrote: > From the Qi mailing list: > http://groups.google.com/group/qilang/browse_thread/thread/e4a2f534fad5032a > "I contend that this kind of problem cannot be solved (efficiently) in any > pure functional programming language. You may disagree" > :D > David
Has anyone looked at this yet? I wrote a Clojure program to solve the challenge, but I keep coming up with a count of 63,422 prime squares, not 35,953. I've posted a text file containing all the prime squares I found: https://docs.google.com/leaf?id=0B0JrHNwD7hNSZTBmMzg5ZGEtZWZmZC00ZWI3LTk4MWItMjU2MDljMDBjYjNm&hl=en I'd love to have another set of eyes on this. If you find the challenge interesting, but not enough to want to code the whole solver from scratch, maybe you could write a verifier to check and make sure that each of my prime squares satisfies the constraints of the problem and is unique with respect to isomorphism. I've verified it myself, but maybe there's some subtlety I'm missing. If 63422 is correct and I can get independent confirmation, it would be fun to go back to the author of the challenge and say "Your C++ solution may be fast, but in a functional programming language, at least we get the right answer :) " Thanks. -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
