Show that a three-dimensional 2n 2n 2n checkerboard with one 1 1 1

Question:

Show that a three-dimensional 2n × 2n × 2n checkerboard with one 1 × 1 × 1 cube missing can be completely covered by 2 × 2 × 2 cubes with one 1 × 1 × 1 cube removed.
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: