Re: [Haskell-cafe] Zumkeller numbers

On Dec 8, 2009, at 8:44 PM, Ketil Malde wrote:

"Richard O'Keefe" writes:

...

factors n = [m | m <- [1..n], mod n m == 0]

I should remark that I wasn't *trying* to write fast code. I was trying to code as directly as I could, fully expecting to have to rewrite later. I was pleasantly surprised that it was fast enough for my purposes. The focus of my attention was actually on "can this list of numbers be divided into two parts with the same sum", which was to me the novel part.