> this is a “hold unto head” problem.
>
> Am 17.11.2011 um 15:06 schrieb Julian Kelsey:
>
> > (def seq-3s-n-5s
> > (filter
> > (fn [n] (or (= 0 (mod n 5)) (= 0 (mod n 3)) ) )
> > (iterate inc 1)))
>
> Here you keep a reference to the h
es: we can trust that (nth seq N) is not the problem, it returns in
reasonable time for a test like this: (nth (iterate inc 1) (Math/pow 10 9))
Cheers,
Julian Kelsey.
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, sen
