Oh right. What you said is what I meant. I renamed the functions improperly and then fooled myself. But I still can't figure out why the second one is much slower.
On Jul 21, 4:09 pm, Tassilo Horn <tass...@member.fsf.org> wrote: > nil <ache...@gmail.com> writes: > > Hi! > > > The two functions below should return true if the first argument is > > divisible by any of the prime numbers (ascending) in the second > > argument, and false otherwise. > > Without testing, I cannot see that these functions do what you want. At > least the second looks like it returns true if n is *not* divisible by > any prime in coll. > > Bye, > Tassilo -- 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
