# Is there a method to cut a hypercube into disjoint cubes [closed]

Since Borsuk conjecture hold for centrally symmetric convex sets in $$\mathbb{R}^n$$ so we can cut a hypercube into at least $$n+1$$ disjoint parts.

Is there a method how can one do that?

## closed as off-topic by user44191, Sean Lawton, Jan-Christoph Schlage-Puchta, Pace Nielsen, Sebastian GoetteApr 17 at 15:45

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question does not appear to be about research level mathematics within the scope defined in the help center." – user44191, Sean Lawton, Jan-Christoph Schlage-Puchta
If this question can be reworded to fit the rules in the help center, please edit the question.

• What is the question, exactly? – Pietro Majer Apr 16 at 18:53
• If $[-1,1]^n$ is decomposed into $[-1,0]\times[-1,1]^{n-1}$ and $(0,1]\times [-1,1]^{n-1}$, then the two pieces have diameter $2\sqrt{n-\frac 34}$ while the hypercube has diameter $2\sqrt n$, showing that the hypercube is not a counterexample. – Anthony Quas Apr 16 at 23:04
• The Borsuk conjecture on centrally symmetric convex sets only guarantees pieces with smaller diameter, not similar figures. – Bullet51 Apr 17 at 0:09