Simpler primes example 
11 Mar 2012, 23:57
tom hall (1 post) 
Section 3.3, you coul avoid using the factor ring as I think it’s non obvious whats going on (def primessimple (concat [2 3 5 7] (lazyseq (let [primesfrom (fn primesfrom [n] (if (some #(zero? (rem n %)) (takewhile #(<= (* % %) n) primessimple)) (recur (+ n 1)) (lazyseq (cons n (primesfrom (+ n 1))))))] (primesfrom 11))))) 
01 Apr 2012, 04:32
Gregg Williams (4 posts) 
I agree! I’ve been writing Clojure code for two years and I can’t figure out how this code works. (I’m reading the beta 5 book, page 71.) I’m rereading the book (I also have the original Programming Clojure book) from the start, and this code is much harder than all the other code so far. Without some qualification in the text (e.g., “Don’t worry about not understanding this…”), this is very jarring. 
11 Dec 2012, 21:59
Erik Pischel (1 post) 
On a freshly installed leiningen, it doesn’t even compile:

You must be logged in to comment 