Show that an n × n checkerboard with one square removed
Chapter 5, Problem 80E(choose chapter or problem)
Problem 80E
Show that an n × n checkerboard with one square removed can be completely covered using right triominoes if n > 5, n is odd. and 3 ∤ n
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