[Haskell-cafe] Flagstone problem

Alexander Solla ajs at 2piix.com
Sat Nov 6 13:40:35 EDT 2010

On Nov 6, 2010, at 4:03 AM, Brent Yorgey wrote:

> Doesn't make much sense to me.  The sum of binary digits in the binary
> representation of n will not be zero very often...

I think they mean "the sum (mod 2)" when they say "the sum of binary  
digits".  That should be zero "half" the time.

More information about the Haskell-Cafe mailing list