Consider the 2^{n} points in the space ℝ^{n}
whose coordinates are all in {0,1}.
To cover all 2
This month's question: find, with proof, the exact minimum number of hyperplanes
required to cover all points |
## List of solvers:Daniel Bitin (4 February 20:41)Dan Dima (20 February 00:17) Nikhil Mande (21 February 23:07) |

Elegant and original solutions can be submitted to the puzzlemaster at __riddlesbrand.scso.com__.
Names of solvers will be posted on this page. Notify if you don't want
your name to be mentioned.

The solution will be published at the end of the month.

Enjoy!