brand.scso.com.
Names of solvers will be posted on this page. Notify if you don't want
your name to be mentioned.
|
Consider the 2n points in the space ℝn
whose coordinates are all in {0,1}.
To cover all 2n points by hyperplanes, two hyperplanes suffice: one defined by the equation x1=0 and the other defined by x1=1. This month's question: find, with proof, the exact minimum number of hyperplanes required to cover all points except the origin. The origin should remain uncovered by all planes. |
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!