<table cellspacing="0" cellpadding="0" border="0" ><tr><td valign="top" style="font: inherit;">Hi, Alexander<br><br>Your change produces the same sequence of 0s, 1s, and 2s.<br><br>mod n 2 == fromEnum (even n)<br><br>Michael<br><br><br>--- On <b>Sat, 11/6/10, Alexander Solla <i><ajs@2piix.com></i></b> wrote:<br><blockquote style="border-left: 2px solid rgb(16, 16, 255); margin-left: 5px; padding-left: 5px;"><br>From: Alexander Solla <ajs@2piix.com><br>Subject: Re: [Haskell-cafe] Flagstone problem<br>To: <br>Cc: "haskell-cafe Cafe" <haskell-cafe@haskell.org><br>Date: Saturday, November 6, 2010, 1:40 PM<br><br><div class="plainMail"><br>On Nov 6, 2010, at 4:03 AM, Brent Yorgey wrote:<br><br>> Doesn't make much sense to me. The sum of binary digits in the binary<br>> representation of n will not be zero very often...<br><br>I think they mean "the sum (mod 2)" when they say "the sum of binary digits". That should be zero
"half" the time.<br>_______________________________________________<br>Haskell-Cafe mailing list<br><a ymailto="mailto:Haskell-Cafe@haskell.org" href="/mc/compose?to=Haskell-Cafe@haskell.org">Haskell-Cafe@haskell.org</a><br><a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br></div></blockquote></td></tr></table><br>