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.
_______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
