Show that a three-dimensional 2 n × 2n × 2 n checkerboard
Chapter 5, Problem 79E(choose chapter or problem)
Show that a three-dimensional 2 n × 2n × 2 n checkerboard with one 1 × 1 × 1 cube missing can be completely covered by 2 × 2 × 2 cubes with one l×l×l cube removed.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer