Revision as of 19:30, 7 October 2008 by Ngw (Talk)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

The first part is pretty straight forward I think. There is only 1 way that all is 1, out of 2^10 ways.

But the problem comes at (b), anyone has any idea how to do this?

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood